Number Theory: Xyy 7 Xyy 7 X 2y Xyy 7 X 2y
Number Theory: Xyy 7 Xyy 7 X 2y Xyy 7 X 2y
Number Theory: Xyy 7 Xyy 7 X 2y Xyy 7 X 2y
30) If the last two digit of a three digit number divisible by 7 are equal then the sum of the digits of that number is
divisible by 7.Prove it.
Solution:
Let A= xyy we know 7 xyy we should prove 7 x 2y .
xyy =100x+10y+y=7(14x+y)+2(x+2y) so 7 x 2y
33) The phone number of Peter is composed of two 3-digit numbers. Each of them is divisible by 45, and the middle
digit is 8. Find the phone number if the first part of the number is less than the second one
Solution:
Let the phone number be: a8bx8 y
If both of the numbers a8b and x8 y are divisible by 45, then they must be divisible by 5 and 9.
So the last digit is either 0 or 5. If the last digit is 0, then the first digit is 1.
Since the first number is less than the second one the phone number is 180585.
34) How many natural numbers, less than 1000, are not divisible by neither 5 nor 7?
Solution:
There are 199 numbers which are divisible by 5 less than 1000.There are 142 numbers divisible by 7 less than
1000 ,and there are 28 numbers which are divisible by 5 and 7 less than 1000.The numbers which are divisible by 5
or 7 is 142+199-28=313 and we have totally 999 number less than 1000.So the numbers which are not divisible by
5 nor 7 is 999-313=686
35) Prove that the sum of the cubes of three consecutive natural numbers is divisible by 9.
Proof: Let n-1, n and n+1 be consecutive natural numbers. Then the sum of their cube is (n-
1)3+n3+(n+1)3=3n3+6n=3n(n3+2)
So it is sufficient to prove that n(n2+2) is divisible by 3. There are three possibilities.
A) if n=3k, then 3/n so 3/n(n2+2) as well,
B) if n=3k+1, then n2+2=(3k+1)2+2=3(k2+2k+1) so 3/n(n2+2).
C) If n=3k+2, then 3/(n2+2) 3/n(n2+2)
We can conclude that the sum of the cubes of the numbers is divisible by 3.
36) Prove that for every positive integer n the expression 7.52n+12.6n is divisible by 19.
Proof:
The given expression can be transformed in the form: 7.52n+12.6n = 7(52)n+12.6n = 7.25n+12.6n
=7.25n-7.6n+19.6n
=7(25-6)(25n-1+25n-2.6++6n-1)+19.6n
=19. [7. (25n-1+25n-2.6++6n-1)+6n] so it is obvious that 19/17.52n+12.6n
37) Prove that for every positive integer n the expression 62n+19n-2n+1 is divisible by 17.
Proof:
62n+19n-2n+1 = 36n+19n-2.2n =36n-19n+2(19n-2n) =(36-19)(.)+2(19-2)(...)
17/36n-19n and 17/2(19n-2n) For this reason the left side is divisible by 17. Which means that
17/(62n+19n-2n+1)
Proof:
If 1 is the last digit of two numbers then 1 is the last digit of their product. The last digit of the number 710000 is 1,
because 710000=(74)2500=24012500 (always last digit is 1)
As a result, we get that the last digit of the number 710000-1 is 0. So the number is divisible by 10.
39) Prove that the number 11996+21996+31996+41998+51998+61998 is divisible by 5, but not divisible by 10.
Proof:
The last digit of the number 11996 is 1 The last digit of the number41998 is 6
The last digit of the number 21996 is 6 The last digit of the number 51998 is 5.
The last digit of the number 31996 is 1 The last digit of the number61998 is 6
For this reason, the last digit of the given number coincides with the last digit of the number 1+6+1+6+5+6=25
and that is 5. So the given number is divisible by 5, but not 10.
Proof:
a) The last digit of the number 19991 is 9, and the last digit of the number 19992 is 1.
It means that the number 19991999=19991998.1999
=(19992)499.1999
=1.9=9
The last digit is 9+1=10 so the number is divisible by 10.
b) 101990-10=100000=99..90 =9.(1110)
1989 digits
Since 1989 digit 9/(11.10) So =9.9A=81A So the number is divisible by 81.
22225555+55552222=5+2(mod 7)=0(mod 7)
So remainder is 0 7 / 22225555+55552222
45) Find the remainder obtained from the division of the number
a) 14256 by 17
b) 7100+11100 by 13
c) 1316-225.515 by 3
d) (116+1717)21 by 8
e) 4343-1717 by 10
Similar solution answers are
a) 1 b) 12 c) 0 d) 5 e)0
46) Which is the last digit of the number
a) 6811
b) 21000
c) 39999
Solution:
a) 62 6(mod 10)
63 6(mod 10).6811 6(mod 10)
The last digit of the number is 6
similar b) 6 c) 7
Solution:
19 1 (mod 18)
91 1(mod 18) So 1991-9119 (191-119) 0(mod 18)
Solution:
1999 0(mod 1999)
1999-k -k(mod 1999)
(1999-k) 1999+k1999 0(mod 1999)
11999+21999++19981999+19991999=
=(11999+19981999)+(21999+19971999)+. ..+(9991999+10001999)+ 19991999
=0+0+..+19991999 is divisible by1999
Solution:
665=5.7.19 so we have to prove that the difference is
divisible by 5,7 and 19
36 26 4(mod 5)
(36)n (26)n 4n-4n 0(mod 5)
36 26 1(mod 7)
(36)n (26)n 1n-1n 0(mod 7)
36 26 7(mod 19)
(36)n (26)n 7n-7n 0(mod 19)
So 36n-26n is divisible by 665
52) If the natural number n is divisible by 4 then 1n+2n+3n+4n is divisible by 5. Prove it.
Solution:
3 -2(mod 5)
4 -1(mod 5)
If n is an odd number,(so n is not divisible by 4)
1n+2n+3n+4n (1n+2n+(-1)n+(-2)n 0(mod 5)
So 51n+2n+3n+4n
If n is an even number
1n+2n+3n+4n (12k+22k+(-1)2k+(-2)2k
12k+22k+12k+22k 2(12k+4k)
2(1+(-1)k) A(mod 5)
If k is an odd number A is 0
If k is an even number then A=4 In that case n does not satisfy the condition because it is not divisible by 4.
53) Prove that the number 1+3+32++32000 is divisible by 41.
Proof:
1 1 (mod 41)
3 3 (mod 41)
32 9 (mod 41)
33 27 (mod 41)
34 40 (-1)(mod 1)
35 (-1).3 -3 (mod 41)
36 (-1).9 -9 (mod 41)
+ 37 (-1).27 -27 (mod 41)
___________________________
Proof: 1234+1235+1236+1237+1238+1239+1243++1249++9876.
abcd all the digits are different
so a 9 numbers
b 8 numbers
c 7 numbers
d 6 numbers
the number of all such numbers is 9.8.7.6=3024
the sum of these two numbers
1234+9876=11110 and generally
abcd 10 a 10 b 10 c 10 d 11110 The sum of these numbers equidistant to each other will be
.1234 9876
3024
=
2
=1512.11110=16698320.
56) Let a1 , a 2 ,..., a 7 be integers, and b1,b2,,b7 be numbers equal to the given numbers, but written in different
order. Prove that the product of a1 b1
. a 2 b2 ...a7 b7 is an even number.
Proof: Lets say each product of
a1 b1 c1 , a 2 b2 c 2 ,..., a 7 b7 c7 Where c1,c2,,c7 are odd numbers:
If a1 b1 c1
a 2 b2 c 2
.
.
.
+ a 7 b7 c7
________________
Solution:
88.(899+898++1)+1
=(89-1).(899++1)+1
=(8910-1)+1
=8910
58) Find three natural numbers such that any two of them are relatively prime, and the sum of any two of them is
divisible by the third one.
59) If 4 is the last digit of the number, n2+2n, n N then what is the digit in tens digit.
62) Let n be a product of two consecutive natural numbers. Is it possible n to be equal to a product of four
consecutive natural numbers?
Solution: n=m(m+1)=k.(k+1)(k+2)(k+3)
m2+m=(k2+3k)(k2+3k+1)
m2+m+1=(k2+3k)(k2+3k+2)+1
m2+m+1=(k2+3k+1)2
But, (m) <m +m+1<(m+1)2
2 2
64) Let n,n2,n1997,n1998 be natural numbers. Which satisfy the equality n12+n22++n21997=n21998. Prove that at least
two of these numbers are even.
Proof: It is not possible for n1998 be the only even number. In that case an odd number as a result of sum of odd
numbers will be equal to an even number which is a contradiction.
If we suppose that all the numbers are odd:
n1998=2k+1 n2=(2k+1)2=4k2+4k+1
=4k(k+1)+1
For one of k or (k+1) are even for k N then: 8| 4k(k+1)
4k(k+1)+1 1 (mod8)
n12+n22++n21997=A+1997 5 (mod 8)
1 5 is a contradiction.
So at least two of the numbers are even
1996 =k2-(n+1)2
1.2.2.499= (k-n-1)(k+n+1)
k-n-1 {1,2,4,499,998,1996}
k+n+1 {1,2,4,499,998,1996}
The question has solution for only (otherwise
2k=1997 or2k=503 impossible)
k-n-1=2
k+n+1=998
+ _________
2k=1000 k=500
n+1=498, n=497.
66) Is there any natural number n for which
n2+2n+1991 is a perfect square?
SIMILAR SOLUTION OF 65 (n=96)
68) Is there any number in the form of 2n+4n, n N which is a perfect square?
Solution: 2n+4n=k2
2n+22n=k2 multiply both side by 4
Hence : 4.(22n+2n)+1=4k2+1
4.22n+4.2n+1=4k2+1
(2.2n+1)2-4k2=1
(2.2n+1-2k)(2.2n+1+2k)=1
This equation is not possible, since the second multiple is always greater than 1, for any natural number n and k. So
there is no number in that property.
A={1,11,111,, 111
11 } are divisible by
...
2000
10 x 1
Solution: 111 1 =
... is divisible by 7
x 9
If and only if 10x-1 is divisible by 7
10x-1 0 (mod 7) 10x 1 (mod 7)
x =1,2,3..6 106 1 how many multiple of 6 are there in 2000
By checking x=6
2000:6=333
So 333 of them are divisible by 7.
2 n n
70) Prove that 111..11 - 222...2 is a square of some natural numbers?
Solution:
2 n n 2 n n n
111..11 - 222...2 = 111..11 - 111..11 - 111..11
n
n
n
n
n
= 111..11000....0 - 111..11 = 111..11 . 10 n - 111..11
n
n
n
= 111..11 10 n 1 = 111..11 . 999....99
2 2
n n
=9. 111..11 = 3. 111..11
71) Prove that the product of three consecutive natural numbers cannot respect the nth (n>1,n N) power of any
natural numbers?
b2n-cn=(b2)n-cn=(b2-c).((b2)n-1+(b2)n-2c++cn-1) 1
81).Prove that the sum of the squares of 5 consecutive integers cannot be a square of an integer.
Proof:
Lets suppose there exist 5 consecutive integers hold this condition such that:
(a-2)2+(a-1)2+a2+(a+1)2+(a+2)2=b2 a,b 5(a2+2)=b2 (or b2- 5a2=10 no solution in Z)
2
If b is divisible by 5 then b divisible by 5 for any integer .
Hence the left side is divisible by 5,
While the right side is divisible by 25.
It is a contradiction
So there is no such integers.
1
=111 . . . 1 (10100 +2) = 99
...
9 . . (10100 +2)
100 9
10 100
1 10 100
2
= .
3 3
100
The number 10 -1= 99
...
9 is divisible by9.
100
Hence it is divisible by 3.
The number 10100+2=(10100-1)+3 is also divisible by 3,so
10100 1 10100 2 10100 1 100100 1 3
. = .
3 3 3 3 3
10100 1 10100 1
= . 1 is a product of two consecutive natural numbers.
3 3
87) Find all 6-digit numbers abcdef for which
abcdef =a (103( cc )2-( cc )) , (a 0) and all the
digits are different from each other.
Solution:
Given conditions can be written in the following form
abcdef =121000.ac2-11ac ,
since a 9 and c 9 , we get 11ac <1100
so the right side is a positive number.
The number 121000ac2-11ac has six digits only if 1 ac2 8 otherwise it will be 7-digit
By the use of the condition a c,
We obtain that either a=2,3,4,5,6,7 and c=1, or a=1, and c=2,
The number is written with different digits, if a=2,4,6 and 7,c=1 ,substitute the value of a and c in the
expression
abcdef =a (103( cc )2-( cc ))
So the numbers are:241978 ; 483956 ; 725934 ; 846923
Solution:
abc ab ac bc ba ca cb
=100a+10b+c=(10a+b)+(10a+c)+(10b+a)+(10b+c)+(10c+a)+(10c+b)
=22a+22b+22c
Hence
78a=12b+21c
26a=4b+7c
For the greatest values of b and c we get: b 9,c 9
4.9 7.9
a i e a3
26
26 7c
If a=1, then b= (try c=1,2,3..9 and b is Z) c=2, b=3,
4
26.2 7c
If a=2 , then b= c=4 , b=6
4
26.3 7c
If a=3 , then b= c=6 , b=9
4
The numbers are 132,264,396
89)
a-The natural number n has exactly 80 different
divisors which are natural numbers including 1 and
n itself. Prove that the product of all of the divisors
is equal to n40
b-The natural number n has exactly 1997 different
divisors which are natural numbers including 1 and
itself. Prove that n is a perfect square of some
natural number.
Solution:
a- If p1=1,p2 p3,p80=n are all the divisors of the
number n,then. n =k1p1 , n =k2p2 ,. n =k80p80
If we multiply these equation, we have
n80=(k1,k2,..k80)(p1.p2p80)
The numbers in the first brackets are also divisors of
the number n, only written in a different order.For
that reason, n80=(p1.p2..p80)2 , so p1.p2..p80=n40
b- According to a) we have : p1.p2..p1997=n1997/2
n1997/2 is an integer,hence n has to be a perfect
square.
Solution:
If we use the formula
nn 1
S1=1+2+ . . . +n= and
2
n(n 1)
2
3 3 3
S3=1 +2 + . . .n =
2
The last digit of the product n(n+1) is 0,2 or 6.(for 4 and 8 last digit will be even.)
So the last digit of S2, is 0,1 or 3
S12=S3 hence the last digit of the sum S1 is also 1.
Solution:
By checking we can see that
74 1 (mod 10)
74k 1 (mod 10)
and 1980 4 19801998 0 (mod 4)
1998
hence 71980 1 (mod 10) lastd digit is 1
4
3 1 (mod 10)
34k 1 (mod 10)
8098 is divisible by 4 hence 380 1(mod 10)
98
1998 98
71980 380 =1-1=0 so it is divisible by 5
98) a1,a2, . . . , an are positive real numbers such that
a1 . a2 . . . an=1,then (1+a1).(1+a2)...(1+an) 2 n
prove it!
1 an
1 an an
2
x .
1 a1 1 a 2 1 an
......... a1 a 2 ....a n
2 2 2
1
(1+a1) . (1+a2) . . . (1+an) 2n
n n 1 n n 1 n 1
Proof:
(333.3)2=( 55
....
544
45 )2-( 55
... ....
544
...
4 )
2
n 1 n 1 n 1 n
11
...1088
....
89
n 1 n 1
11
.....
11 10 n 1 8 11
1 9
.....
n 1 n 1
9 11
.....
11 10 n 1 80
n 1
9
9
10 n 1
1 10 n 1 80
9
9
2
10 2 n 2.10 n 1 10 n 1
9 3
100.Find 5 natural numbers a,b,c,d and e, whose sum is 100,and the least common multiple is
1992.Exclude the solutions which are obtained by a permutation of the numbers.
Solution:
a+b+c+d+e=100
GCD(a,b,c,d,e)=1992=23.3.83
So at least one of the numbers is divisible by 83.
If not ,it would be impossible 83 to appear a.
a prime multiple in G.C.D.
If two numbers are divisible by 83, then their sum will be grater than 100, which is not possible.
We can conclude that exactly one of the numbers is divisible by 83.Let it be the number a , i.e. a=83k
,then k has to be 1,otherwise a>83.It means a=83 b+c+d+e=17 and LCM (83,b,c,d,e)=23.3.83,
Hence at least one of the numbers b,c,d,e is divisible by 23=8 ,because otherwise 2 in the LCM would
appear at all.If two of the numbers b,c,d and e are divisible by 8,then their sum with a is grater than or
equal to 99.In that case for the remaining two numbers we would have that their sum is 1.Which is not
possible.
We can conclude that exactly one of the numbers b,c,d,e is divisible by 8.Let it be the number b.
i.e. b=8m .m has to be 1,otherwise a+b 99,and b+c+d 1,which is not possible.Hence b=8.
c+d+e=9 and LCM (83,8,d,c,e)=23.3.83.
Hence at least one of the numbers d,c,e is divisible by 3.Let c=3.n.
The number n can be 1 or 2.
If n=1 i.e. c=3 then d+e=6 d and e can have the folloving possible divisors 1,2,3 and 4
We obtain two solutions: d=e=3 and d=4 , e=2 i.e the problem has two solutions: ?!?
a=83 , b=8 , c=3 , d=4 , e=2 or
a=83 , b=8 , c=3 , d=3 , e=3
If n=2 i.e c=6 ,then d+e=3
Hence the problem has another solution:
a=83 , b=8 , c=6 , d=2 , e=1
Solution:
Let xyz be that number.
5.xyz xzy yzx zxy yxz zyx
5(100x+10y+z)=122x+212y+221z,
=> 7x=3y+4z
7x-7z=3y-3z
7(x-z)=3(y-z)
So 7|y-z , hence ;
(y,z) {(8,1),(1,8),(9,2),(2,9)}
and substituting these values in the equation we get x 4,5,6
So there are four three-digit numbers which satisfy the condition.
481,518,592,629
Solution:
25!=222.310.56.73.112.13.17.19.23
=106.216.310.73.11213.17.19.23
So 25! end with 6 zeros so z=0.
The number 25! Is divisible by 9, hence 9!|(61+x+y) i.e.
x+y=2 or x+y=11 . . (I)
25! Is divisible by 11 so
(34+x)-(27+y)=7+x-y is divisible by 11.
That is possible if x-y=4 or x-y=7 . . . (II) x+y=2 x+y=2 x+y=11
x+y=11
x-y=4 , x-y=-7 , x-y=4 , x-y=-7
Since x and y are digits only then x=2 , y=9 , z=0
Solution:
Let x be that four digit number,then x=a2+a3.The number has four digits if a {10,11, . . . ,21}
(8,922,23..are not possible)
x=a2 (a+1)=a. a.(a+1) is divisible by 7,hence a is divisible by 7 or at 1 is divisible by 7.
So a {13,14,20,21} ,and the four-digit numbers are
7/a so a=14,21 7/a+1 so a=13,20
x1=132+133=2366
x2=142+143=2940
x3=202+203=8400
x4=212+213=9702
Solution:
The last digit of 5m is 5 ; hence the last digit of 8m
has to be 6 because last digit is 1.We have
81=8 ; 82=64 , 83=512 , 84=4096 ,85 10 00 0
n=4 , so we have
5m+84 10,000
5m 5904
5 =5 , 52=25 , 53=125 , 54=625 , 55=3125
1
=(10 m
+5) .
10 m
1
1
9
x 1
=(x+5). 1
9
1
= (x2+4x+4)
9
1
=[ (x+2)]2
3
m1
1 100....02
n= (10m+2)= = 333
...
3
.4
3 3 1994
Solution:
n 2 abc.....z 1994=a+b+c++z
If the sum of the digits of the number n2 is equal to
1994 then it is not divisible by 3,hence the number
n is not divisible by 3.
The remainder upon the division by 3 is either 1 or
2,hence we can write n=3k+1 or n=3k+2.
The remainder upon the division of the squares of these
numbers by 3 is always equal to 1.
The remainder upon the division of the number 1994 by 3 is equal to 2.
We can conclude that there is no such number n2 whose sum of digits is equal to 1994
Solution:
22n+1=m5-k5
=(m-k) (m4+m3k+m2k2+mk3+k4)
If 22n +1 is a prime number than m-k=1
Hence m=k+1 , i . e
22n=-1+(k+1)5-k5
=5(k4+2k3+2k2+k).
According to this 22n is divisible by 5 wich is a
contradiction.
Solution:
If n=2k+1 , k {0,1,2,3 . . . }
33n+23n=27n+8n=272k+1+82k+1
2 k 1
=(27+8) ( 27
2k
27
...
.8 2k
8 )
A
=35.A
Hence 33n+23n is divisible by 35.
If n=2k , k {0,1,2,3...} then ,
33n-23n=36k-264=729k-64k
k 1 k 2 k 1
729
(729-64) ( 729 .64 ...
64
)
B
=35.19.B
so 33n-33n is divisible by 35 if n=2k
Solution:
a) a(a2n-1) = a(an-1) (an+1)
=a(a-1) (a+1) (an-1+an-2++1) (an -1-an-2++1)
So the result is divisible by the consecutive three
natural numbers which is divisible by 6.
b)The difference
S-S1=a1(a12n-1)+a2(a2n2-1)++am(am2n-1)
is divisible by 6,because of a).
ii-The remainder upon the division of the square of an integer by 3 can be either 0 or 1.If both of the
numbers a and b are not divisible by 3,then a2+b2 2 mod 3,
c2 0 or 1 mod 3, which is a contradiction with a2+b2=c2.according to this at least one of the numbers a or
b is divisible by 3.
iii-If an integer is divisible by 5, then the square is also divisible by 5.If an integer is not divisible by
5,then the remainders upon the division of its square by 5 can be 1 or 4.If all of the numbers a,b and c are
not divisible by 5,then a2+b2 0 ,2 or 3 mod 5, c2 0 or 1 mod 5 which is not possible since a2+b2=c2
We can conclude that at least one of the numbers a ,b and c are divisible by 5.