PELL NUMBERS WHOSE EULER FUNCTION IS A PELL NUMBER. Bernadette Faye and Florian Luca
|
|
- Elvin Dorsey
- 6 years ago
- Views:
Transcription
1 PUBLICATIONS DE L INSTITUT MATHÉMATIQUE Nouvelle série tome PELL NUMBERS WHOSE EULER FUNCTION IS A PELL NUMBER Bernadette Faye and Florian Luca Abstract We show that the only Pell numbers whose Euler function is also a Pell number are and 2 Introduction Let φn be the Euler function of the positive integer n Recall that if n has the prime factorization n = p a pa k k with distinct primes p p k and positive integers a a k then φn = p a p p a k k p k There are many papers in the literature dealing with diophantine equations involving the Euler function in members of a binary recurrent sequence For example in [] it is shown that 2 and 3 are the only Fibonacci numbers whose Euler function is also a Fibonacci number while in [4] it is shown that the Diophantine equation φ5 n = 5 m has no positive integer solutions m n Furthermore the divisibility relation φn n when n is a Fibonacci number or a Lucas number or a Cullen number that is a number of the form n2 n + for some positive integer n or a rep-digit g m /g in some integer base g [2 000] have been investigated in [ ] respectively Here we look for a similar equation with members of the Pell sequence The Pell sequence n 0 is given by P 0 = 0 P = and + = 2 + for all n 0 Its first terms are We have the following result 200 Mathematics Subject Classification: B39 Key words and phrases: Pell numbers; Euler function B Faye was supported by a grant from OWSD and SIDA F Luca was supported by an NRF A-rated researcher grant Communicated by Žarko Mijajlović 23
2 232 FAYE AND LUCA Theorem The only solutions in positive integers n m of the equation φ = P m are n m = 2 For the proof we begin by following the method from [] but we add to it some ingredients from [0] 2 Preliminary results Let α β = be the roots of the characteristic equation x 2 2x = 0 of the Pell sequence { } n 0 The Binet formula for is = αn β n α β This implies easily that the inequalities for all n 0 2 α n 2 α n hold for all positive integers n We let {Q n } n 0 be the companion Lucas sequence of the Pell sequence given by Q 0 = 2 Q = 2 and Q n+2 = 2Q n+ + Q n for all n 0 Its first few terms are The Binet formula for Q n is 22 Q n = α n + β n for all n 0 We use the well-known result Lemma 2 The relations i P 2n = Q n and ii Q 2 n 8P 2 n = 4 n hold for all n 0 For a prime p and a nonzero integer m let ν p m be the exponent with which p appears in the prime factorization of m The following result is well known and easy to prove Lemma 22 The relations i ν 2 Q n = and ii ν 2 = ν 2 n hold for all positive integers n The following divisibility relations among the Pell numbers are well known Lemma 23 Let m and n be positive integers We have: i If m n then P m ii gcdp m = P gcdmn For each positive integer n let zn be the smallest positive integer k such that n P k It is known that this exists and n P m if and only if zn m This number is referred to as the order of appearance of n in the Pell sequence Clearly z2 = 2 Further putting for an odd prime p e p = 2 p where the above notation stands for the Legendre symbol of 2 with respect to p we have that zp p e p A prime factor p of such that zp = n is called primitive for It is known that has a primitive divisor for all n 2 see [2] or [] Write P zp = p ep m p where
3 PELL NUMBERS WHOSE EULER FUNCTION IS A PELL NUMBER 233 m p is coprime to p It is known that if p k for some k > e p then pzp n In particular 23 ν p e p whenever p n We need a bound on e p We have the following result Lemma 24 The inequality 24 e p holds for all primes p p + log α 2 log p Proof Since e 2 = the inequality holds for the prime 2 Assume that p is odd Then zp p + ε for some ε {±} Furthermore by Lemmas 2 and 23 we have p ep P zp P p+ε = P p+ε/2 Q p+ε/2 By Lemma 2 it follows easily that p cannot divide both and Q n for n = p + ε/2 since otherwise p will also divide Q 2 n 8P 2 n = ±4 a contradiction since p is odd Hence p ep divides one of P p+ε/2 or Q p+ε/2 If p ep divides P p+ε/2 we have by 2 that p ep P p+ε/2 P p+/2 < α p+/2 which leads to the desired inequality 24 upon taking logarithms of both sides In case p ep divides Q p+ε/2 we use the fact that Q p+ε/2 is even by Lemma 22 i Hence p ep divides Q p+ε/2 /2 therefore by formula 22 we have p ep Q p+ε/2 2 Q p+/2 2 < αp+/2 + 2 < α p+/2 which leads again to the desired conclusion by taking logarithms of both sides For a positive real number x we use log x for the natural logarithm of x We need some inequalities from the prime number theory For a positive integer n we write ωn for the number of distinct prime factors of n The following inequalities i ii and iii are inequalities and 34 in [5] while iv is Théoréme 3 from [6] Lemma 25 Let p < p 2 < be the sequence of all prime numbers We have: i The inequality p n < nlog n + log log n holds for all n 6 ii The inequality + < 79 log x + p 2log x 2 p x holds for all x 286 iii The inequality n φn > 79 log log n + 25/ log log n holds for all n 3
4 234 FAYE AND LUCA iv The inequality holds for all n 26 ωn < log n log log n 74 For a positive integer n we put = {p : zp = n} We need the following result Lemma 26 Put S n := p p { 2 log n 25 S n < min n For n > 2 we have } log log n φn Proof Since n > 2 it follows that every prime factor p is odd and satisfies the congruence p ± mod n Further putting l n := # we have n ln p p < α n by inequality 2 giving 26 l n Thus the inequality n log α logn 27 l n < n log α log n holds for all n 3 since it follows from 26 for n 4 via the fact that the function x x/ log x is increasing for x 3 while for n = 3 it can be checked directly To prove the first bound we use 27 to deduce that 28 S n nl nl n l l n 2 ln dt n t + + n 2 + n 2 n 2 log αe 2+2/n 2 n n log log n l l n l + m n m 2 m log l n + + n n 2 Since the inequality log n > log αe 2+2/n 2 holds for all n implies that S n < 2 n log n for n 800 The remaining range for n can be checked on an individual basis For the second bound on S n we follow the argument from [0] and split the primes in in three groups: We have 29 T = p p<3n i p < 3n; ii p 3n n 2 ; iii p > n 2 ; p { n 2 + n + 2n 2 + 2n + 3n 2 < 0 3n 2n 2 + 2n < 7 3n n even n odd
5 PELL NUMBERS WHOSE EULER FUNCTION IS A PELL NUMBER 235 where the last inequalities above hold for all n 84 For the remaining primes in we have 20 p < p + m = T 2 + T 3 + m 3n p p>3n p p>3n m 3n+ where T 2 and T 3 denote the sums of the reciprocals of the primes in satisfying ii and iii respectively The sum T 2 was estimated in [0] using the large sieve inequality of Montgomery and Vaughan [3] see also page 397 in [] and the bound on it is 2 T 2 = p < 4 4 log log n + < φn log n φn φn 3n<p<n 2 4 log log n + φn where the last inequality holds for n 55 Finally for T 3 we use estimate 27 on l n to deduce that 22 T 3 < l n n 2 < log α n log n < 09 3n where the last bound holds for all n 9 To summarize for n 84 we have by and 22 S n < 0 3n + 3n n + 4 log log n + = 4 φn φn n + 4 log log n log log n + φn φn φn for n even which is stronger that the desired inequality Here we used that φn n/2 for even n For odd n we use the same argument except that the first fraction 0/3n on the right-hand side above gets replaced by 7/3n by 29 and we only have φn n for odd n This was for n 84 For n [3 83] the desired inequality can be checked on an individual basis The next lemma from [9] gives an upper bound on the sum appearing in the right-hand side of 25 Lemma 27 We have d n log d d < p n log p n p φn Throughout the rest of this paper we use p q r with or without subscripts to denote prime numbers 3 Proof of the Theorem 3 A bird e eye view of the proof of the Theorem In this section we explain the plan of attack for the proof of the Theorem We assume n > 2 We put k for the number of distinct prime factors of and l = n m We first show that 2 k m and that any putative solution must be large This only uses the fact that p φ = P m for all prime factors p of and all such primes with at most one exception are odd We show that k 46 and n > m 2 46 This is Lemma 3 We next bound l in terms of n by showing that l < log log log n/ log α +
6 236 FAYE AND LUCA Lemma 32 Next we show that k is large by proving that 3 k > n/6 Lemma 33 When n is odd then every prime factor of is congruent to modulo 4 This implies that 4 k m Thus 3 k > n/6 and n > m 4 k a contradiction in our range for n This is done in Subsection 35 When n is even we write n = 2 s n with an odd integer n and bound s and the smallest prime factor r of n We first show that s 3 that if n and m have a common divisor larger than then r {3 5 7} Lemma 34 A lot of effort is spend into finding a small bound on r As we saw r 7 if n and m are not coprime When n and m are coprime we succeed in proving that r < 0 6 Putting e r for the exponent of r in the factorization of P zr it turns out that our argument works well when e r = and we get a contradiction but when e r = 2 then we need some additional information about the prime factors of Q r It is always the case that e r = for all primes r < 0 6 except for r {3 3} for which e r = 2 but lucky for us both Q 3 and Q 3 have two suitable prime factors each which allows us to obtain a contradiction Our efforts in obtaining r < 0 6 involve quite a complicated argument roughly the entire argument after Lemma 34 until the end which we believe it is justified by the existence of the mighty prime r = for which e r = 2 Should we have only obtained say r < we would have had to say something nontrivial about the prime factors of Q a nuisance which we succeeded in avoiding simply by proving that r cannot get that large! 32 Some lower bounds on m and ω We start with a computation showing that there are no other solutions than n = 2 when n 00 So from now on n > 00 We write = q α qα k k where q < < q k are primes and α α k are positive integers Clearly m < n McDaniel [2] proved that has a prime factor q mod 4 for all n > 4 Thus McDaniel s result applies for us showing that 4 q φ P m so 4 m by Lemma 22 Further it follows from a the result of the second author [5] that φ P φn Hence m φn Thus n 3 m φn 79 log log n + 25/ log log n by Lemma 25 iii The function x x 79 log log x + 25/ log log x is increasing for x 00 Since n 00 inequality 3 together with the fact that 4 m show that m 24 Put l = n m Since m is even we have β m > 0 therefore 32 = αn β n P m α m β m > αn β n α m α l α m+n > αl 0 40 where we used the fact that αm+n α 24 < 0 40 We now are ready to provide a large lower bound on n We distinguish the following cases
7 PELL NUMBERS WHOSE EULER FUNCTION IS A PELL NUMBER 237 Case : n is odd Here we have l So /P m > α 0 40 > 2442 Since n is odd it follows that is divisible only by primes q such that zq is odd Among the first 0000 primes there are precisely 2907 of them with this property They are F = { } Since p F < 963 < 2442 < = p P m k i= q i we get that k > 2907 Since 2 k φ P m we get by Lemma 22 that 33 n > m > Case 2: n 2 mod 4 Since both m and n are even we get l 2 Thus P m > α > If q is a prime factor of as in Case we have that zq is not divisible by 4 Among the first 0000 primes there are precisely 585 of them with this property They are F 2 = { } Writing p j as the j th prime number in F 2 we check with Mathematica that = = p i p i i= which via inequality 34 shows that k 46 Of the k prime factors of we have that only k of them are odd q = 2 because n is even but one of those is congruent to modulo 4 by McDaniel s result Hence 2 k φ P m which shows via Lemma 22 that i= 35 n > m 2 46 Case 3: 4 n In this case since both m and n are multiples of 4 we get that l 4 Therefore /P m > α > 3397 Letting p < p 2 < be the sequence of all primes we have that 2000 i= p i < 74 < 3397 < P m = showing that k > 2000 Since 2 k φ = P m we get 36 n > m k i= q i To summarize from and 36 we get the following results Lemma 3 If n > 2 then i 2 k m; ii k 46; iii n > m 2 46
8 238 FAYE AND LUCA 33 Bounding l in term of n We saw in the preceding section that k 46 Since n > m 2 k we have 37 k < kn := log n log 2 Let p j be the j th prime number Lemma 25 shows that p k p kn knlog kn + log log kn := qn We then have using Lemma 25 ii that P m = k q i i= 2 p qn > p 79 log qn + /2log qn 2 Inequality ii of Lemma 25 requires that x 286 which holds for us with x = qn because kn 46 Hence we get 79 log qn + 2log qn 2 > > α l 0 40 > α l P m 0 40 Since k 46 we have qn > 3256 Hence we get log qn log > α l which yields after taking logarithms to 38 l The inequality log log qn log α qn < log n 45 holds in our range for n in fact it holds for all n > 0 83 which is our case since for us n > 2 46 > 0 25 Inserting inequality 39 into 38 we get l < log loglog n45 log α Thus we proved the following result Lemma 32 If n > 2 then l < < log log log n log α log log log n log α Bounding the primes q i for i = k Write = q q k B where B = q α q α k k Clearly B φ therefore B P m Since also B we have by Lemma 23 that B gcd P m = P gcdnm P l where the last relation follows again by Lemma 23 because gcdn m l Using inequality 2 and Lemma 32 we get 30 B m α n m α 0 log log n
9 PELL NUMBERS WHOSE EULER FUNCTION IS A PELL NUMBER 239 To bound the primes q i for all i = k we use the inductive argument from Section 33 in [] We write Therefore k q i i= Using the inequality k q i i= = φ = P m = P m = P m > x x s x + + x s valid for all x i [0 ] for i = s we get < k q i i= k i= q i < k q therefore q < k / < 3k Using the method of the proof of inequality 3 in [] one proves by induction on the index i { k} that if we put u i := i j= q j then u i < 2α 2 k log log n 3i /2 In particular q q k = u k < 2α 2 k log log n 3k /2 which together with formula 38 and 30 gives = q q k B < 2α 2 k log log n +3k /2 = 2α 2 k log log n 3k +/2 Since > α n 2 by inequality 2 we get n 2 log α < 3k + 2 Since k < log n/ log 2 see 37 we get 3 k > n 2 2 log α log2α 2 log nlog log nlog 2 log2α 2 k log log n where the last two inequalities above hold because n > 2 46 So we proved the following result Lemma 33 If n > 2 then 3 k > n/6 > 07n 2 > n 6 35 The case when n is odd Assume that n > 2 is odd and let q be any prime factor of Reducing relation Q 2 n 8P 2 n = 4 n of Lemma 2 ii modulo q we get Q 2 n 4 mod q Since q is odd because n is odd we get that q mod 4 This is true for all prime factors q of Hence 4 k k q i φ P m i=
10 240 FAYE AND LUCA which by Lemma 22 ii gives 4 k m Thus n > m 4 k inequality which together with Lemma 33 gives n > 3 k log 4/ log 3 > n 6 log 4/ log 3 so in contradiction with Lemma 3 n < 6 log 4/ log4/3 < Bounding n From now on n > 2 is even We write it as n = 2 s r λ rλt t =: 2 s n where s t 0 and 3 r < < r t are odd primes Thus by inequality 32 we have α l 0 40 < α l 0 40 < φ = + = 2 + p p p d 3 p P d d n and taking logarithms we get 3 l log α 0 39 < log α l 0 40 < log 2 + d 3 d n p P d log + p < log 2 + d 3 d n In the above we used the inequality log x > 0x valid for all x 0 /2 with x = /0 40 and the inequality log + x x valid for all real numbers x with x = p for all p P d and all divisors d n with d 3 Let us deduce that the case t = 0 is impossible Indeed if this were so then n is a power of 2 and so by Lemma 3 both m and n are divisible by 2 46 Thus l 2 46 Inserting this into 3 and using Lemma 26 we get 2 46 log α 0 39 < 2 log2 a 2 a = 4 log 2 a a contradiction Thus t so n > We now put I := {i : r i m} and J = { t} I We put M = i I r i We also let j be minimal in J We split the sum appearing in 3 in two parts: S d = L + L 2 where L := d n r d r 2M d n S d and L 2 := d n r u d for some u J To bound L we note that all divisors involved divide n where n = 2 s i I r λi i S d S d
11 PELL NUMBERS WHOSE EULER FUNCTION IS A PELL NUMBER 24 Using Lemmas 26 and 27 we get 32 L 2 log d < 2 d d n r n log r n = 2 r φn r 2M log r 2M r φ2m We now bound L 2 If J = then L 2 = 0 and there is nothing to bound So assume that J We argue as follows Note that since s by Lemma 2 i we have = Q n Q 2n Q 2 s n Let q be any odd prime factor of Q n By reducing relation ii of Lemma 2 modulo q and using the fact that n and q are both odd we get 2Pn 2 mod q therefore 2 q = Hence zq q for such primes q Now let d be any divisor of n which is a multiple of r j The number of them is τn /r j where τu is the number of divisors of the positive integer u For each such d there is a primitive prime factor q d of Q d Q n Thus r j d q d This shows that 33 ν rj φ ν rj φq n τn /r j τn /2 where the last inequality follows from the fact that τn /r j τn = λ j λ j + 2 Since r j does not divide m it follows from 23 that 34 ν rj P m e rj Hence and imply that Invoking Lemma 24 we get τn 2e rj 35 τn r j + log α log r j Now every divisor d participating in L 2 is of the form d = 2 a d where 0 a s and d is a divisor of n divisible by r u for some u J Thus { } L 2 τn min S 2a d := gn s r 0 a s d n r u d for some u J In particular d 3 and since the function x log x/x is decreasing for x 3 we have that 36 gn s r 2τn log2 a r j 2 a r j 0 a s Putting also s := min{s 46} we get by Lemma 3 that 2 s l Thus inserting this as well as 32 and 36 all into 3 we get 37 l log α 0 39 < 2 log r 2M + gn s r r φ2m r 2M
12 242 FAYE AND LUCA Since 38 0 a s log2 a r j 2 a r j < 4 log log r j r j inequalities and 36 give us that gn s r log 2 log α := gr j r j log r j The function gx is decreasing for x 3 Thus gr j g3 < 064 For a positive integer N put fn := N log α log r N r φn r N Then inequality 37 implies that both inequalities 39 fl < gr j l M log α + fm < gr j hold Assuming that l 26 we get by Lemma 25 that l log α log log l + 25/ log log l log l 2log log log l 74 Mathematica confirmed that the above inequality implies l 500 Another calculation with Mathematica showed that the inequality fl < 064 for even values of l [ 500] Z implies that l [2 8] The minimum of the function f2n for N [ 250] Z is at N = 3 and f6 > 22 For the remaining positive integers N we have f2n > 0 Hence inequality 39 implies 2 s 2 log α < 064 and 2 s 23 log α < = 276 according to whether M 3 or M = 3 and either one of the above inequalities implies that s 3 Thus s = s { 2 3} Since 2M l 2M is square-free and l 8 we have that M { 3 5 7} Assume M > and let i be such that M = r i Let us show that λ i = Indeed if λ i 2 then 99 Q P Q 49 according to whether r i = respectively and Thus we get that divide φ = P m showing that divide l Since l 8 only the case l = 8 is possible In this case r j 5 and inequality 39 gives 84 < f8 g5 < 79 a contradiction Let us record what we have deduced so far Lemma 34 If n > 2 is even then s { 2 3} Further if I then I = {i} r i {3 5 7} and λ i = We now deal with J For this we return to 3 and use the better inequality namely 2 s M log α l log α log Pn + + L 2 φ p log d 2 s M p P d
13 PELL NUMBERS WHOSE EULER FUNCTION IS A PELL NUMBER 243 so L 2 2 s M log α 0 39 log d 2 s M p P d + p In the right-hand side above M { 3 5 7} and s { 2 3} The values of the right-hand side above are in fact hu := u log α 0 39 logp u/φp u for u = 2 s M { } Computing we get: where hu H sm M φm for M { 3 5 7} s { 2 3} H > 069 H M > 28 for M > H 2M > 2426 H 3M > 5897 We now exploit the relation M 320 H sm φm d n r u d for sume u J < L 2 Our goal is to prove that r j < 0 6 Assume this is not so We use the bound log log d L 2 < φd of Lemma 26 Each divisor d participating in L 2 is of the form 2 a d where a [0 s] Z and d is a multiple of a prime at least as large as r j Thus and log log d φd Using 35 we get log log 8d φ2 a φd for a {0 s} d φd n φn M + ωn φm r j 2 ωn τn r j + log α log r j < r j where the last inequality holds because r j is large Thus 32 ωn < log r j log 2 < 2 log r j Hence 322 n φn M + ωn M < φm r j φm < M 2 log φm exp rj < M r j φm + r j + 4 log r j r j 2 log rj
14 244 FAYE AND LUCA where we used the inequalities + x < e x valid for all real numbers x as well as e x < + 2x which is valid for x 0 /2 with x = 2 log r j /r j which belongs to 0 /2 because r j is large Thus the inequality log log d φd log log 8d + 4 log r j d r j M φ2 a φm holds for d = 2 a d participating in L 2 The function x log log8x/x is decreasing for x 3 Hence log log8rj 323 L 2 τn + 4 log r j M r j r j φ2 a φm 0 a s Inserting inequality 35 into 323 and using 320 we get 324 log r j < log r j + log log8r j log α r j r j where G s = 0 a s φ2 a Gs H sm For s = 2 3 inequality 324 implies r j < and r j < 300 respectively For s = and M > inequality 324 implies r j < 5000 When M = and s = we get n = 2n and j = Here inequality 324 implies that r < This is too big so we use the bound S d < 2 log d d of Lemma 26 instead for the divisors d of participating in L 2 which in this case are all the divisors of n larger than 2 We deduce that 06 < L 2 < 2 < 4 d 2n d>2 log d d log d d d n The last inequality above follows from the fact that all divisors d > 2 of n are either of the form d or 2d for some divisor d 3 of n and the function x log x/x is decreasing for x 3 Using Lemma 27 and inequalities 32 and 322 we get log r n 4 log r 06 < 4 < ωn + 4 log r r φn r r < r n 4 log r r 2 log r + 4 log r r which gives r < 59 So in all cases r j < 0 6 Here we checked that e r = for all such r except r {3 3} for which e r = 2 If e rj = we then get τn /r j so n = r j Thus n in contradiction with Lemma 3 Assume now that r j {3 3} Say r j = 3 In this case 79 and 599 divide Q 3 which divides therefore φ = P m Thus if there is some other prime factor r of n /3 then 3r n and Q 3r has a primitive prime factor q mod 3r In particular 3 q Thus ν 3 φ 3 showing that
15 PELL NUMBERS WHOSE EULER FUNCTION IS A PELL NUMBER P m Hence 3 m therefore 3 M a contradiction A similar contradiction is obtained if r j = 3 since Q 3 has two primitive prime factors namely and so 3 M This finishes the proof Acknowledgement We thank the referee for comments which improved the quality of this paper References Y F Bilu G Hanrot P M Voutier Existence of Primitive Divisors of Lucas and Lehmer Numbers With an appendix by M Mignotte J Reine Angew Math R D Carmichael On the numerical factors of the arithmetic forms α n ± β n Ann Math J Cilleruelo F Luca Repunit Lehmer numbers Proc Edinb Math Soc II Ser B Faye F Luca A Tall On the equation φ5 m = 5 n Bull Korean Math Soc B Faye F Luca Lucas numbers with the Lehmer property Math Rep Buchar to appear 6 R Guy Estimation de la fonction de Tchebychef θ sur le k-ieme nombre premier et grandes valeurs de la fonction ωn nombre de diviseurs premiers de n Acta Arith J M Grau Ribas F Luca Cullen numbers with the Lehmer property Proc Am Math Soc : Corrigendum F Luca Arithmetic functions of Fibonacci numbers Fibonacci Q Multiply perfect numbers in Lucas sequences with odd parameters Publ Math Fibonacci numbers with the Lehmer property Bull Pol Acad Sci Math F Luca F Nicolae φf m = F n Integers A30 2 W McDaniel On Fibonacci and Pell Numbers of the Form kx 2 Fibonacci Q H L Montgomery R C Vaughan The large sieve Mathematika A Pethő The Pell sequence contains only trivial perfect powers in Sets graphs and numbers Budapest 99 Colloq Math Soc János Bolyai 60 North-Holland Amsterdam J B Rosser L Schoenfeld Approximate formulas for some functions of prime numbers Ill J Math School of Mathematics Received University of the Witwatersrand Revised Wits South Africa Ecole Doctorale de Mathematiques et d Informatique Université Cheikh Anta Diop de Dakar Dakar Fann Senegal bernadette@aims-senegalorg School of Mathematics University of the Witwatersrand Wits South Africa florianluca@witsacza
arxiv: v1 [math.nt] 24 Aug 2015
LUCAS NUMBERS WITH THE LEHMER PROPERTY arxiv:1508.05709v1 [math.nt] 24 Aug 2015 BERNADETTE FAYE AND FLORIAN LUCA Abstract. A composite positive integer n is Lehmer if φ(n) divides n 1, where φ(n) is the
More informationarxiv: v1 [math.nt] 2 Oct 2015
PELL NUMBERS WITH LEHMER PROPERTY arxiv:1510.00638v1 [math.nt] 2 Oct 2015 BERNADETTE FAYE FLORIAN LUCA Abstract. In this paper, we prove that there is no number with the Lehmer property in the sequence
More informationFibonacci numbers of the form p a ± p b
Fibonacci numbers of the form p a ± p b Florian Luca 1 and Pantelimon Stănică 2 1 IMATE, UNAM, Ap. Postal 61-3 (Xangari), CP. 8 089 Morelia, Michoacán, Mexico; e-mail: fluca@matmor.unam.mx 2 Auburn University
More informationarxiv: v2 [math.nt] 29 Jul 2017
Fibonacci and Lucas Numbers Associated with Brocard-Ramanujan Equation arxiv:1509.07898v2 [math.nt] 29 Jul 2017 Prapanpong Pongsriiam Department of Mathematics, Faculty of Science Silpakorn University
More informationABSTRACT. In this note, we find all the solutions of the Diophantine equation x k = y n, 1, y 1, k N, n INTRODUCTION
Florian Luca Instituto de Matemáticas UNAM, Campus Morelia Apartado Postal 27-3 (Xangari), C.P. 58089, Morelia, Michoacán, Mexico e-mail: fluca@matmor.unam.mx Alain Togbé Mathematics Department, Purdue
More informationFlorian Luca Instituto de Matemáticas, Universidad Nacional Autonoma de México, C.P , Morelia, Michoacán, México
Florian Luca Instituto de Matemáticas, Universidad Nacional Autonoma de México, C.P. 8180, Morelia, Michoacán, México e-mail: fluca@matmor.unam.mx Laszlo Szalay Department of Mathematics and Statistics,
More informationPowers of Two as Sums of Two Lucas Numbers
1 3 47 6 3 11 Journal of Integer Sequences, Vol. 17 (014), Article 14.8.3 Powers of Two as Sums of Two Lucas Numbers Jhon J. Bravo Mathematics Department University of Cauca Street 5 No. 4-70 Popayán,
More information#A11 INTEGERS 12 (2012) FIBONACCI VARIATIONS OF A CONJECTURE OF POLIGNAC
#A11 INTEGERS 12 (2012) FIBONACCI VARIATIONS OF A CONJECTURE OF POLIGNAC Lenny Jones Department of Mathematics, Shippensburg University, Shippensburg, Pennsylvania lkjone@ship.edu Received: 9/17/10, Revised:
More informationArithmetic properties of the Ramanujan function
Proc. Indian Acad. Sci. (Math. Sci.) Vol. 116, No. 1, February 2006, pp. 1 8. Printed in India Arithmetic properties of the Ramanujan function FLORIAN LUCA 1 and IGOR E SHPARLINSKI 2 1 Instituto de Matemáticas,
More informationPELLANS SEQUENCE AND ITS DIOPHANTINE TRIPLES. Nurettin Irmak and Murat Alp
PUBLICATIONS DE L INSTITUT MATHÉMATIQUE Nouvelle série, tome 100114 016, 59 69 DOI: 10.98/PIM161459I PELLANS SEQUENCE AND ITS DIOPHANTINE TRIPLES Nurettin Irmak and Murat Alp Abstract. We introduce a novel
More informationPartial Sums of Powers of Prime Factors
1 3 47 6 3 11 Journal of Integer Sequences, Vol. 10 (007), Article 07.1.6 Partial Sums of Powers of Prime Factors Jean-Marie De Koninck Département de Mathématiques et de Statistique Université Laval Québec
More informationOn the digital representation of smooth numbers
On the digital representation of smooth numbers Yann BUGEAUD and Haime KANEKO Abstract. Let b 2 be an integer. Among other results, we establish, in a quantitative form, that any sufficiently large integer
More informationPart II. Number Theory. Year
Part II Year 2017 2016 2015 2014 2013 2012 2011 2010 2009 2008 2007 2006 2005 2017 Paper 3, Section I 1G 70 Explain what is meant by an Euler pseudoprime and a strong pseudoprime. Show that 65 is an Euler
More informationDiophantine triples in a Lucas-Lehmer sequence
Annales Mathematicae et Informaticae 49 (01) pp. 5 100 doi: 10.33039/ami.01.0.001 http://ami.uni-eszterhazy.hu Diophantine triples in a Lucas-Lehmer sequence Krisztián Gueth Lorand Eötvös University Savaria
More informationGAPS IN BINARY EXPANSIONS OF SOME ARITHMETIC FUNCTIONS, AND THE IRRATIONALITY OF THE EULER CONSTANT
Journal of Prime Research in Mathematics Vol. 8 202, 28-35 GAPS IN BINARY EXPANSIONS OF SOME ARITHMETIC FUNCTIONS, AND THE IRRATIONALITY OF THE EULER CONSTANT JORGE JIMÉNEZ URROZ, FLORIAN LUCA 2, MICHEL
More informationTwo Diophantine Approaches to the Irreducibility of Certain Trinomials
Two Diophantine Approaches to the Irreducibility of Certain Trinomials M. Filaseta 1, F. Luca 2, P. Stănică 3, R.G. Underwood 3 1 Department of Mathematics, University of South Carolina Columbia, SC 29208;
More informationCullen Numbers in Binary Recurrent Sequences
Cullen Numbers in Binary Recurrent Sequences Florian Luca 1 and Pantelimon Stănică 2 1 IMATE-UNAM, Ap. Postal 61-3 (Xangari), CP 58 089 Morelia, Michoacán, Mexico; e-mail: fluca@matmor.unam.mx 2 Auburn
More informationODD REPDIGITS TO SMALL BASES ARE NOT PERFECT
#A34 INTEGERS 1 (01) ODD REPDIGITS TO SMALL BASES ARE NOT PERFECT Kevin A. Broughan Department of Mathematics, University of Waikato, Hamilton 316, New Zealand kab@waikato.ac.nz Qizhi Zhou Department of
More informationDivisibility in the Fibonacci Numbers. Stefan Erickson Colorado College January 27, 2006
Divisibility in the Fibonacci Numbers Stefan Erickson Colorado College January 27, 2006 Fibonacci Numbers F n+2 = F n+1 + F n n 1 2 3 4 6 7 8 9 10 11 12 F n 1 1 2 3 8 13 21 34 89 144 n 13 14 1 16 17 18
More informationResolving Grosswald s conjecture on GRH
Resolving Grosswald s conjecture on GRH Kevin McGown Department of Mathematics and Statistics California State University, Chico, CA, USA kmcgown@csuchico.edu Enrique Treviño Department of Mathematics
More informationTHE ORDER OF APPEARANCE OF PRODUCT OF CONSECUTIVE FIBONACCI NUMBERS
THE ORDER OF APPEARANCE OF PRODUCT OF CONSECUTIVE FIBONACCI NUMBERS DIEGO MARQUES Abstract. Let F n be the nth Fibonacci number. The order of appearance z(n) of a natural number n is defined as the smallest
More informationGENERALIZED FIBONACCI AND LUCAS NUMBERS OF THE FORM wx 2 AND wx 2 1
Bull. Korean Math. Soc. 51 (2014), No. 4, pp. 1041 1054 http://dx.doi.org/10.4134/bkms.2014.51.4.1041 GENERALIZED FIBONACCI AND LUCAS NUMBERS OF THE FORM wx 2 AND wx 2 1 Ref ik Kesk in Abstract. Let P
More information198 VOLUME 46/47, NUMBER 3
LAWRENCE SOMER Abstract. Rotkiewicz has shown that there exist Fibonacci pseudoprimes having the forms p(p + 2), p(2p 1), and p(2p + 3), where all the terms in the products are odd primes. Assuming Dickson
More informationTHE EULER FUNCTION OF FIBONACCI AND LUCAS NUMBERS AND FACTORIALS
Annales Univ. Sci. Budapest., Sect. Comp. 41 (2013) 119 124 THE EULER FUNCTION OF FIBONACCI AND LUCAS NUMBERS AND FACTORIALS Florian Luca (Morelia, Mexico) Pantelimon Stănică (Monterey, USA) Dedicated
More informationMath 109 HW 9 Solutions
Math 109 HW 9 Solutions Problems IV 18. Solve the linear diophantine equation 6m + 10n + 15p = 1 Solution: Let y = 10n + 15p. Since (10, 15) is 5, we must have that y = 5x for some integer x, and (as we
More informationNotes on Systems of Linear Congruences
MATH 324 Summer 2012 Elementary Number Theory Notes on Systems of Linear Congruences In this note we will discuss systems of linear congruences where the moduli are all different. Definition. Given the
More informationAll variables a, b, n, etc are integers unless otherwise stated. Each part of a problem is worth 5 points.
Math 152, Problem Set 2 solutions (2018-01-24) All variables a, b, n, etc are integers unless otherwise stated. Each part of a problem is worth 5 points. 1. Let us look at the following equation: x 5 1
More informationHouston Journal of Mathematics c 2050 University of Houston Volume 76, No. 1, Communicated by George Washington
Houston Journal of Mathematics c 2050 University of Houston Volume 76, No., 2050 SUMS OF PRIME DIVISORS AND MERSENNE NUMBERS WILLIAM D. BANKS AND FLORIAN LUCA Communicated by George Washington Abstract.
More informationA family of quartic Thue inequalities
A family of quartic Thue inequalities Andrej Dujella and Borka Jadrijević Abstract In this paper we prove that the only primitive solutions of the Thue inequality x 4 4cx 3 y + (6c + 2)x 2 y 2 + 4cxy 3
More information#A2 INTEGERS 12A (2012): John Selfridge Memorial Issue ON A CONJECTURE REGARDING BALANCING WITH POWERS OF FIBONACCI NUMBERS
#A2 INTEGERS 2A (202): John Selfridge Memorial Issue ON A CONJECTURE REGARDING BALANCING WITH POWERS OF FIBONACCI NUMBERS Saúl Díaz Alvarado Facultad de Ciencias, Universidad Autónoma del Estado de México,
More informationNumber Theory Solutions Packet
Number Theory Solutions Pacet 1 There exist two distinct positive integers, both of which are divisors of 10 10, with sum equal to 157 What are they? Solution Suppose 157 = x + y for x and y divisors of
More informationAndrew Granville To Andrzej Schinzel on his 75th birthday, with thanks for the many inspiring papers
PRIMITIVE PRIME FACTORS IN SECOND-ORDER LINEAR RECURRENCE SEQUENCES Andrew Granville To Andrzej Schinzel on his 75th birthday, with thanks for the many inspiring papers Abstract. For a class of Lucas sequences
More informationFIBONACCI DIOPHANTINE TRIPLES. Florian Luca and László Szalay Universidad Nacional Autonoma de México, Mexico and University of West Hungary, Hungary
GLASNIK MATEMATIČKI Vol. 436300, 53 64 FIBONACCI DIOPHANTINE TRIPLES Florian Luca and László Szalay Universidad Nacional Autonoma de México, Mexico and University of West Hungary, Hungary Abstract. In
More informationChris Smyth School of Mathematics and Maxwell Institute for Mathematical Sciences, University of Edinburgh, Edinburgh EH9 3JZ, UK.
THE DIVISIBILITY OF a n b n BY POWERS OF n Kálmán Győry Institute of Mathematics, University of Debrecen, Debrecen H-4010, Hungary. gyory@math.klte.hu Chris Smyth School of Mathematics and Maxwell Institute
More informationuniform distribution theory
Uniform Distribution Theory 9 204 no. 2 25 uniform distribution theory ON THE FIRST DIGITS OF THE FIBONACCI NUMBERS AND THEIR EULER FUNCTION Florian Luca Pantelimon Stănică ABSTRACT. Here we show that
More informationARITHMETIC PROGRESSIONS OF SQUARES, CUBES AND n-th POWERS
ARITHMETIC PROGRESSIONS OF SQUARES, CUBES AND n-th POWERS L. HAJDU 1, SZ. TENGELY 2 Abstract. In this paper we continue the investigations about unlike powers in arithmetic progression. We provide sharp
More informationOn repdigits as product of consecutive Lucas numbers
Notes on Number Theory and Discrete Mathematics Print ISSN 1310 5132, Online ISSN 2367 8275 Vol. 24, 2018, No. 3, 5 102 DOI: 10.7546/nntdm.2018.24.3.5-102 On repdigits as product of consecutive Lucas numbers
More informationGeneralized Lebesgue-Ramanujan-Nagell Equations
Generalized Lebesgue-Ramanujan-Nagell Equations N. Saradha and Anitha Srinivasan Dedicated to Professor T. N. Shorey on his 60th birthday 1 Prelude For any positive integer ν > 1, let P (ν) and ω(ν) denote
More informationPRIMITIVE PRIME FACTORS IN SECOND-ORDER LINEAR RECURRENCE SEQUENCES
PRIMITIVE PRIME FACTORS IN SECOND-ORDER LINEAR RECURRENCE SEQUENCES Andrew Granville To Andrzej Schinzel on his 75th birthday, with thanks for the many inspiring papers Abstract. For a class of Lucas sequences
More informationNONABELIAN GROUPS WITH PERFECT ORDER SUBSETS
NONABELIAN GROUPS WITH PERFECT ORDER SUBSETS CARRIE E. FINCH AND LENNY JONES Abstract. Let G be a finite group and let x G. Define the order subset of G determined by x to be the set of all elements in
More informationEven perfect numbers among generalized Fibonacci sequences
Even perfect numbers among generalized Fibonacci sequences Diego Marques 1, Vinicius Vieira 2 Departamento de Matemática, Universidade de Brasília, Brasília, 70910-900, Brazil Abstract A positive integer
More informationEXTENDING A THEOREM OF PILLAI TO QUADRATIC SEQUENCES
#A7 INTEGERS 15A (2015) EXTENDING A THEOREM OF PILLAI TO QUADRATIC SEQUENCES Joshua Harrington Department of Mathematics, Shippensburg University, Shippensburg, Pennsylvania JSHarrington@ship.edu Lenny
More informationArithmetic Functions Evaluated at Factorials!
Arithmetic Functions Evaluated at Factorials! Dan Baczkowski (joint work with M. Filaseta, F. Luca, and O. Trifonov) (F. Luca) Fix r Q, there are a finite number of positive integers n and m for which
More informationPOLYGONAL-SIERPIŃSKI-RIESEL SEQUENCES WITH TERMS HAVING AT LEAST TWO DISTINCT PRIME DIVISORS
#A40 INTEGERS 16 (2016) POLYGONAL-SIERPIŃSKI-RIESEL SEQUENCES WITH TERMS HAVING AT LEAST TWO DISTINCT PRIME DIVISORS Daniel Baczkowski Department of Mathematics, The University of Findlay, Findlay, Ohio
More informationarxiv: v1 [math.nt] 9 Sep 2017
arxiv:179.2954v1 [math.nt] 9 Sep 217 ON THE FACTORIZATION OF x 2 +D GENERALIZED RAMANUJAN-NAGELL EQUATION WITH HUGE SOLUTION) AMIR GHADERMARZI Abstract. Let D be a positive nonsquare integer such that
More informationFadwa S. Abu Muriefah. ON THE DIOPHANTINE EQUATION x fc = y n
DEMONSTRATIO MATHEMATICA Vol. XXXIX No 2 2006 Fadwa S. Abu Muriefah ON THE DIOPHANTINE EQUATION x 2 + 5 2fc = y n Abstract. In this paper we prove that the title equation where k > 0 and n > 3, may have
More informationRigid Divisibility Sequences Generated by Polynomial Iteration
Rigid Divisibility Sequences Generated by Polynomial Iteration Brian Rice Nicholas Pippenger, Advisor Christopher Towse, Reader May, 2008 Department of Mathematics Copyright c 2008 Brian Rice. The author
More informationTHE p-adic VALUATION OF LUCAS SEQUENCES
THE p-adic VALUATION OF LUCAS SEQUENCES CARLO SANNA Abstract. Let (u n) n 0 be a nondegenerate Lucas sequence with characteristic polynomial X 2 ax b, for some relatively prime integers a and b. For each
More informationEVERY NATURAL NUMBER IS THE SUM OF FORTY-NINE PALINDROMES
#A3 INTEGERS 16 (2016) EVERY NATURAL NUMBER IS THE SUM OF FORTY-NINE PALINDROMES William D. Banks Department of Mathematics, University of Missouri, Columbia, Missouri bankswd@missouri.edu Received: 9/4/15,
More informationAliquot sums of Fibonacci numbers
Aliquot sums of Fibonacci numbers Florian Luca Instituto de Matemáticas Universidad Nacional Autónoma de Méico C.P. 58089, Morelia, Michoacán, Méico fluca@matmor.unam.m Pantelimon Stănică Naval Postgraduate
More informationA Variation of a Congruence of Subbarao for n = 2 α 5 β, α 0, β 0
Introduction A Variation of a Congruence of Subbarao for n = 2 α 5 β, α 0, β 0 Diophantine Approximation and Related Topics, 2015 Aarhus, Denmark Sanda Bujačić 1 1 Department of Mathematics University
More informationSOLUTIONS TO PROBLEM SET 1. Section = 2 3, 1. n n + 1. k(k + 1) k=1 k(k + 1) + 1 (n + 1)(n + 2) n + 2,
SOLUTIONS TO PROBLEM SET 1 Section 1.3 Exercise 4. We see that 1 1 2 = 1 2, 1 1 2 + 1 2 3 = 2 3, 1 1 2 + 1 2 3 + 1 3 4 = 3 4, and is reasonable to conjecture n k=1 We will prove this formula by induction.
More informationOn the Diophantine equation k
On the Diophantine equation k j=1 jfp j = Fq n arxiv:1705.06066v1 [math.nt] 17 May 017 Gökhan Soydan 1, László Németh, László Szalay 3 Abstract Let F n denote the n th term of the Fibonacci sequence. Inthis
More information1. Introduction. Let P and Q be non-zero relatively prime integers, α and β (α > β) be the zeros of x 2 P x + Q, and, for n 0, let
C O L L O Q U I U M M A T H E M A T I C U M VOL. 78 1998 NO. 1 SQUARES IN LUCAS SEQUENCES HAVING AN EVEN FIRST PARAMETER BY PAULO R I B E N B O I M (KINGSTON, ONTARIO) AND WAYNE L. M c D A N I E L (ST.
More informationElementary Number Theory Review. Franz Luef
Elementary Number Theory Review Principle of Induction Principle of Induction Suppose we have a sequence of mathematical statements P(1), P(2),... such that (a) P(1) is true. (b) If P(k) is true, then
More informationFibonacci Diophantine Triples
Fibonacci Diophantine Triples Florian Luca Instituto de Matemáticas Universidad Nacional Autonoma de México C.P. 58180, Morelia, Michoacán, México fluca@matmor.unam.mx László Szalay Institute of Mathematics
More informationPOWER VALUES OF SUMS OF PRODUCTS OF CONSECUTIVE INTEGERS. 1. Introduction. (x + j).
POWER VALUES OF SUMS OF PRODUCTS OF CONSECUTIVE INTEGERS L. HAJDU, S. LAISHRAM, SZ. TENGELY Abstract. We investigate power values of sums of products of consecutive integers. We give general finiteness
More informationCorollary 4.2 (Pepin s Test, 1877). Let F k = 2 2k + 1, the kth Fermat number, where k 1. Then F k is prime iff 3 F k 1
4. Primality testing 4.1. Introduction. Factorisation is concerned with the problem of developing efficient algorithms to express a given positive integer n > 1 as a product of powers of distinct primes.
More informationPrime Divisors of Palindromes
Prime Divisors of Palindromes William D. Banks Department of Mathematics, University of Missouri Columbia, MO 6511 USA bbanks@math.missouri.edu Igor E. Shparlinski Department of Computing, Macquarie University
More informationOn integer solutions to x 2 dy 2 = 1, z 2 2dy 2 = 1
ACTA ARITHMETICA LXXXII.1 (1997) On integer solutions to x 2 dy 2 = 1, z 2 2dy 2 = 1 by P. G. Walsh (Ottawa, Ont.) 1. Introduction. Let d denote a positive integer. In [7] Ono proves that if the number
More informationuniform distribution theory
Uniform Distribution Theory 9 (2014), no.1, 21 25 uniform distribution theory ON THE FIRST DIGITS OF THE FIBONACCI NUMBERS AND THEIR EULER FUNCTION Florian Luca Pantelimon Stănică ABSTRACT. Here, we show
More informationAlmost perfect powers in consecutive integers (II)
Indag. Mathem., N.S., 19 (4), 649 658 December, 2008 Almost perfect powers in consecutive integers (II) by N. Saradha and T.N. Shorey School of Mathematics, Tata Institute of Fundamental Research, Homi
More informationMATH 4400 SOLUTIONS TO SOME EXERCISES. 1. Chapter 1
MATH 4400 SOLUTIONS TO SOME EXERCISES 1.1.3. If a b and b c show that a c. 1. Chapter 1 Solution: a b means that b = na and b c that c = mb. Substituting b = na gives c = (mn)a, that is, a c. 1.2.1. Find
More informationarxiv: v2 [math.nt] 12 Mar 2018
THE DENSITY OF NUMBERS n HAVING A PRESCRIBED G.C.D. WITH THE nth FIBONACCI NUMBER CARLO SANNA AND EMANUELE TRON arxiv:705.0805v2 [math.nt] 2 Mar 208 Abstract. Foreachpositiveintegerk,let A k bethesetofallpositiveintegers
More informationMembers of binary recurrences on lines of the Pascal triangle
Publ. Math. Debrecen 67/1-2 (2005), 103 113 Members of binary recurrences on lines of the Pascal triangle By FLORIAN LUCA (Morelia) and FRANCESCO PAPPALARDI (Roma) Abstract. In this paper, we look at a
More informationPower values of sums of products of consecutive integers
isid/ms/2015/15 October 12, 2015 http://www.isid.ac.in/ statmath/index.php?module=preprint Power values of sums of products of consecutive integers L. Hajdu, S. Laishram and Sz. Tengely Indian Statistical
More informationDepartmento de Matemáticas, Universidad de Oviedo, Oviedo, Spain
#A37 INTEGERS 12 (2012) ON K-LEHMER NUMBERS José María Grau Departmento de Matemáticas, Universidad de Oviedo, Oviedo, Spain grau@uniovi.es Antonio M. Oller-Marcén Centro Universitario de la Defensa, Academia
More informationOn The Discriminator of Lucas Sequences
On The Discriminator of Lucas Sequences Bernadette Faye Ph.D Student FraZA, Bordeaux November 8, 2017 The Discriminator Let a = {a n } n 1 be a sequence of distinct integers. The Discriminator is defined
More informationOn rational numbers associated with arithmetic functions evaluated at factorials
On rational numbers associated with arithmetic functions evaluated at factorials Dan Baczkowski (joint work with M. Filaseta, F. Luca, and O. Trifonov) (F. Luca) Fix r Q, there are a finite number of positive
More informationSquares in products with terms in an arithmetic progression
ACTA ARITHMETICA LXXXVI. (998) Squares in products with terms in an arithmetic progression by N. Saradha (Mumbai). Introduction. Let d, k 2, l 2, n, y be integers with gcd(n, d) =. Erdős [4] and Rigge
More informationOn prime factors of integers which are sums or shifted products. by C.L. Stewart (Waterloo)
On prime factors of integers which are sums or shifted products by C.L. Stewart (Waterloo) Abstract Let N be a positive integer and let A and B be subsets of {1,..., N}. In this article we discuss estimates
More informationarxiv: v2 [math.nt] 23 Sep 2011
ELLIPTIC DIVISIBILITY SEQUENCES, SQUARES AND CUBES arxiv:1101.3839v2 [math.nt] 23 Sep 2011 Abstract. Elliptic divisibility sequences (EDSs) are generalizations of a class of integer divisibility sequences
More informationA parametric family of quartic Thue equations
A parametric family of quartic Thue equations Andrej Dujella and Borka Jadrijević Abstract In this paper we prove that the Diophantine equation x 4 4cx 3 y + (6c + 2)x 2 y 2 + 4cxy 3 + y 4 = 1, where c
More informationGENERALIZED LUCAS NUMBERS OF THE FORM 5kx 2 AND 7kx 2
Bull. Korean Math. Soc. 52 (2015), No. 5, pp. 1467 1480 http://dx.doi.org/10.4134/bkms.2015.52.5.1467 GENERALIZED LUCAS NUMBERS OF THE FORM 5kx 2 AND 7kx 2 Olcay Karaatlı and Ref ik Kesk in Abstract. Generalized
More informationOn arithmetic functions of balancing and Lucas-balancing numbers
MATHEMATICAL COMMUNICATIONS 77 Math. Commun. 24(2019), 77 1 On arithmetic functions of balancing and Lucas-balancing numbers Utkal Keshari Dutta and Prasanta Kumar Ray Department of Mathematics, Sambalpur
More informationON THE UNIFORM DISTRIBUTION OF CERTAIN SEQUENCES INVOLVING THE EULER TOTIENT FUNCTION AND THE SUM OF DIVISORS FUNCTION
Annales Univ. Sci. Budapest., Sect. Comp. 44 (205) 79 9 ON THE UNIFORM DISTRIBUTION OF CERTAIN SEQUENCES INVOLVING THE EULER TOTIENT FUNCTION AND THE SUM OF DIVISORS FUNCTION Jean-Marie De Koninck (Québec,
More informationMathematics 4: Number Theory Problem Sheet 3. Workshop 26 Oct 2012
Mathematics 4: Number Theory Problem Sheet 3 Workshop 26 Oct 2012 The aim of this workshop is to show that Carmichael numbers are squarefree and have at least 3 distinct prime factors (1) (Warm-up question)
More information12x + 18y = 50. 2x + v = 12. (x, v) = (6 + k, 2k), k Z.
Math 3, Fall 010 Assignment 3 Solutions Exercise 1. Find all the integral solutions of the following linear diophantine equations. Be sure to justify your answers. (i) 3x + y = 7. (ii) 1x + 18y = 50. (iii)
More informationProducts of Factorials Modulo p
Products of Factorials Modulo p Florian Luca and Pantelimon Stănică IMATE, UNAM, Ap. Postal 6-3 Xangari, CP. 58 089 Morelia, Michoacán, Mexico; e-mail: fluca@matmor.unam.mx Auburn University Montgomery,
More informationSummary Slides for MATH 342 June 25, 2018
Summary Slides for MATH 342 June 25, 2018 Summary slides based on Elementary Number Theory and its applications by Kenneth Rosen and The Theory of Numbers by Ivan Niven, Herbert Zuckerman, and Hugh Montgomery.
More informationActa Academiae Paedagogicae Agriensis, Sectio Mathematicae 31 (2004) 19 24
Acta Academiae Paedagogicae Agriensis, Sectio Mathematicae 31 (2004) 19 24 PRIMITIVE DIVISORS OF LUCAS SEQUENCES AND PRIME FACTORS OF x 2 + 1 AND x 4 + 1 Florian Luca (Michoacán, México) Abstract. In this
More informationON THE LIMIT POINTS OF THE FRACTIONAL PARTS OF POWERS OF PISOT NUMBERS
ARCHIVUM MATHEMATICUM (BRNO) Tomus 42 (2006), 151 158 ON THE LIMIT POINTS OF THE FRACTIONAL PARTS OF POWERS OF PISOT NUMBERS ARTŪRAS DUBICKAS Abstract. We consider the sequence of fractional parts {ξα
More information= 1 2x. x 2 a ) 0 (mod p n ), (x 2 + 2a + a2. x a ) 2
8. p-adic numbers 8.1. Motivation: Solving x 2 a (mod p n ). Take an odd prime p, and ( an) integer a coprime to p. Then, as we know, x 2 a (mod p) has a solution x Z iff = 1. In this case we can suppose
More informationChapter 5. Number Theory. 5.1 Base b representations
Chapter 5 Number Theory The material in this chapter offers a small glimpse of why a lot of facts that you ve probably nown and used for a long time are true. It also offers some exposure to generalization,
More informationNumber Theory. Final Exam from Spring Solutions
Number Theory. Final Exam from Spring 2013. Solutions 1. (a) (5 pts) Let d be a positive integer which is not a perfect square. Prove that Pell s equation x 2 dy 2 = 1 has a solution (x, y) with x > 0,
More information2.3 In modular arithmetic, all arithmetic operations are performed modulo some integer.
CHAPTER 2 INTRODUCTION TO NUMBER THEORY ANSWERS TO QUESTIONS 2.1 A nonzero b is a divisor of a if a = mb for some m, where a, b, and m are integers. That is, b is a divisor of a if there is no remainder
More informationTHE EULER FUNCTION OF FIBONACCI AND LUCAS NUMBERS AND FACTORIALS
Annales Univ. Sci. Budapest., Sect. Comp. 40 (2013) nn nnn THE EULER FUNCTION OF FIBONACCI AND LUCAS NUMBERS AND FACTORIALS Florian Luca (Morelia, Mexico) Pantelimon Stănică (Monterey, USA) Dedicated to
More informationIntroduction to Number Theory
INTRODUCTION Definition: Natural Numbers, Integers Natural numbers: N={0,1,, }. Integers: Z={0,±1,±, }. Definition: Divisor If a Z can be writeen as a=bc where b, c Z, then we say a is divisible by b or,
More informationMath 314 Course Notes: Brief description
Brief description These are notes for Math 34, an introductory course in elementary number theory Students are advised to go through all sections in detail and attempt all problems These notes will be
More informationMath 324, Fall 2011 Assignment 6 Solutions
Math 324, Fall 2011 Assignment 6 Solutions Exercise 1. (a) Find all positive integers n such that φ(n) = 12. (b) Show that there is no positive integer n such that φ(n) = 14. (c) Let be a positive integer.
More informationTHE NUMBER OF DIOPHANTINE QUINTUPLES. Yasutsugu Fujita College of Industrial Technology, Nihon University, Japan
GLASNIK MATEMATIČKI Vol. 45(65)(010), 15 9 THE NUMBER OF DIOPHANTINE QUINTUPLES Yasutsugu Fujita College of Industrial Technology, Nihon University, Japan Abstract. A set a 1,..., a m} of m distinct positive
More information#A9 INTEGERS 12 (2012) PRIMITIVE PRIME DIVISORS IN ZERO ORBITS OF POLYNOMIALS
#A9 INTEGERS 12 (2012) PRIMITIVE PRIME DIVISORS IN ZERO ORBITS OF POLYNOMIALS Kevin Doerksen Department of Mathematics, Simon Fraser University, Burnaby, BC, Canada kdoerkse@gmail.com Anna Haensch Department
More informationPRODUCTS OF THREE FACTORIALS
PRODUCTS OF THREE FACTORIALS A. DUJELLA, F. NAJMAN, N. SARADHA AND T. N. SHOREY Abstract. We study a question of Erdős and Graham on products of three factorials being a square. 1. Introduction For any
More informationON THE EXTENSIBILITY OF DIOPHANTINE TRIPLES {k 1, k + 1, 4k} FOR GAUSSIAN INTEGERS. Zrinka Franušić University of Zagreb, Croatia
GLASNIK MATEMATIČKI Vol. 43(63)(2008), 265 291 ON THE EXTENSIBILITY OF DIOPHANTINE TRIPLES {k 1, k + 1, 4k} FOR GAUSSIAN INTEGERS Zrinka Franušić University of Zagreb, Croatia Abstract. In this paper,
More informationFermat numbers and integers of the form a k + a l + p α
ACTA ARITHMETICA * (200*) Fermat numbers and integers of the form a k + a l + p α by Yong-Gao Chen (Nanjing), Rui Feng (Nanjing) and Nicolas Templier (Montpellier) 1. Introduction. In 1849, A. de Polignac
More informationPowers of 2 with five distinct summands
ACTA ARITHMETICA * (200*) Powers of 2 with five distinct summands by Vsevolod F. Lev (Haifa) 0. Summary. We show that every sufficiently large, finite set of positive integers of density larger than 1/3
More informationOn prime factors of subset sums
On prime factors of subset sums by P. Erdös, A. Sárközy and C.L. Stewart * 1 Introduction For any set X let X denote its cardinality and for any integer n larger than one let ω(n) denote the number of
More informationConcatenations with Binary Recurrent Sequences
1 3 47 6 3 11 Journal of Integer Sequences, Vol. 8 (005), Article 05.1.3 Concatenations with Binary Recurrent Sequences William D. Banks Department of Mathematics University of Missouri Columbia, MO 6511
More informationOn sets of integers whose shifted products are powers
On sets of integers whose shifted products are powers C.L. Stewart 1 Department of Pure Mathematics, University of Waterloo, Waterloo, Ontario, Canada, NL 3G1 Abstract Let N be a positive integer and let
More informationBOUNDS FOR THE SIZE OF SETS WITH THE PROPERTY D(n) Andrej Dujella University of Zagreb, Croatia
GLASNIK MATMATIČKI Vol. 39(59(2004, 199 205 BOUNDS FOR TH SIZ OF STS WITH TH PROPRTY D(n Andrej Dujella University of Zagreb, Croatia Abstract. Let n be a nonzero integer and a 1 < a 2 < < a m ositive
More information