A Congruent Property of Gibonacci Number Modulo Prime

نویسندگان

چکیده

Let a, b ∈ Z and p be a prime number such that are not divisible by p. In this work, we give congruent property modulo of the gibonacci defined Gn = Gn−1 + Gn−2 with initial condition G1 G2 b. We show sequence satisfying Gkp−(p/5) ≡ Gk−1 (mod p) for all positive integer k odd ≠ 5 if only p). Moreover, each p, necessary sufficient yielding also find relation between sequences in same equivalent class constructed Aoki Sakai [1] leads to property.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The Least Prime Congruent to One Modulo n

It is known that there are infinitely many primes ≡ 1 (modn) for any integer n > 1. In this paper, we use an elementary argument to prove that the least such prime satisfies p ≤ 2 − 1, where φ is the Euler totient function.

متن کامل

Set systems with I-intersections modulo a prime number

Let p be a prime and let L = {l1, l2, . . . , ls} and K = {k1, k2, . . . , kr} be two subsets of {0, 1, 2, . . . , p − 1} satisfying max lj < min ki. We will prove the following results: If F = {F1, F2, . . . , Fm} is a family of subsets of [n] = {1, 2, . . . , n} such that |Fi ∩ Fj | (mod p) ∈ L for every pair i 6= j and |Fi| (mod p) ∈ K for every 1 ≤ i ≤ m, then |F| ≤ ( n− 1 s ) + ( n− 1 s− 1...

متن کامل

Number theoretic transform modulo K.2N+1, a prime

Due to its simple and real arithmetic structure Number Theoretic Transform is attractive for computation of convolution. However, there exists a stringent relation between the choice of modulus M and convolution length. Choice of modulus as K.2+1, a prime, leads to relaxation of this constraint and wide choices of wordlength, with each of these associated with many choices of convolution length...

متن کامل

Bell Numbers Modulo a Prime Number, Traces and Trinomials

Given a prime number p, we deduce from a formula of Barsky and Benzaghou and from a result of Coulter and Henderson on trinomials over finite fields, a simple necessary and sufficient condition β(n) = kβ(0) in Fpp in order to resolve the congruence B(n) ≡ k (mod p), where B(n) is the n-th Bell number, and k is any fixed integer. Several applications of the formula and of the condition are inclu...

متن کامل

Orders Modulo A Prime

In this article I develop the notion of the order of an element modulo n, and use it to prove the famous n 2 + 1 lemma as well as a generalization to arbitrary cyclotomic polynomials. References used in preparing this article are included in the last page. §1 Introduction I might as well state one of the main results of this article up front, so the following discussion seems a little more moti...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: International Journal of Analysis and Applications

سال: 2023

ISSN: ['2291-8639']

DOI: https://doi.org/10.28924/2291-8639-21-2023-24