DOCSLIB.ORG

Properties of Pell Numbers Modulo Prime Fermat Numbers 1 General

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Properties of Pell Numbers Modulo Prime Fermat Numbers 1 General Properties of Pell numbers modulo prime Fermat numbers Tony Reix ([email protected]) 2005, ??th of February The Pell numbers are generated by the Lucas Sequence: 2 Xn = P Xn−1 QXn−2 with (P, Q)=(2, 1) and D = P 4Q = 8. There are: − − − The Pell Sequence: Un = 2Un−1 + Un−2 with (U0, U1)=(0, 1), and ◦ The Companion Pell Sequence: V = 2V + V with (V , V )=(2, 2). ◦ n n−1 n−2 0 1 The properties of Lucas Sequences (named from Edouard´ Lucas) are studied since hundreds of years. Paulo Ribenboim and H.C. Williams provided the properties of Lucas Sequences in their 2 famous books: ”The Little Book of Bigger Primes” (PR) and ”Edouard´ Lucas and Primality Testing” (HCW). The goal of this paper is to gather all known properties of Pell numbers in order to try proving a faster Primality test of Fermat numbers. Though these properties are detailed in the Ribenboim’s and Williams’ books, the special values of (P, Q) lead to new properties. Properties from Ribenboim’s book are noted: (PR). Properties from Williams’ book are noted: (HCW). Properties built by myself are noted: (TR). n -3 -2 -1 0 1 2 3 4 5 6 7 8 9 10 Un 5 -2 1 0 1 2 5 12 29 70 169 408 985 2378 Vn -14 6 -2 2 2 6 14 34 82 198 478 1154 2786 6726 Table 1: First Pell numbers 1 General properties of Pell numbers 1.1 The Little Book of Bigger Primes The polynomial X2 2X 1 has discriminant D = 8 and roots: − − α = 1 √2 β ± 1 So: α + β = 2 αβ = 1 − α β = 2√2 − and we define the sequences of numbers: αn βn U = − and V = αn + βn for n 0. n α β n ≥ − Hereafter, n and m represent any positive or negative integer. p represents a prime number. The properties provided by P. Ribenboim have been extended for negative values of n of Un and Vn : U =( 1)n+1U −n − n V =( 1)nV −n − n (PR) IV.1 Un = 2Un−1 + Un−2 U0 = 0, U1 = 1 Vn = 2Vn−1 + Vn−2 V0 = 2, V1 = 2 (PR) IV.2 U2n = UnVn V = V 2 2( 1)n 2n n − − (PR) IV.3 U = U V ( 1)nU m+n m n − − m−n V = V V ( 1)nV m+n m n − − m−n (PR) IV.4 Um+n = UmUn+1 + Um−1Un 2Vm+n = VmVn + 8UmUn (PR) IV.5 4U = V V n n+1 − n 4Un = Vn + Vn−1 8Un = Vn+1 + Vn−1 V = 2(U U ) n n+1 − n Vn = 2(Un + Un−1) Vn = Un+1 + Un−1 (PR) IV.6 U 2 = U U ( 1)n n n−1 n+1 − − V 2 = 4(2U 2 +( 1)n) or V 2 8U 2 =( 1)n4 n n − n − n − 2 (PR) IV.7 U V U V = 2( 1)nU m n − n m − m−n UmVn + UnVm = 2Um+n ⌊(n−1)/2⌋ n i (PR) IV.8 Un = i=0 2i+1 2 P ⌊n/2⌋ n i Vn = 2 i=0 2i 2 n− P 2 1 2n i n V2 = 2 i=0 2i 2 P (PR) IV.9 modd 23(m−1)/2U m = (m−1)/2 m ( 1)kiU k i=0 i − k(m−2i) P V m = (m−1)/2 m ( 1)kiV k i=0 i − k(m−2i) P m even 23m/2U m = m/2 m ( 1)(k+1)iV m ( 1)(k+1)m/2 k i=0 i − k(m−2i) − m/2 − P V m = m/2 m ( 1)kiV m ( 1)km/2 k i=0 i − k(m−2i) − m/2 − P (PR) IV.10 m odd U = (m+1)/2( 1)i+1V +( 1)(m+1)/2 m i=1 − m+1−2i − U = VP V + ... V 1 m m−1 − m−3 ± 0 ∓ ⌊(m+1)/4⌋ Um = 2 i=1 Vm+2−4i + 1 Um = 2(PVm−2 + Vm−6 + Vm−10 + ...) + 1 m even U = m/2( 1)i+1V m i=1 − m+1−2i U = VP V + ... V V m m−1 − m−3 ± 3 ∓ 1 m 0 (mod 4) U = 2 m/4 V ≡ m i=1 m+2−4i Um = 2(PVm−2 + Vm−6 + Vm−10 + ... + V2) m 2 (mod 4) U = 2( (m−2)/4 V + 1) ≡ m i=1 m+2−4i Um = 2(VPm−2 + Vm−6 + Vm−10 + ... + V4 + 1) modd 2m = (m−2)/2 m ( 1)iV + m ( 1)(m)/2 i=0 i − m−2i m/2 − 2m = VP m V + m V ... 2 m m − 1 m−2 2 m−4 − ± (m−1)/2 m even 2m = (m−1)/2 m ( 1)iV i=0 i − m−2i 2m = VP m V + m V ... m m − 1 m−2 2 m−4 − ± m/2 (PR) IV.11 ... 3 ( D/ ) ( D/ ) = +1 when p 1 (mod 8) p p ≡ ± ( D/ )= 1 when p 3 (mod 8) p − ≡ ± (PR) IV.13 U 23(p−1)/2U (mod p) kp ≡ k 3(p−1)e/2 U e 2 (mod p) p ≡ U ( D/ ) (mod p) p ≡ p (PR) IV.14 V 2 (mod p) p ≡ (PR) IV.15 n, k 1 U U ≥ n | kn (PR) IV.16 n, k 1, k odd V V ≥ n | kn ρ(p) n 2, if exists r 1 such that n U , thenρ(n) is the smallest such r. ≥ ≥ | r (PR) IV.18 U n (mod 2) n ≡ V 0 (mod 2) n ≡ ψ(p) ψ(p)= p ( 8/ ) − p (PR) IV.19 p 1 (mod 8) p U = U ≡ ± | ψ(p) p−1 ρ(p) ψ(p)= p 1 | − p 3 (mod 8) p U = U ≡ ± | ψ(p) p+1 ρ(p) ψ(p)= p + 1 | (PR) IV.20 e 1 such that pe U and pe+1 ∤ U ≥ | m m e+f if p ∤ k and f 1 then p U f ≥ | mkp (PR) IV.21 n U | λα,β(n) n U | ψα,β(n) (PR) IV.22 p 1 (mod 8) V /2 +1 (mod p) ≡ ± p−1 ≡ p 3 (mod 8) V /2 1 (mod p) ≡ ± p+1 ≡ − (PR) IV.23 p +1 (mod 8) p U ≡ | (p−1)/2 p +3 (mod 8) p V ≡ | (p+1)/2 p 3 (mod 8) p U ≡ − | (p+1)/2 p 1 (mod 8) p V ≡ − | (p−1)/2 4 (PR) IV.24 gcd(Un, Vn) = 1 or 2 (PR) IV.30 p 1 (mod 8) U U (mod p) ≡ ± n+p−1 ≡ n V V (mod p) n+p−1 ≡ n The period is: p 1. − p 3 (mod 8) e order of 1(mod p) ???? ≡ ± − U U (mod p) n+e(p+1) ≡ n V V (mod p) n+e(p+1) ≡ n The period is: e(p + 1). 1.2 Edouard´ Lucas and Primality Testing (HCW) 4.2.12 m-n even U 2 U 2 = U U m − n m+n m−n V 2 V 2 = 8U U m − n m+n m−n 2 2 m-n odd Um + Un = Um+nUm−n V 2 V 2 = 8U U m − n m+n m−n (HCW) 4.3.2 pλ = 2 , if pλ U , then pλ+1 U . 6 k n k pn (HCW) 4.2.3 2Um+n = UmVn + VmUn 2Vm+n = VmVn + 8UmUn (HCW) 4.2.5 V 2 8U 2 = 4( 1)n n − n − (HCW) 4.2.9 U = V U +( 1)nU m+n m n − m−n V = 8U U +( 1)nV m+n m n − m−n (HCW) 4.2.13 V 2 ( 1)m−nV 2 = 8(U 2 ( 1)m−nU 2) m − − n m − − n (HCW) 4.2.23 16U = V 2 V 2 2n n+1 − n−1 2U = U 2 U 2 2n n+1 − n−1 5 1.3 Other properties MathWorld The Pell Equation: x2 2y2 = 1 is linked with − the continued fraction: √2=[1, 2 ]. With: n 1, P = Q = 1,a = 2 , the solutions (p ,q ) ≥ n n n n n of: p2 2q2 = 1 are: n odd,p =(V )/2,q = U . n − n n n+1 n n+1 m () Vn(Vm(P, Q), Q )= Vnm(P, Q) n+1 ⌊ 2 ⌋ n−i n−2i (R. Ram) Un = 2 i=1 i−1 2 2 P 2 (R. Melham) Un + Un−1Un+1 = Vn /4 2 2 Vn + Vn−1Vn+1 = 16Un Binomials 1 0 <k<p p 0 (mod p) k ≡ 0 k<p p−1 ( 1)k (mod p) ≤ k ≡ − 1.4 New (?) properties n−1 (TR) ? 2Un = i=1 Vi P n−1 Vn =2+4 i=1 Ui P (TR) 1 Vn + Vn+1 = 4Un+1 V V = 4U n+1 − n n Proof: Use (PR) IV.5b and IV.1 . Same as (PR) IV.5 2 2 (TR) 2 Vn + Vn+1 = 8U2n+1 Proof: Use (PR) IV.2 and IV.5a . 2 2 (TR) 3 Un + Un+1 = U2n+1 Proof: Use (PR) IV.6a and IV.4a . 2 2 Vn + Vn+1 (TR) 4 2 2 = 8 Un + Un+1 Proof: Use (TR) 2 and 3 . (TR) 5 V + V = 8U U (n odd) (for m n) m+n m−n m n ≥ V + V = V V (n even) (for m n) m+n m−n m n ≥ Proof: Use (PR) IV.4b and IV.3b .
Load more

Recommended publications
  • New Formulas for Semi-Primes. Testing, Counting and Identification
    New Formulas for Semi-Primes. Testing, Counting and Identification of the nth and next Semi-Primes Issam Kaddouraa, Samih Abdul-Nabib, Khadija Al-Akhrassa aDepartment of Mathematics, school of arts and sciences bDepartment of computers and communications engineering, Lebanese International University, Beirut, Lebanon Abstract In this paper we give a new semiprimality test and we construct a new formula for π(2)(N), the function that counts the number of semiprimes not exceeding a given number N. We also present new formulas to identify the nth semiprime and the next semiprime to a given number. The new formulas are based on the knowledge of the primes less than or equal to the cube roots 3 of N : P , P ....P 3 √N. 1 2 π( √N) ≤ Keywords: prime, semiprime, nth semiprime, next semiprime 1. Introduction Securing data remains a concern for every individual and every organiza- tion on the globe. In telecommunication, cryptography is one of the studies that permits the secure transfer of information [1] over the Internet. Prime numbers have special properties that make them of fundamental importance in cryptography. The core of the Internet security is based on protocols, such arXiv:1608.05405v1 [math.NT] 17 Aug 2016 as SSL and TSL [2] released in 1994 and persist as the basis for securing dif- ferent aspects of today’s Internet [3]. The Rivest-Shamir-Adleman encryption method [4], released in 1978, uses asymmetric keys for exchanging data. A secret key Sk and a public key Pk are generated by the recipient with the following property: A message enciphered Email addresses: [email protected] (Issam Kaddoura), [email protected] (Samih Abdul-Nabi) 1 by Pk can only be deciphered by Sk and vice versa.
    [Show full text]
  • The Pseudoprimes to 25 • 109
    MATHEMATICS OF COMPUTATION, VOLUME 35, NUMBER 151 JULY 1980, PAGES 1003-1026 The Pseudoprimes to 25 • 109 By Carl Pomerance, J. L. Selfridge and Samuel S. Wagstaff, Jr. Abstract. The odd composite n < 25 • 10 such that 2n_1 = 1 (mod n) have been determined and their distribution tabulated. We investigate the properties of three special types of pseudoprimes: Euler pseudoprimes, strong pseudoprimes, and Car- michael numbers. The theoretical upper bound and the heuristic lower bound due to Erdös for the counting function of the Carmichael numbers are both sharpened. Several new quick tests for primality are proposed, including some which combine pseudoprimes with Lucas sequences. 1. Introduction. According to Fermat's "Little Theorem", if p is prime and (a, p) = 1, then ap~1 = 1 (mod p). This theorem provides a "test" for primality which is very often correct: Given a large odd integer p, choose some a satisfying 1 <a <p - 1 and compute ap~1 (mod p). If ap~1 pi (mod p), then p is certainly composite. If ap~l = 1 (mod p), then p is probably prime. Odd composite numbers n for which (1) a"_1 = l (mod«) are called pseudoprimes to base a (psp(a)). (For simplicity, a can be any positive in- teger in this definition. We could let a be negative with little additional work. In the last 15 years, some authors have used pseudoprime (base a) to mean any number n > 1 satisfying (1), whether composite or prime.) It is well known that for each base a, there are infinitely many pseudoprimes to base a.
    [Show full text]
  • Primes and Primality Testing
    Primes and Primality Testing A Technological/Historical Perspective Jennifer Ellis Department of Mathematics and Computer Science What is a prime number? A number p greater than one is prime if and only if the only divisors of p are 1 and p. Examples: 2, 3, 5, and 7 A few larger examples: 71887 524287 65537 2127 1 Primality Testing: Origins Eratosthenes: Developed “sieve” method 276-194 B.C. Nicknamed Beta – “second place” in many different academic disciplines Also made contributions to www-history.mcs.st- geometry, approximation of andrews.ac.uk/PictDisplay/Eratosthenes.html the Earth’s circumference Sieve of Eratosthenes 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 Sieve of Eratosthenes We only need to “sieve” the multiples of numbers less than 10. Why? (10)(10)=100 (p)(q)<=100 Consider pq where p>10. Then for pq <=100, q must be less than 10. By sieving all the multiples of numbers less than 10 (here, multiples of q), we have removed all composite numbers less than 100.
    [Show full text]
  • Appendix a Tables of Fermat Numbers and Their Prime Factors
    Appendix A Tables of Fermat Numbers and Their Prime Factors The problem of distinguishing prime numbers from composite numbers and of resolving the latter into their prime factors is known to be one of the most important and useful in arithmetic. Carl Friedrich Gauss Disquisitiones arithmeticae, Sec. 329 Fermat Numbers Fo =3, FI =5, F2 =17, F3 =257, F4 =65537, F5 =4294967297, F6 =18446744073709551617, F7 =340282366920938463463374607431768211457, Fs =115792089237316195423570985008687907853 269984665640564039457584007913129639937, Fg =134078079299425970995740249982058461274 793658205923933777235614437217640300735 469768018742981669034276900318581864860 50853753882811946569946433649006084097, FlO =179769313486231590772930519078902473361 797697894230657273430081157732675805500 963132708477322407536021120113879871393 357658789768814416622492847430639474124 377767893424865485276302219601246094119 453082952085005768838150682342462881473 913110540827237163350510684586298239947 245938479716304835356329624224137217. The only known Fermat primes are Fo, ... , F4 • 208 17 lectures on Fermat numbers Completely Factored Composite Fermat Numbers m prime factor year discoverer 5 641 1732 Euler 5 6700417 1732 Euler 6 274177 1855 Clausen 6 67280421310721* 1855 Clausen 7 59649589127497217 1970 Morrison, Brillhart 7 5704689200685129054721 1970 Morrison, Brillhart 8 1238926361552897 1980 Brent, Pollard 8 p**62 1980 Brent, Pollard 9 2424833 1903 Western 9 P49 1990 Lenstra, Lenstra, Jr., Manasse, Pollard 9 p***99 1990 Lenstra, Lenstra, Jr., Manasse, Pollard
    [Show full text]
  • The Distribution of Pseudoprimes
    The Distribution of Pseudoprimes Matt Green September, 2002 The RSA crypto-system relies on the availability of very large prime num- bers. Tests for finding these large primes can be categorized as deterministic and probabilistic. Deterministic tests, such as the Sieve of Erastothenes, of- fer a 100 percent assurance that the number tested and passed as prime is actually prime. Despite their refusal to err, deterministic tests are generally not used to find large primes because they are very slow (with the exception of a recently discovered polynomial time algorithm). Probabilistic tests offer a much quicker way to find large primes with only a negligibal amount of error. I have studied a simple, and comparatively to other probabilistic tests, error prone test based on Fermat’s little theorem. Fermat’s little theorem states that if b is a natural number and n a prime then bn−1 ≡ 1 (mod n). To test a number n for primality we pick any natural number less than n and greater than 1 and first see if it is relatively prime to n. If it is, then we use this number as a base b and see if Fermat’s little theorem holds for n and b. If the theorem doesn’t hold, then we know that n is not prime. If the theorem does hold then we can accept n as prime right now, leaving a large chance that we have made an error, or we can test again with a different base. Chances improve that n is prime with every base that passes but for really big numbers it is cumbersome to test all possible bases.
    [Show full text]
  • PELL FACTORIANGULAR NUMBERS Florian Luca, Japhet Odjoumani
    PUBLICATIONS DE L’INSTITUT MATHÉMATIQUE Nouvelle série, tome 105(119) (2019), 93–100 DOI: https://doi.org/10.2298/PIM1919093L PELL FACTORIANGULAR NUMBERS Florian Luca, Japhet Odjoumani, and Alain Togbé Abstract. We show that the only Pell numbers which are factoriangular are 2, 5 and 12. 1. Introduction Recall that the Pell numbers Pm m> are given by { } 1 αm βm P = − , for all m > 1, m α β − where α =1+ √2 and β =1 √2. The first few Pell numbers are − 1, 2, 5, 12, 29, 70, 169, 408, 985, 2378, 5741, 13860, 33461, 80782, 195025,... Castillo [3], dubbed a number of the form Ftn = n!+ n(n + 1)/2 for n > 1 a factoriangular number. The first few factoriangular numbers are 2, 5, 12, 34, 135, 741, 5068, 40356, 362925,... Luca and Gómez-Ruiz [8], proved that the only Fibonacci factoriangular numbers are 2, 5 and 34. This settled a conjecture of Castillo from [3]. In this paper, we prove the following related result. Theorem 1.1. The only Pell numbers which are factoriangular are 2, 5 and 12. Our method is similar to the one from [8]. Assuming Pm = Ftn for positive integers m and n, we use a linear forms in p-adic logarithms to find some bounds on m and n. The resulting bounds are large so we run a calculation to reduce the bounds. This computation is highly nontrivial and relates on reducing the diophantine equation Pm = Ftn modulo the primes from a carefully selected finite set of suitable primes. 2010 Mathematics Subject Classification: Primary 11D59, 11D09, 11D7; Secondary 11A55.
    [Show full text]
  • Elementary Proof That an Infinite Number of Cullen Primes Exist
    Elementary Proof that an Infinite Number of Cullen Primes Exist Stephen Marshall 21 February 2017 Abstract This paper presents a complete proof of the Cullen Primes are infinite, even though only 16 of them have been found as of 21 Feb 2017. We use a proof found in Reference 1, that if p > 1 and d > 0 are integers, that p and p+ d are both primes if and only if for integer m: m = (p-1)!( + ) + + We use this proof for d = to prove the infinitude of Cullen prime numbers. The author would like to give many thanks to the authors of 1001 Problems in Classical Number Theory, Jean-Marie De Koninck and Armel Mercier, 2004, Exercise Number 161 (see Reference 1). The proof provided in Exercise 6 is the key to making this paper on the Cullen Prime Conjecture possible. Introduction James Cullen, (19 April 1867 – 7 December 1933) was born at Drogheda, County Louth, Ireland. At first he was educated privately, then he studied pure and applied mathematics at the Trinity College, Dublin for a while, he went to 1 Mungret College, Limerick, before deciding to become a Jesuit, studying in England in Mansera House, and St. Mary's, and was ordained as a priest on 31 July 1901. In 1905, he taught mathematics at Mount St. Mary's College in Derbyshire and published his finding of what is now known as Cullen numbers in number theory. In number theory of prime numbers, a Cullen number is a natural number of the form n Cn = n2 + 1 Cullen numbers were first studied by James Cullen in 1905.
    [Show full text]
  • On Types of Elliptic Pseudoprimes
    journal of Groups, Complexity, Cryptology Volume 13, Issue 1, 2021, pp. 1:1–1:33 Submitted Jan. 07, 2019 https://gcc.episciences.org/ Published Feb. 09, 2021 ON TYPES OF ELLIPTIC PSEUDOPRIMES LILJANA BABINKOSTOVA, A. HERNANDEZ-ESPIET,´ AND H. Y. KIM Boise State University e-mail address: [email protected] Rutgers University e-mail address: [email protected] University of Wisconsin-Madison e-mail address: [email protected] Abstract. We generalize Silverman's [31] notions of elliptic pseudoprimes and elliptic Carmichael numbers to analogues of Euler-Jacobi and strong pseudoprimes. We inspect the relationships among Euler elliptic Carmichael numbers, strong elliptic Carmichael numbers, products of anomalous primes and elliptic Korselt numbers of Type I, the former two of which we introduce and the latter two of which were introduced by Mazur [21] and Silverman [31] respectively. In particular, we expand upon the work of Babinkostova et al. [3] on the density of certain elliptic Korselt numbers of Type I which are products of anomalous primes, proving a conjecture stated in [3]. 1. Introduction The problem of efficiently distinguishing the prime numbers from the composite numbers has been a fundamental problem for a long time. One of the first primality tests in modern number theory came from Fermat Little Theorem: if p is a prime number and a is an integer not divisible by p, then ap−1 ≡ 1 (mod p). The original notion of a pseudoprime (sometimes called a Fermat pseudoprime) involves counterexamples to the converse of this theorem. A pseudoprime to the base a is a composite number N such aN−1 ≡ 1 mod N.
    [Show full text]
  • The Simple Mersenne Conjecture
    The Simple Mersenne Conjecture Pingyuan Zhou E-mail：[email protected] Abstract p In this paper we conjecture that there is no Mersenne number Mp = 2 –1 to be prime k for p = 2 ±1,±3 when k > 7, where p is positive integer and k is natural number. It is called the simple Mersenne conjecture and holds till p ≤ 30402457 from status of this conjecture. If the conjecture is true then there are no more double Mersenne primes besides known double Mersenne primes MM2, MM3, MM5, MM7. Keywords: Mersenne prime; double Mersenne prime; new Mersenne conjecture; strong law of small numbers; simple Mersenne conjecture. 2010 Mathematics Subject Classification: 11A41, 11A51 1 p How did Mersenne form his list p = 2,3,5,7,13,17,19,31,67,127,257 to make 2 –1 become primes ( original Mersenne conjecture ) and why did the list have five errors ( 67 and 257 were wrong but 61,89,107 did not appear here )? Some of mathematicians have studied this problem carefully[1]. From verification results of new Mersenne conjecture we see three conditions in the conjecture all hold only for p = 3,5,7,13,17,19,31,61,127 though new Mersenne conjecture has been verified to be true for all primes p < 20000000[2,3]. If we only consider Mersenne primes and p is p k positive integer then we will discovery there is at least one prime 2 –1 for p = 2 ±1,±3 when k ≤ 7 ( k is natural number 0,1,2,3,…), however, such connections will disappear completely from known Mersenne primes when k > 7.
    [Show full text]
  • The Prime-Power Map
    1 2 Journal of Integer Sequences, Vol. 24 (2021), 3 Article 21.2.2 47 6 23 11 The Prime-Power Map Steven Business Mathematics Department School of Applied STEM Universitas Prasetiya Mulya South Tangerang 15339 Indonesia [email protected] Jonathan Hoseana Department of Mathematics Parahyangan Catholic University Bandung 40141 Indonesia [email protected] Abstract We introduce a modification of Pillai’s prime map: the prime-power map. This map fixes 1, divides its argument by p if it is a prime power pk, and otherwise subtracts from its argument the largest prime power not exceeding it. We study the iteration of this map over the positive integers, developing, firstly, results parallel to those known for the prime map. Subsequently, we compare its dynamical properties to those of a more manageable variant of the map under which any orbit admits an explicit description. Finally, we present some experimental observations, based on which we conjecture that almost every orbit of the prime-power map contains no prime power. 1 Introduction Let P be the set of primes (A000040 in the On-Line Encyclopedia of Integer Sequences [10]). In 1930, Pillai [9] introduced the prime map x 7→ x − r(x), where r(x) is the largest element 1 of P ∪ {0, 1} not exceeding x, under whose iteration every positive-integer initial condition is eventually fixed at 0, the only fixed point of the map. Interesting results on the asymptotic behavior of the time steps R(x) it takes for an initial condition x to reach the fixed point were established, before subsequently improved by Luca and Thangadurai [7] in 2009.
    [Show full text]
  • Arxiv:1606.08690V5 [Math.NT] 27 Apr 2021 on Prime Factors of Mersenne
    On prime factors of Mersenne numbers Ady Cambraia Jr,∗ Michael P. Knapp,† Ab´ılio Lemos∗, B. K. Moriya∗ and Paulo H. A. Rodrigues‡ [email protected] [email protected] [email protected] [email protected] paulo [email protected] April 29, 2021 Abstract n Let (Mn)n≥0 be the Mersenne sequence defined by Mn = 2 − 1. Let ω(n) be the number of distinct prime divisors of n. In this short note, we present a description of the Mersenne numbers satisfying ω(Mn) ≤ 3. Moreover, we prove that the inequality, (1−ǫ) log log n given ǫ> 0, ω(Mn) > 2 − 3 holds for almost all positive integers n. Besides, a we present the integer solutions (m, n, a) of the equation Mm+Mn = 2p with m,n ≥ 2, p an odd prime number and a a positive integer. 2010 Mathematics Subject Classification: 11A99, 11K65, 11A41. Keywords: Mersenne numbers, arithmetic functions, prime divisors. 1 Introduction arXiv:1606.08690v5 [math.NT] 27 Apr 2021 n Let (Mn)n≥0 be the Mersenne sequence defined by Mn = 2 − 1, for n ≥ 0. A simple argument shows that if Mn is a prime number, then n is a prime number. When Mn is a prime number, it is called a Mersenne prime. Throughout history, many researchers sought to find Mersenne primes. Some tools are very important for the search for Mersenne primes, mainly the Lucas-Lehmer test. There are papers (see for example [1, 5, 21]) that seek to describe the prime factors of Mn, where Mn is a composite number and n is a prime number.
    [Show full text]
  • Prime and Perfect Numbers
    Chapter 34 Prime and perfect numbers 34.1 Infinitude of prime numbers 34.1.1 Euclid’s proof If there were only finitely many primes: 2, 3, 5, 7, ...,P, and no more, consider the number Q = (2 3 5 P ) + 1. · · ··· Clearly it is divisible by any of the primes 2, 3,..., P , it must be itself a prime, or be divisible by some prime not in the list. This contradicts the assumption that all primes are among 2, 3, 5,..., P . 34.1.2 Fermat numbers 2n The Fermat numbers are Fn := 2 + 1. Note that 2n 2n−1 2n−1 Fn 2 = 2 1= 2 + 1 2 1 = Fn 1(Fn 1 2). − − − − − − By induction, Fn = Fn 1Fn 2 F1 F0 + 2, n 1. − − ··· · ≥ From this, we see that Fn does not contain any factor of F0, F1, ..., Fn 1. Hence, the Fermat numbers are pairwise relatively prime. From this,− it follows that there are infinitely primes. 1 1 It is well known that Fermat’s conjecture of the primality of Fn is wrong. While F0 = 3, F1 = 5, 32 F2 = 17, F3 = 257, and F4 = 65537 are primes, Euler found that F5 = 2 + 1 = 4294967297 = 641 6700417. × 1202 Prime and perfect numbers 34.2 The prime numbers below 20000 The first 2262 prime numbers: 10 20 30 40 50 60 70 80 90 100 bbbbbb bb bbb b bb bb b bb b bb bb bb b b b b bb b b b b b b b b b b b b b b b bb b b b b b b b b b b b b b b b b bb b b b b bb b b b b b bb b b b b b b b b b b b b b b b b b b bb b b b b b b b b bb b b b bb b b b b b b b b b b b b bb b b b b b b b b b bb b b b b b b b b b b b b b b b b b b bb b b bb b b b b bb b b b b b b b b b b b b b 100 b b bb b bb b bb b b b b bb b b b b b bb b b b b b b b bb b bb b b b b b bb b b b
    [Show full text]