Add to ORKGThe distribution of prime numbers in Lucas sequences was investigated by independently changing the initial values and the multiplicative constants in the recursive definition of the sequence. The prime distribution was obtained by counting the number of primes in the first 1000 terms of various Lucas sequences. It was found that both smaller seeds and smaller multipliers produced more primes on average than if the seeds and multipliers were large. It was also determined that changing the initial seeds produced more primes and more variation in prime counts than changing the multipliers.Science, Faculty ofUnreviewedUndergraduat
Fibonacci numbers are defined as recursively as F_(n+1)=F_n+F_(n-1) with initial conditions F_1=F_2=...
Starting from the result that the prime distribution is deterministic, we show in its maximal reduce...
We present the main results, conjectures and ideas concerning the distribution of primes. We recount...
The distribution of prime numbers in Lucas sequences was investigated by independently changing the ...
Knowledge about number theory and prime numbersEuclid proved that the number of prime numbers is inf...
A real Lucas sequence—named for the French mathematician Édouard Lucas—is determined recursively by...
This dissertation focuses on studying the patterns in the prime number distribution. It visualizes t...
Lucas sequences, which generalize the famous Fibonacci sequence, have been studied extensively in th...
We present an application of difference equations to number theory by considering the set of linear ...
In this work, we show that the set of primes can be obtained through dynamical processes. Indeed, we...
We examine results concerning the generation of primes in certain types of integer sequences. The se...
Abstract. In 1876, E. Lucas showed that a quick proof of primality for a prime p could be attained t...
AbstractIn 1878 Lucas established a method of computing binomial coefficients modulo a prime. We est...
AbstractLet u=(un)n=0∞ be a Lucas sequence, that is a binary linear recurrence sequence of integers ...
To all the people that encouraged me to study mathematics and all the people I’ve met through these ...
Fibonacci numbers are defined as recursively as F_(n+1)=F_n+F_(n-1) with initial conditions F_1=F_2=...
Starting from the result that the prime distribution is deterministic, we show in its maximal reduce...
We present the main results, conjectures and ideas concerning the distribution of primes. We recount...
The distribution of prime numbers in Lucas sequences was investigated by independently changing the ...
Knowledge about number theory and prime numbersEuclid proved that the number of prime numbers is inf...
A real Lucas sequence—named for the French mathematician Édouard Lucas—is determined recursively by...
This dissertation focuses on studying the patterns in the prime number distribution. It visualizes t...
Lucas sequences, which generalize the famous Fibonacci sequence, have been studied extensively in th...
We present an application of difference equations to number theory by considering the set of linear ...
In this work, we show that the set of primes can be obtained through dynamical processes. Indeed, we...
We examine results concerning the generation of primes in certain types of integer sequences. The se...
Abstract. In 1876, E. Lucas showed that a quick proof of primality for a prime p could be attained t...
AbstractIn 1878 Lucas established a method of computing binomial coefficients modulo a prime. We est...
AbstractLet u=(un)n=0∞ be a Lucas sequence, that is a binary linear recurrence sequence of integers ...
To all the people that encouraged me to study mathematics and all the people I’ve met through these ...
Fibonacci numbers are defined as recursively as F_(n+1)=F_n+F_(n-1) with initial conditions F_1=F_2=...
Starting from the result that the prime distribution is deterministic, we show in its maximal reduce...
We present the main results, conjectures and ideas concerning the distribution of primes. We recount...