1001 Problems in Classical Number Theory (Solutions) PDF
1001 Problems in Classical Number Theory (Solutions) PDF
(* + (At) =2(?
we obtain
AE) (# = 1,2,3) such that
2 (213%57)? = 3 (293%)? = 5 (2.9%5)”
To do so, we must find integers a, 3) and >; (i = 1,2,3) such that
2a; +1=Sa2 = 5a, 25, = 392 +1= 544, 21 = 392 = 599 +1
We easily find
a; = 7.02 =5,03=3, Gy = 5, =3,h=2 = 3,9 =2=1
We then obtain that n = 2(27 - 35. 5%)? = 3023308800000 serves our
purpose,
(154) This follows from the identity
n® 97 = (n!4)8 38 = (nl — 3)(n® + 3! +37)
(155) We proceed by contradiction by assuming that there does not exist any
prime number in the interval jr,2z], in which case we have 6(2x) = 6(x)
By using the inequalities 0.732 < 0(r) < 1.12r, we would then have
1462 = 2(0.73)x < (22) = O(c) < 1.422,
a contradiction
(156) We proceed by induction. First of all, for n = 4, the sesult is true,
since 121 = 11 = p2 < pipapspi = 210. Assume that the inequality
DE < papa +-py- is true for a certain integer k > 5. By using Bertrand’s
Postllate in the form ps1 < 2Ph, We then have
Phat < APE <4pypa-- “Pha < PIPa-> “Phy
and the result then follows by induction.SOLUTIONS, 135
(157) If there exist g,r,a € N such that g” = (g"/2)? = a, where r is even
and q” = p+m® with p prime and m € N, then a? — m? = p, so that
(a—m)(a+m) = p. Since pis prime, we must have a~m = 1 and a-m =
and therefore m =a —1 and p = 2a~ 1. Hence, if 2a— 1 = 2g"? —1 is
composite, q” cannot be written as p+ m?, as was to be shown.
(158) For p = 3, the result is immediate. Assume that p > 5. If p = 3k+1
for a certain positive integer k, then 8k +1 = 24k +9, a multiple of 3
Otherwise, that is if p = 3k — 1 for a certain positive integer &, then
8p - 1 = 24k — 9, a multiple of 3, which contradicts the fact that 8p ~ 1
is prime. In both cases, the result is proved.
(159) If a positive integer of the form 3k +2 has no prime factor of the form
3k+2, then all its prime factors are of the form 3k +1. Since the product
of two integers of the form 3k-+ 1 is of the form 3k-+ 1, the result follows.
Since each product of prime numbers of the form 4k+1 is of the same
form and since each product of prime numbers of the form 6k-+1 is of the
same form, the result follows.
(160) (a) We have 23 = 3-31+2-2141-Iand 57 = 2-414 1-34 1-2141-1
(b) To find the Cantor expansion of a positive integer m, we proceed as
follows. Let m be the largest positive integer such that m! iow ing
‘The result then follows by combining (1) and (2).
(228) Part (a) is obvious. "To prove (b), first observe that the norm of every
clement of Eis always > 5. Assume that 3 = (a++by=8)(c+dy/—5); taking
the norm, we have 9 = (a2 + 5b2)(c? + 5d2). ‘This is however impossible
since both factors on the right-hand side are larger than 5. Hence, 3 is a
prime belonging to B. We easily obtain that 20 = (8+2v=5)(3 ~2V=5)
and is therefore a composite number in B. Part (c) follows from the fact
that
9 = (3 + 0V=5) - (8 + OV—5) = (2 + V-5)(2 - V5),
(229) Since
1 ifned,
0 otherwise,
sian ={
wwe have that
y aw
site
= S00 aa)
Af), ACz)
Limen tsiSOLUTIONS 181
(230) Let n be a palindzome with 2r digits. Hence, there exist digits di > 0,
da,..-ydy stich that
107-1 + dg10""-? «++ dy 10" + dp lO! +
+dsl0? + dal0 + dh
44, (10"—" +1) + de(10"-? 410) +--+ dy(10" + 107)
(10-1 +1) + 10d2(10°~9 + 1) +--+ 10'-Pde_4 (10? +1)
+10", (10+ 1).
‘The numbers 107+! +1 for i = 0,1,...4r —1 are all multiples of 11.
Indeed, using the Binomial Theorem, we obtain that
10 $1214 (1-1 14 > (on
mS
Jenin =11M
for some positive integer M, in which ease the number m is divisible by
UL
(231) Iris enough to consider the next number, since
1442 = [6,6,2h5 = 6! + 6! +2!
(232) Assume that two such representations exist, that is that there also exist
positive integers ey < ea <... < ey such that
nad tdglt-- td =e! teal +o tert
We proceed by induction. If r = 1, then it is clear that d, = e1, in
which case the result is proved. Assume that the result is true for r~ 1,
and let vs show that it is true for r. Without any loss in generality, we
may assume that d, > e,. If dy = e,, then the conclusion follows by an
induction argument. We may therefore assume that dy > ey, in which
case dy > +1. We then have
(ep FINS yl < dil + dal tent
so that e, +1
Ln 21)
Since 2N = K(k + 2n — 1), it follows that 2N' must have an odd factor
larger than 2, and therefore similarly for N. It follows that .¥ cannot be
a power of 2
Conversely, let NV’ be a postive integer which has an odd factor larger
than 2. Consider the factorization of 2 as a product of two positive
integers of which one is odd. Let A be the smallest of these two factors
and B the largest. Setting k = A and n= ®#1=4, it follows that
(+
which gives the result
REMARK: Since
A=1) , BHI-A_ AB
() hn 1424-04 (k= 1) thn nt (ntl) tt (ntk-1),
the problem is equivalent to the one that consists of searching for the
positive integers which can be written as the sum of consecutive integers.
(266) They are the integers n of the form n = din +2, m = 0,1,2... since
3072 = 9 = —1 (mod 10), while 3 = 1 (mod 10), 3°41 =3 (mod 10)
and 3°" =7 (mod 10).
(267) It is the number 5. Indeed, since n! = 0 (mod 7) as soon as n > 7, we
have
W414 + 50S 4143s alt al + el
424643+146=5 (mod 7).
(268) Since for i > 4, 12|i!, the remainder is 1+2+6 = 9.
(269) For n odd, 10:32" +1 = 0 (aoc 3), while for each even integer n, 10
32" +10 (mod il),
(270) The answer is YES. Since n® = 1 (mod 9) for each integer n such that
and since n? = 4 (mod 9) for n =2 (mod 9), it follows that if
2 (mod 9), we have n®-+n2444 =0 (mod 9). On the other hand, since
0 (mod 4) for all even n, we may conclude that 36|n® -+n?-+4
for n= 18k +2, k= 0,1,2,
(271) Ifthe equation 3k — 1 = 22-4 3y? had a solution, then we would have
2 (mod 3), which is impossible because 2? = 0,1 (mod 3).
(272) We know that
PI
low nf tox] |SOLUTIONS 16s
Amongst the integers 1,2,...m, those which are divisible by pare: p, 2p,
Aap, where ky ~ [n/p Since
nl =1-2---(p— 1)(p)(p-+ 1)(p + 2)--- (2p — V2p)
(2p + 1)(2p + 2)-+-(3p — 1)(3p)((k1 — Dp +1)((k1 ~ 1p + 2
(kip ~ U(kxp)(kip + 1)(kap + 2)--m
and since from Wilson's Theorem, the product of the integers in each set
{1,2,....p— 1} {pt 1p +2,...,2p— 1p... {(ki — Dp +1, (kx ~ 1p
2,...)kyp— 1} is congruent modulo p to ~1, it follows that
(mn
Now, amougst the integers 1,2,..-,k1, those which are divisible by p are:
P.2p,...,kap, where ky = [kx/p] = [n/p?]. It follows that
ican )(E]- [3 mo
where 1 < hy < ky. Continuing this process, the result follows,
(273) We must show that n!*—n = 0 (moa 10) or equivalently that n!*
(mod 2) and n'? —n = 0 (mod 5). Using Fermat's Little Theorem, n? =
‘n (mod 2) which implies n'’ = n (mod 2). Similarly, n® (mod 5)
implies n!3 =n (mod 5),
(274) Since n must be divisible by 7 and by 11, it can be written as n = 7*- 11°,
But n/7=7"-1. 11° must be the 7-th power of an integer, in which case
a = 1 (mod 7) and b = 0 (mod 7). Moreover, n/11 = 72-11? must
be the 11-th power of an integer, so that @ = 0 (mod 11) and b = 1
(amod 11). Solving this system of congruences gives @ = 22 (mod 77) and
= 56 (mod 77). Hence, the smallest positive integer satisfying the given
constraints is n = 7? - 115.
(275) Consider the system of congruences 2-+j-1 = 0 (mod p2), j = 1,2,....4%
where pj stands for the j-th prime number, From the Chinese Remainder
Theorem, this system has one solution; that is there exists an integer
‘n which verifies these k congruences. Therefore, each of the & integers
non 1,...,n-+k~ Lis divisible by a perfect square, as required
(276) Since x’ =a (mod m), there exists k € Z such that x = a+ km and
therefore a + km = b (mod m). Hence, there exists j Z such that
a+km = b+ jn, that is km— jn = (a8). Since (mn,n}im and (m,n)In,
it follows that (m,n)|(a — 8).
Reciprocally, assume that (m,n)|(a~ 2). ‘Then, there exists Mf € Z
such that, a— 5 = M(m,n) and since (m,n) = kim + kan, kiyks © Z,
it follows that there exist integers j and & such that a~b— —km + jm,
k= kM, j = kM. Therefore, we have a+ km = b+ jn, Setting
2 =a4+-km, we obtain x = a (mod m) and moreover 2 = a-bim = b+jn,
that is 2 = (mod n).
(277) Letting WV = (2), then
KIN = p(p—1)--(p—k +1) =0 (mod p),
and since (k!,p) = 1 then N = 0 (mod p).
(278) (a) This follows ftom Problem 277 and induction on n.164 1001 PROBLEMS IN CLASSICAL NUMBER THEORY
(b) Since a? = bP (mod p), then by Fermat's Little Theorem, we have
a =b (mod p) and therefore there exists an integer k such that a
b+ kp. Hence, by the Binomial Theorem, there exists an integer K
such that
a? = (b+ kp)?
we (Pee + (t)e ter + EMP AP + Kp,
where we used the result of Problem 277, thus completing the proof
of part (b). "
(279) Let N= (P52) = P=VEO=2)- 8) We then have
HN = (1)! (mod p)
‘and since (k!,p) = 1, we conchide that NV = (~1)* (mod p).
(280) From Wilson's Theorem,
(=D! = PDP) — p=)!
= (-1)rMp—
I= —1 (mod p).
Since (—1)"r!=1 (mod p), we obtain the result.
For the second part, it is enough to xotice that (—1)99! = 1 (mod 269)
and that (—1)!915!= 1 (mod 479).
(281) Assume that a solution exists. First, if @ is odd,
ay?
» -2
#0 (mod 3),
which contradicts the given equation. Similarly, if 3 is even,
(20-1) (2%? +1),
which means that 3[(2/? —1) > 3 or 3[(2%/? + 1) > 3, and this is why we
must have that p|(2/ — 1) and p\(2*/? +1), implying that p|2, which is
not possible.
(282) (P.Giblin [14}) Ascume that q is a prime factor of n. Since m is odd, it
follows that q is odd. We will first prove that pl(q — 1). Observe that
4” = 2" =I (mod n), so that 4° = 1 (mod q). It follows that r, the
‘order of 4 modulo g, is «factor of p; we therefore have that r = 1 or r= p.
If = 1, then 4 = 1 (mod q), which implies that q = 3, in which case 3[7,
which contradicts the fact that n is not a multiple of 3. Hence, r = p,
which implies that plq— 1, as required, We shall finally show that
Since q— 1 > p, we have g > p—1>n/2> yn, because n > 4. We
have thus shown that each prime factor q of nis larger than /n, which is
impossible unless n itself is a prime number.
(283) (Francesco Sica) Assume that pja—b. Then there exists a positive integer
¢ which is not divisible by p and such that
Y
boas eph,SOLUTIONS 2065
We then have
valerate ~ S(Pewinen
= ott tgt + Dae 222 tant gH)
= oP +algt*) (mod pt?)
We have ths established that
(+9) a — = aPtepk** (mod pt),
hence, in particular (+). Moreover, it follows from (e+) that p+? divides
a? -+a?"lep**, bat, since p fate, it follows that p!+? divides exactly
a? — B, as required
(284) The answer is NO. If p = 2, then pjl, a contradiction. Hence, p > 3.
If 5 is even, then p! +1 =1+1 = 2 (mod 4) while 2” = 0 (mod 4), a
contradiction, while if 6 is odd, then
2 = ph +1 (pt ip? ph? +--— pt) = @+NQ
where Q > 1 is odd, which is nonsense.
(285) Ifa solution {m,n} exists, then it is clear that n> Land that m>n>1,
in whieh case
1+n=m! (m—n)(m+n)>m+n>1+n,
which is nonsense.
Second solution. Assume that 1+ n+n? =m? with n > 1,m>1.
We then have 4+ 4n +n? ~ 4m? and therefore (2n +1)? +3
But, the only squares which differ by 3 are 1 and 4. This impli
n=0, Which contradicts the fact that n > 1
(286) Let (1) be the equation for which we seek the solutions and let {p,q} be
‘a solution. First of all, it is clear that
@) P+i
pis p tp+ps1=
But it follows from (1) that p(l +p-+#?-+ #4) = 4? -1=(@— {4+ 1)
and this shows that pi(g--1)(a-+ 1) It follows that pl(q 1) or pl(q +1)
Wolq— 1), then it follows from (2) that
pi
a.
(c) It is for n =7 (with k = 2)
(@) Ifn = 4k-+1 (here a — b means that f(a) = 6),
ma dk+ 1 3n 41 = 12k +4 6k4+ 2 3k-4+1,
which implies that
n=1 nd
Pin) =ae+1=3(25") + Bat
On the other hand, if n = 4k +3, we have
n= 4k +3 — 3n+1= 12k + 10 — 6k + 5 + 3(6k + 5) +1 = 18k + 16,
which means that
P(n) = 18k + 16 > 4(4k +3)
(¢) The integer n = 62 will do, We have indeed
62 B15 94 47 142 71 214 107 822 + 161 — 484
(£) The answer is YES.
(g) Since n is odd, we have f(n) = 3n+1=2%r, with a> 1 and r odd,
Tt follows that f(n) = 2°~"'r and therefore that,
iq) — (20 ha,
Pom ee test
3n
ath
It follows from this that f%(n) > n if and only if a
2i}3n+ 1, and it happens with ¢ probability of 3
+ which oceurs if1001 PROBLEMS IN CLASSICAL NUMBER THEORY
(h) Choosing n = 5, we find that the iteration f(5), f2(5), ... enters an
endless loop, namely
526 + 13 66 + 33 + 166 — 83 + 416 — 208
104 + 52 26 13,
‘of which 13 is the turning point. Hence, the process never reaches 1.
(i) Let & be the integer defined by the relation 2"
You might also like