Documenti di Didattica
Documenti di Professioni
Documenti di Cultura
1
Theory of Numbers
Natural Numbers
The numbers 1, 2, 3, , which are used in counting are called natural numbers or positive integers.
1. x + y is a natural number i.e., the sum of two natural number is again a natural number.
2. Commutative law of addition x + y = y + x
3. Associative law of addition x + ( y + z ) = ( x + y ) + z
4. x y is a natural number i.e., product of two natural numbers is a natural number.
5. Commutative law of multiplication x y = y x
6. Associative law of multiplication x ( y z ) = ( x y ) z
7. Existence of multiplicative identity a 1 = a
8. Distributive law x ( y + z ) = xy + xz
Divisibility of Integers
An integer x 0 divides y, if there exists an integer a such that y = ax and thus we write as x | y (x divides y).
If x does not divides y, we write as x \| y (x does not divides y )
[This can also be stated as y is divisible by x or x is a divisor of y or y is a multiple of x].
Properties of Divisibility
1. x | y and y | z x | z
2. x | y and x | z x | (ky lz ) for all k , l z. z = set of all integers.
3. x | y and y | x x = y
4. x | y, where x > 0, y > 0 x y
5. x | y x | yz for any integer z.
6. x | y iff nx | ny, where n 0.
Test of Divisibility
Divisibility by certain special numbers can be determined without actually carrying out the process of
division. The following theorem summarizes the result :
A positive integer N is divisible by
2 if and only if the last digit (unit's digit) is even.
4 if and only if the number formed by last two digits is divisible by 4.
8 if and only if the number formed by the last three digits is divisible by 8.
3 if and only if the sum of all the digits is divisible by 3.
9 if and only if the sum of all the digits is divisible by 9.
5 if and only if the last digit is either 0 or 5.
25 if and only if the number formed by the last two digits is divisible by 25.
125 if and only if the number formed by the last three digits is divisible by 125.
11 if and only if the difference between the sum of digits in the odd places (starting from right) and
sum of the digits in the even places (starting from the right) is a multiple of 11.
Division Algorithm
For any two natural numbers a and b, there exists unique numbers q and r called respectively quotient
and remainder, a = bq + r , where 0 r < b.
Common Divisor
If a number c divides any two numbers a and b i.e., if c | a and c | b, then c is known as a common divisor
of a and b.
Properties of GCD
1. If ( b , c ) = g and d is a common divisor of b and c, then d is a divisor of g.
2. For any m > 0, (mb , mc ) = m (b , c )
b c 1
, = (b , c )
d d d
4. If ( b , c ) = g, then
Theory of Numbers
a = 6, b = 21, c = 10
For example
Note The representation in 5th property is not unique. In fact we can represent (a, b ) as xa + yb in infinite
number of ways where x , y Z
Z = set of all integers.
In above example, 252 is LCM of 18 and 28.
252 = 9.28
252 = 1418
.
(18, 28) = 2 . 28 + ( 3) 18
= 2.28 + 252K + ( 3)18 252K
= ( 2 + 9K )28 + ( 3 14K )18
where K is any integer.
Unit
1 is called unit in the set of positive integers.
Prime
A positive integer P is said to be prime, if
(i) P > 1
(ii) P has no divisors except 1 and P i.e., A number which has exactly two different factors, itself and
one, is called a prime number.
Thus, 2, 3, 5, 7, 11, ... are primes. 2 is the only even number which is prime. All other primes
being odd.
But the converse is not true i.e., every odd number need not be prime.
Composite
Every number (greater than one) which is not prime is called composite number. i.e., a number which has
more than two different factors is called composite. For example 18 is a composite number because 2, 3,
6, 9 are divisors of 18 other than 1 and 18.
We can also define a composite number as : A natural number n is said to be composite, if there exists
integers l and m such that n = lm, where 1 < l < n and l < m < n.
Remark
l
A prime number P can be written as a product only in one way namely P.1 .
A composite number n can also be written as n.1. But composite number can be written in one more way
also as mentioned above.
A composite number has at least three factors.
Twin Primes
A pair of numbers is said to be twin primes, if they differ by 2.
e.g., 3, 5 are twin primes.
Perfect Number
A number n is said to be perfect if the sum of all divisors of n (including n) is equal to 2n.
For example 28 is a perfect number because divisors of 28 are 1, 2, 4, 7, 14, 28.
Sum of divisors of n (= 28) = 1 + 2 + 4 + 7 + 14 + 28 = 56 = 2n
Coprime Integers
Two numbers a and b are said to be coprime, if 1 is only common divisors of a and b.
i.e., if GCD of a and b = 1 i.e., if (a , b ) = 1
e.g., (4, 5) = 1, (8, 9) = 1.
Theorem 1
Proof
If a = qb + r , then (a , b ) = (b , r ).
Let (a , b ) = d and (b , r ) = e
(a , b ) = d
d | a and d | qb
i.e.,
d | a and d | b
d | (a qb)
[Qa qb = r ]
d |r
d |e
(b, r) = e
Again Q
e |b
e|bq + r
and
e |r
i.e.,
e
e
and
bq
r
e|a
[Qa = bq + r ]
e|d
(a , b ) = (b , r )
Remark
The above result can also be stated as :
GCD of a and b is same as GCD of b and r, where r is remainder obtained on dividing a by b.
Corollary
If (a , b ) = 1, then (b , r ) = (a , b ) = 1
Theory of Numbers
Theorem 2 If d is the greatest common divisor of a and b, then there exists integers x and y such that
d = xa + yb and d is the least positive value of xa + yb.
Proof
Case I By successive application of division algorithm to numbers a and b.
Let r1 , r2 , K , rn be successive remainders.
Therefore,
(Dividing a by b)
(Dividing b by remainder r1 )
(Dividing r1 by remainder r2 )
M
M
M
rn
= rn
rn
= rn qn
1qn
+1
+ rn , 0 < rn < rn
+ rn
0 < rn
+ 1,
+1
< rn
Since r1 > r2 > K is a set of decreasing integers, this process must terminate after a finite number of step.
i.e., remainder must be zero after some stage.
So let
+1
= 0 rn
rn | rn
(rn
rn
= rn qn
+1
+ 0 = rn qn
Now,
+1
1 , rn ) = rn
(i)
or
where x n = x and yn = y
i.e., GCD of a and b = rn can be expressed as (a , b ) = d = ax + by
(a , b ) = d
Case II
Corollary
(ii)
If a and b are coprime integers i.e., if (a , b ) = 1, then there exists integers x and y such that
ax + by = 1
a b
d d
Solution
Q (a, b ) = d
d | a and d | b [By definition of GCD].
There exists integers a1and b1 such that a = da1
b = db1
Again Q
(a, b ) = d
(i)
(ii)
[By Theorem 2]
or
(a1, b1) = 1
a b
, =1
d d
or
d
d
Remark
(a, b ) = d and a = a1d , b = b1d , then a1 and b1 are coprime i.e., (a1, b1) = 1
Q a|bc
There exists an integer d such that bc = ad
(i)
(a, b ) = 1
(ii)
(iii)
a|c
Note If a|bc and (a, b ) = 1, then a|c. This result is also known as Gauss Theorem.
(n, n + 1) = d
d |n and d |n + 1
d |(n + 1) n or d |1
d =1
(n, n + 1) = 1
Let (a + b, a b ) = d
d | (a + b ) and d | (a b )
d | (a + b + a b ) and d | (a + b ) (a b )
or
d | 2a and d | 2b.
d | ( 2a, 2b )
Theory of Numbers
[Q(ma, mb ) = m (a, b )]
i.e.,
d | 2(a, b )
But
(a, b ) = 1
d = 1 or d = 2 .
d|2
Example 5 Find GCD of 858 and 325 and express it in the form m 858 + n 325.
Solution
(i)
(ii)
208 = 1171
. + 91
(iii)
117 = 911
. + 26
(iv)
91 = 26.3 + 13
(v)
d = 13 = 91 26.3
91 3(117 911
. ) = 91 3117
.
+ 3.91 = 4.91 3117
.
Example 6 If a and b are relatively prime, then any common divisor of ac and b is a divisor of c.
Solution
a and b are relatively prime
integers x and y such that
ax + by = 1
(i)
(ii)
(iii)
(iv)
or
d|c
Example 7 If a and b are any two odd primes, show that (a 2 b 2 ) is composite.
Solution
a 2 b 2 = (a b )(a + b )
Q a.0 and b are odd primes.
So, let a = 2k + 1
b = 2k + 1
a b = 2k + 1 2k 1 = 2k 2k = 2(k k ) is even
a + b = 2k + 1 + 2k + 1 = 2k + 2k + 2 = 2(k + k + 1) is even
(a 2 b 2 ) is composite.
Q a |c
There exists an integers d such that
c = ad
Q
(i)
b|c
(ii)
(iii)
Putting c = be from Eq. (ii) in acm and c = ad from Eq. (i) in bcn, Eq. (iii) becomes
abem + band = c
ab (em + dn ) = c
ab | c
a 2 b 2 = (a b )(a + b )
(i)
Q (a b ) is a prime number
2
[Qa b < a + b ]
Theory of Numbers
Q The only divisor of a prime number are 1 and itself.
Eq. (i) becomes a 2 b 2 = 1 (a + b )
or
a 2 b2 = a + b
e.g.,
32 22 = 5 (which is prime)
32 22 = 3 + 2, 3, 2 N.
Example 10 Prove that an integer is divisible by 9 if and only if the sum of its digits is divisible by 9.
Solution
Let a = an K a 3a 2a1 be an integer
[Note a is not the product of a1, a 2, a 3,, an but a1, a 2, a 3,,an are digits in the value of
a. For example 368 is not the product of 3, 6 and 8 rather 3, 6, 8 are digits in value
of 368
= 8 + 6 10 + 3 (10)2 ]
a = an a 3a 2a1
where
S = a1 + a 2 + a 3 + a 4 + K
(i)
9 | (a S )
(ii)
Case I a is divisible by 9
i.e.,
9 |a
9 | [a (a S )]
i.e.,
(iii)
[From Eqs. (ii) and (iii)]
9|S
(iv)
9|a
Theorem 3
Proof Let
(i)
10
Pn
Multiplying both sides by n
+1
= (n + 1)(n + 2)K (n + r )
nPn
+1
= n (n + 1)(n + 2) K (n + r )
+1
= (n + r )Pn
= n (n + 1)(n + 2) K (n + r 1)(n + r )
nPn
= nPn + rPn
+ 1 Pn ) = r Pn
P
Pn + 1 Pn = r n
n
n (n + 1)(n + 2) K (n + r 1)
=r
n
or
n (Pn
or
or
Pn
+1
Pn = r (n + 1)(n + 2) K (n + r 1)
or
Pn
+1
Pn = r
[Using value of Pn ]
(i)
+1
Pn = rk (r 1)! = kr (r 1) ! = k (r )!
i.e.,
r ! | (Pn
+1
Pn ), n
Put
n =1
r !| (P2 P1 )
But P1 = 1 2 3 K r = r ! is divisible by r !
i.e.,
Put n = 2,
But r !| P2
i.e.,
[By assumption]
P = k (r 1)!
r1 !| P1
r !| (P2 P1 ) + P1 i.e., r !| P2
r !| (P3 P2 )
r !| (P3 P2 ) + P2
r !| P3 and so on.
Corollary
Cr is an integer
n
Cr =
n (n 1)(n 2) K (n r + 1)(n r )!
n!
=
r !(n r )!
r!
(n r )!
n (n 1)(n 2) K (n r + 1)
r!
Note
Therefore the product of two consecutive integers is divisible by 2! = 2 ; the product of any three
consecutive integers is divisible by 3 = 6! and so on.
11
Theory of Numbers
Example 1
Prove that product of two odd numbers of the form 4n + 1 is of the form ( 4n + 1) .
Solution
Let a = 4k + 1, b = 4k + 1
be two numbers of the form ( 4n + 1)
ab = ( 4k + 1)( 4k + 1)
= 16kk + 4k + 4k + 1
= 4( 4kk + k + k ) + 1 = 4l + 1
(where l = 4kk + k + k )
Which is in form ( 4n + 1) .
Example 2
Solution
m(m + 1) = 2j
n 2 = 4( 2j ) + 1 = 8j + 1
Example 3(a) Show that sum of an integer and its square is even.
Solution
Let n be any integer.
So, we have to prove that n 2 + n is even.
n 2 + n = n(n + 1) which is product of two consecutive numbers n and n + 1 and
hence divisible by 2! = 2
Hence, n 2 + n is an even number.
12
Example 5
Solution
Example 6
Solution
Q 4x y is a multiple of 3.
4x y = 3m
y = 4x 3m
n (n + 1) ( 2n + 1) = n (n + 1) [(n + 2) + (n 1)]
= n (n + 1) (n + 2) + n (n + 1) (n 1)
= n (n + 1) (n + 2) + (n 1) n (n + 1)
Each of the two (n 1) n (n + 1) and (n + 2) (n + 1) n being the product of three
consecutive integers is divisible by 3! = 6
n (n + 1) ( 2n + 1) is also divisible by 6.
Example 8
Solution
Q m is an integer.
Either m is even or m is odd.
Case I m is even
So let
m = 2k
13
Theory of Numbers
m 2 + 2 = ( 2k )2 + 2 = 4k 2 + 2 = 2 ( 2k 2 + 1)
= (2 an odd integer)
Case II m is odd
Let
m = 2k + 1
m 2 + 2 = ( 2k + 1)2 + 2 = 4k 2 + 1 + 4k + 2
= ( 2 + 4k + 4k 2 ) + 1.
8n 3n = ( 8 3)( 8n 1 + 8n 2 . 3 + K + 3n 1)
or 8n 3n = 5 ( 8n 1 + 8n 2.3 K + 3n 1)
8n 3n is divisible by 5.
p is composite. (Q p > 1)
2p 1 = 2mn 1 = ( 2m )n 1n
2p 1 is composite.
p must be prime.
Remark
l
But converse is not true i.e., when p is prime, 2p 1 need not be prime.
For example, p = 11 is prime but 211 1 is divisible by 23 and hence is not prime.
Theorem 4
Proof
b = 2 35Kq
let
a =b + 1
Surely,
a 1
(i)
(ii)
(Qa = b + 1 > 1)
14
p |b
Now
p | a and p | b
(Qb = 235
. . K q)
p |a b
or p |1
p =1
(which is impossible)
Theorem 5 Fundamental Theorem of Arithmetic each natural number greater than 1 can be
expressed as a product of primes in one and only one way (except for the order of the factors).
Example 1 Every natural number other than 1 admits of a prime factor.
Solution
Suppose that n 1 is a natural number.
If n itself is a prime number, the example is proved in as much as the prime number
n is a factor of itself.
If n is composite, then n must have factors other than 1 and n.
Let l be the least of these factors of n other than 1 and n.
1 < l < n and l | n
i.e.,
l >1
l1| l but l | n
l is a prime factor of n.
Example 2 Show that every odd prime can be put either in the form 4k + 1 or 4k + 3 (i.e., 4k 1),
where k is a positive integer.
Solution
15
Theory of Numbers
An odd prime n is either of the form
4k + 1 or 4k + 3.
4k + 3 = 4(k + 1) 4 + 3 = 4k 1
But
(where k = k + 1)
Example 3 Show that there are infinitely many primes of the form 4n + 3.
Solution
b = 4a 1
b >1
(i)
[Qa 3, b = 4a 1, b 11]
i.e.,
(ii)
p|4a
p | ( 4a b )
p |1
Which is impossible
Theorem 6
Proof Let n be any composite number, let d (n ) denote the number of divisors of composite number n
by Fundamental Theorem of Arithmetic. n can be expressed as the product of the powers of primes.
16
Qp1 is a prime number, therefore, the only divisors of p1 1 are 1, p1, p12 , p13 , K , p1 1
(1 i k ) is a divisor of n]
[Q Every divisor of pi
i.e., d (n ) = (1 + 1)( 2 + 1)( k + 1).
Note
Theorem 7
The sum of the divisors of any composite number n is denoted by (n ) which is equal to
p2 + 1 1
k + 1 1
K pk
2
.
p2 1
pk 1
p 1 + 1 1
1
p1 1
Proof Let n be any composite number and let (n ) is sum of positive divisors of n. By Fundamental
Theorem of Arithmetic n can be expressed as the product of the powers of primes.
n = p1 1 . p 2 2 K p k k
1 [ p1 + 1 1]
p 1
a (r n 1)
Sum of divisors of p k k =
(pk k
+1
(p2 2
+1
1)
p2 1
1)
pk 1
+1
+1
+1
(p k
1) ( p 2 2
1)
1)
.
K k
.
( p 2 1)
( p k 1)
( p1 1)
( p1 1
[QEvery divisor of pi
(1 i k ) is divisor of n]
17
Theory of Numbers
Note
k ( m + 1)
( p1k (1 + 1) 1) ( pk2 ( 2 + 1) 1) ( pm
1)
K
k
k
k
( p1 1)
( p2 1)
( pm 1)
23(2 + 1) 1 33(1 + 1) 1
= 2044
23 1
33 1
=q
b
a
is the quotient in the division of a by b.
i.e.,
b
1 i x
(3) [x + m ] = [x ] + m , If m is an integer.
(4) [x ] + [y ] [x + y ] [x ] + [y ] + 1
(5) [x ] + [x ] = 0, If x is an integer = 1 otherwise.
18
[x ]
x
(6) = , if m is a positive integer.
m
(8) [x + 05
. ] is the nearest integer to x.
If x is midway between two integers, [x + 05
. ] represents the larger of the two integers.
(9) The number of positive integers less than or equal to n and divisible by m is given by
n
.
m
Theorem 1
Proof
[a ]
a
If a is real number, c is natural number, then =
c c
a = n + r, 0 r < 1
Let
[a ] = n = m
c c
n
= m + s,
c
n = mc + cs,
Now,
[a ]
n
LHS = = = m
c c
where 0 s < 1
where 0 cs < c
n + r
a
RHS = =
c c
Putting the value of n from Eq. (ii).
mc + cs + r
=
c
cs + r
= m +
c
cs + r < c
cs + r
<1
c
(i)
cs + r
RHS = m +
=m
LHS = RHS.
(ii)
19
Theory of Numbers
Theorem 2
Proof
Since
1 1+y
<1
2
2
x + x + 1 = [x ]
2 2
x = m , x + 1 = (2m + 2) + y = m + 1
2
2
2
[x ] = 2m + 1
x + x + 1 = [x ]
2 2
n
p3 +
n
p4 +
n
p5 +
n
p6 +
n
p7
20
Theorem 3
Proof
n + 1 2n
n
If n and k are positive integers and k is greater than 1, then +
k k k
Then,
n + 1
n
2n
(i) r < k 1, then = q ,
= q , 2q
k
k
k
The desired result is immediate.
(ii) r = k 1, then
n = q , n + 1 = q + 1,
k
k
2n = 2q + 2(k 1) = 2q + 1
k
k
n + n + 1 = 2n
k k k
Theorem 4
Proof
We know that,
x + 1
x
[x ] = +
2 2
n n n n
, , ,
,K
2 4 8 16
n + 1
n
[n ] = +
2 2
n = n + (n / 2) + 1
2 4
2
n = n + (n / 4) + 1
2
4 8
n = n + (n / 8) + 1
8 16
2
n
n
n
Adding corresponding sides and cancelling out the terms , , , from both sides, we have
2 4 8
n + 1 n + 2 n + 4
n=
+
+
+K
2 4 8
[n ] = n
21
Theory of Numbers
Theorem 5
n
n
Proof
x + n 1 = [nx ]
Now,
Also, y +
k
k
= [x ] + y +
n
n
p 1+ k
p+k
k
lies between
and
n
n
n
p 1+ k
< 1,
n
So long as
k < n (p 1)
k
y + is less than 1 and consequently
n
x + k = [x ]
i.e.,
x + k = [x ] for k = 0, 1, , n p
i.e.,
k
But x + = [x ] + 1, for k = n p + 1,, n 1
n
n 1
1
[x ] + x + + K + x +
n
n
= [x ] + K + [x ](n p + 1 times) + ([x ] + 1) + ([x ] + 1) + K ( p 1) times
= n[x ] + ( p 1)
Also,
Since
p 1 ny < p
(i)
(ii)
n
n
n
Theorem 6
Proof
Let k (n !)denote the highest power of p contained in n !n ! is the product of the factors 1, 2, 3, , n.
n
n
k (n !) = + k !
p
p
(i)
22
Changing n to
n
in Eq. (i)
p
n
k
p
n
n
! = 2 + k 2 !
p
p
(ii)
n n n
k (n !) = + 2 + 3 + K
p p p
Congruences
If a and b are two integers and m is a positive integer, then a is said to be congruent to b modulo m, if m
divides a b denoted by m | (a b ).
In notation form we express it as a b mod m or a b 0 mod m.
Note
Theorem 7
(Q 4 | (13 1) = 12)
(Q 5 | ( 4 ( 1)) = 5)
(Q 4|12)
(Q 5 | (17 3))
If a b mod m, then
(i) a + c = b + c mod m
(ii) ac bc mod m, where c is any integer.
Proof
(i) Qa b mod m
m | (a b)
m | {(a + c ) (b + c )}
a + c b + c mod m
[Qa + c ( b + c ) = a b ]
(ii)Qa b mod m
Note
m | (a b )
m | c (a b )
m | (ac bc )
ac bc mod m
23
Theory of Numbers
Theorem 8
Proof
(iii) ac bd mod m
m | (a b ) and m| (c d )
m | ((a b ) + (c d ))
or
m | ((a + c ) (b + d ))
a + c b + d mod m
m | (a b ) and m | (c d )
m | (a b ) (c d ) or m | (a c ) (b d )
a c b d mod m
or
Corollary
a b mod m
Multiplying the two congruence a 2 b 2 mod m
Theorem 9
Proof
m | (a b ) or
b a mod m
m | (b a )
m | ( a b ) and m | (b c )
m | ( a b ) + (b c ) or m | ( a c )
a c mod m
24
Theorem 10
Proof
We know that,
a k b k = (a b )(a k 1 + a k 2b + a k 3b 2 + K + b k 1 )
(i)
But a b mod m m | (a b )
There exists an integer t such that
a b = mt
(ii)
m| (a k b k )
a k b k mod m
Theorem 11
+ p 2x n
+ K +pn
1x
+ pn is an integral
Proof
Q f ( x ) = p 0x n + p1x n
+ p 2x n
+ K + pn
1 x
+ pn
Putting x = a
f ( a ) = p 0an + p1an
+ p 2an
+ K + pn
1 a
+ pn
(i)
Putting x = b
f (b ) = p 0bn + p1bn
+ p 2bn
+ K + pn
1b
+ pn
(ii)
n 2
+a
n 3
n 1
+a
) + K + pn
n 2
b + K+ b
f (a ) f (b ) = (a b )[p 0 (an
bn
+ an
b + K+ b
n 2
n 1
) + K + pn
b + K + bn
b)
)+
1 (a
2
1 (a
b)
) + p1 (an
+ an
b + K + bn
+ K + pn
1]
(iii)
= (a b ) t (say)
But a b mod m (given)
m| (a b )
an integer k such that a b = mk
Putting this value of a b = mk in Eq. (iii)
f (a ) f (b ) = mkt
m |f (a ) f (b )
f (a ) f (b ) mod m
Theorem 12
Fermat Theorem
If p is prime, then
(a + b ) p = (a p + b p ) mod p.
Proof
or
p 1
(a + b ) p = (ap + bp ) +
r =1
Cr ap r br
(i)
25
Theory of Numbers
p
Now,
Cr =
p!
;
r !(p r )!
1 r (p 1)
But p ! = 123
. . p is divisible by p
p is coprime to r !
p is coprime to 1, 2, 3, r
Q
p is co prime to their product = r !
Also for the same reason p is coprime to (p r )!
p!
p
is divisible by p.
Cr =
r !(p r )!
an integer k r such that
Cr = pk r
(a + b )p (ap + bp ) = p kr ap r br
r =1
which is divisible by p.
(a + b )p (ap + bp ) mod p
Generalization
If p is a prime number, prove that
(a1 + a 2 + a3 + K + an ) p
(a1p + ap2 + a3p + K + anp ) mod p
(a1 + a 2 + a3 + K + an ) p = (a1 + b1 ) p
b1 = a 2 + a3 + K + an
where
where
continuing like this, we get
Theorem 13
Proof
We know that,
(a1 + a 2 + a3 + K + an ) p (a1p + ap2 + a3p K + anp ) mod p
Putting
a1 = a 2 = a3 = K = an = 1 in Eq. (i)
(1 + 1 + 1 + K + 1) p
(1p + 1p + 1p + K + 1p ) mod p
n (1 + 1 + 1 + K + 1) mod p
p
or
Replacing n by a.
ap = a mod p
(i)
26
Theorem 14
Proof
As p is prime.
ap = a mod p
p 1
1 mod p.
Theorem 15
Proof
[a is coprime to p]
2 n
Cn
n
22
+ (1)n
1 n
Cn
1) x
+ n C2e (n
e = 1 +
We know that
2) x
K + n Cn
n 2 2x
e
2 (1)
+ n Cn
n 1 x
e
1 (1)
+ (1)n
(i)
2 3
+
+
+K
1! 2! 3!
x
x 2 x3
xn
1 +
+
+
+ K+
+ K 1
!
!
!
!
n
1
2
3
[(n 1)x ]n
(n 1)x [(n 1)x ]2
nx
(nx )2
(nx )n
= 1 +
+
+ K+
+ K n C1 1 +
+ K
+
+ K+
n!
1!
2!
n!
1!
2!
[(n 2) x ]n
(n 2) x [(n 2) x ]2
+ K
+ n C2 1 +
+
+K +
n!
1!
2!
+ K + n Cn
+ (1)n
Comparing coefficient of x
n 2
1
2 (1)
1n
Cn
1
1
(2x )n
2x
(2x )2
+ K
+
+K+
n
1!
2!
x
x2
xn
+
+ K+
+ K + (1)n
1! 2!
n!
on both sides
(n 2)n
nn n (n 1)n
1=
C1
+ n C2
K+
n!
n!
n!
(1)n 1 n Cn 1
2n
(1)n 2 n Cn 2
+
n!
n!
2 n
Cn
n
22
+ (1)n
1 n
Cn
Theorem 16
Wilson Theorem
If p is prime, then (p 1)! + 1 0 mod p
Proof
Case I when p = 2
(2 1)! + 1 0 mod 2
1 ! + 1 0 mod 2
2 0 mod 2
which is true
Wilson theorem is true for p = 2 .
27
Theory of Numbers
Case II If p is an odd prime.
n ! = nn n C1 (n 1)n + n C2 (n 2)n ... + (1)n
2 n
Cn
n
22
+ (1) n
1 n
Cn
p 1
C1 ( p 2) p 1
p 1
C2 ( p 3) p 1 + .. + (1) p 3
p 1
Cp 32p 1 + (1) p 2
p 1
Cp 2
(i)
Q p is prime.
p is coprime to all numbers < p.
i.e., p is coprime to p 1, p 2, p 3, 2, 1.
Putting a = p 1, p 2, p 3, 2 in Fermat Theorem
ap 1 mod p
( p 1) p 1 1 mod p
( p 1) p 1 1 = M(p)
or
( p 1) p 1 = M ( p ) + 1
( p 2) p 1 = M ( p ) + 1
Similarly,
( p 3) p 1 = M ( p ) + 1
2p 1 = M ( p ) + 1
Putting these values of ( p 1) p 1 , ( p 2) p 1, , 2p 1 in Eq. (i).
( p 1)! = [M ( p ) + 1]
p 1
C1[M ( p ) + 1] +
p 1
or
( p 1)! = M ( p ) + 1
p 1
C1 +
p 1
C2 K + (1) p 3
p 1
Cp 3 + (1) p 2 p 1Cp 2
p 1
C1 +
p 1
C2
p 1
C3 + K + (1) p 3 p 3Cp 3
+ (1) p 2 p 1Cp 2 + (1) p 1 ] (1) p 1
( p 1)! = M ( p ) + (1 1) p 1 (1) p 1
( p 1)! = M ( p ) + 0 (1) p 1 = M ( p ) 1
Qp is odd. p 1 is even.
(1) p 1 = 1
or
( p 1)! + 1 is divisible by p.
( p 1)! + 1 = M ( p )
( p 1)! + 1 0 mod p.
Theorem 17
Proof
28
Now,
p1 is one of the factors in the value of ( p 1)! and therefore p1 divides ( p 1)! .
p = p1p 2
p1 | p
Also
But
(i)
(ii)
( p 1)! + 1 0 mod p
p | ( p 1)! + 1
(iii)
p1 | ( p 1)! + 1
(iv)
p1 | 1
Eulers Function
Definition : The number of integers n and coprime to n is called Euler's function for n and is denoted by
(n ).
Examples
(1) = 1
[Q1 is the only integer 1 and coprime to 1].
( 2) = 1
[Q1 is the only integer < 2 and coprime to 2].
(8) = 4
[Q1, 3, 5, 7 are the only four integers < 8 and coprime to 8].
Remark
l
If p is a prime number, then 1, 2, 3, ( p 1) are all less than p and coprime to p and are ( p 1) in total.
( p) = p 1
Theorem 18
1
1
1
Prove that (n ) = n 1 1
K 1
where p1 , p 2 , ... , pr are distinct prime
p1
p2
pr
factors of n.
Proof
n = p1 1 . p 2 2 K prkr
k
[Qp1 , p 2 , K , pr are distinct primes and hence are coprime to each other and (ab ) = (a ) (b ), if a and b are
coprime to each other.]
1
1 k
1
k
= p1 1 1 p 2 2 1
K prkr 1
pr
p1
p2
1
1
1
k
k
= p1 1 . p 2 2 K prkr 1 1
K 1
p
p
p
r
1
2
1
1
1
= n 1 1
K 1
p1
p2
pr
[Qn = p1 1 . p 2 2 K prkr ]
29
Theory of Numbers
Theorem 19
Proof
1
Prove that ( p k ) = p k 1 , where p is prime.
Number of integers from 1 to p k which are not coprime to p k are p.1, p.2, p.3, p. p k 1.
Remark
If a and b are coprime to each other, then (ab ) = (a ) (b ).
Example 1 Find the number of positive integers 3600 that coprime to 3600.
Solution
n = 3600 = 24 32 52
(n ) = ( 3600) = ( 24 32 52 )
1
1
1
1
1
1
= n 1 1 1 = 3600 1 1 1
2
3
5
p1
p2
p3
[Here p1 = 2, p2 = 3, p3 = 5]
1 2 4
= 3600
2 3 5
( 3600) = 960
Example 2
Solution
If (a, m ) = 1, then (m a, m ) = 1
Integers coprime to m occur in pairs of type a and m a .
(m ) is even.
If m > 2, (m ) is even.
(1) = 1
( 2) = 1
Only for m = 1, m = 2
(m ) is odd.
Concept
10n 1 10n 1
Let a =
=
10 1
9
10n 1
in terms of perfect square.
9
a=
10n 1
9a = 10n 1
9
9a + 1 = 10n
Let
b = 9a + 1
c = 8a + 1
30
Concept Prove that every number of the sequence 49, 4489, 44489, 4448889 is a perfect square.
If there are n fours and (n 1) eight and one 9.
Let us denote 444889 as 43829.
Consider 667 written as 627
We know 444889 = (667)2.
We develop (6nm
2
17)
= 4n 8n
19
2
17)
6(10n 1)
=
+
9
. 2n
410
6 10n + 3
2 . 10n + 1
1 =
=
9
9
. n + 1 40n 140n 1 + 1
+ 410
= 4n 8n 19
=
9
9
Example 1 Let n be the natural number. If 2n + 1 and 3n + 1 are perfect square. Then prove that n
is divided by 40.
Solution
2n + 1 = x 2
(i)
and
3n + 1 = y 2
(ii)
x 2 is odd.
x is odd.
Let
x = 2a + 1
( 2n + 1) = ( 2a + 1)2
2n + 1 = 4a 2 + 4a + 1
n = 2a 2 + a
n is even.
If n is even 3n + 1 is odd
Let
y 2 is odd y is odd
y = 2b + 1
(iii)
31
Theory of Numbers
n = ( 2b + 1)2 ( 2a + 1)2
n is divisible by 8.
(iv)
3x 2 ends with 3, 5 or 4, 7
2y 2 ends with 2, 0, 8
n = y2 x2
=0
It is divisible by 5.
Example 2 Prove that there are infinitely many squares in the sequence 1, 3, 6, 10, 15, 21, 28,
Solution
Suppose Tn is a square
n(n + 1)
2
n(n + 1)
Tn =
2
If it is a square then Tn = (m )2
n(n + 1)
= (m )2
2
n(n + 1) = 2(m )2
T4n (n + 1) =
T8 = 36 is a perfect square.
T288 is also a perfect square.
If N = 123 34 52
Then,
N = 26 37 52
32
Suppose 172 | n 2 3n 19
Since n 2 3n 19 = (n + 7)(n 10) + 51
17| (n + 7)(n 10);
i.e., n 2 =
n ( 0, 1, 8)
Hence,
Solution
3|3c 32 | 3c
Also
5 | 5c 5 |5c 5 | c
(Q 3c is a square)
(Q 5c is a cube)
Solution
Let = 11 + 11 11a 2 + 1
Then,
( 11)2 = 112(11a 2 + 1)
Simplifying, we get
( 22) = 113a 2
r
Putting | a | = , r , s N such that (r , s ) = 1 gives ( 22)s 2 = 113r 2.
s
Since 112| s because otherwise 11 would divide r,11|. Writing 11 = , we get
( 2)s 2 = 11r 2
Since 11| s for otherwise we would have 11|r. It follows that s = 1. Thus we have
( 2) = 11r 2. Since 2 and are consecutive odd integers they are relatively
prime.
If 11| 2, then is a square of form 11n + 2 which is not possible.
11| and hence = 11n 2 for some n N.
Thus, we have = 11 = 112n 2
33
Theory of Numbers
Example 8 Determine all pairs of positive integers (m, n ) for which 2m + 3n is a perfect square.
Solution
Let
2m + 3n = k 2
Since
( 1)m 2m k 2 1 (mod 3)
(Q 3 | k )
Now,
k 2 = 1 and k + 2 = 3n 2p + 1 + 1 = 3n
p
( 3q 1)( 3q + 1) = 2p + 1 3q 1 = 2
3q = 3 q = 1 and hence p = 2
So, we have only one solution (4, 2).
1
( 19
2
4m 2 7 )
4m 2 7 is a square i.e., 4m 2 7 = p 2
Where p N
( 2m p )( 2m + p ) = 7
Hence,
n 2 + 19n + 88 = 0
(n + 8)(n + 11) = 0
n = 8 or 11
i.e.,
= 97 and = 4
n = 2 + = 198
Example 11 Find the number of values of n for which 211 + 28 + 2n is a perfect square.
Solution
28 9 + 2n
2n ( 28n 9 + 1)
34
Example 13 Give with justification, a natural number n for which 39 + 312 + 315 + 3n is a perfect
cube .
Solution
35
Theory of Numbers
Showing that x + 3 does not divide
x p 1 3 x p 2 + 3 2 x p 3 + K + ( 3 )p 1
Consequently ( x + 3)2 does not divide x p + 3p. So, ( 2 + 3)2 does not divide
Since 2p + 3p is a multiple of 5 but is not a multiple of 52.
2p + 3p .
it cannot be a perfect power.
Example 15 A 4 digit number has the following properties (I) It is a perfect square (II) its first 2 digit
are equal to each other (III) its last two digit are equal to each other.Find all such four
digit number.
Solution
We want to find positive integers x and y such that1 x 9,0 y 9 and xxyy is a
perfect square. Since,102 = 100, 1002 = 10000. It follows that xxyy must be the square
of a 2 digit number. Suppose that (ab )2 = xxyy .
The number xxyy is clearly a multiple of 11.
Since, it is a perfect square it must be a multiple of 112 i.e., 121.
It must be of the form
121 1, 121 4, 121 9, 121 16, 121 25,
121 36,121 49,121 64,121 81
Out of these 121 64 i.e., 7744 is of the form xxyy, we conclude that 7744 is the
desired number.
Example 16 Show that for any integer n, the number n 4 20n 2 + 4 is not a prime number.
Solution
n 4 20n 2 + 4 = (n 4 4n 2 + 4) 16n 2
= (n 2 2)2 16n 2
= (n 2 4n 2)(n 2 + 4n 2)
(i)
Note It can be easily seen that none of the factors n 2 4n 2 ,n 2 + 4n 2 can have the value 1,
whatever integral value n may have. Here four cases arises.
4 28
(i) n 2 4n 2 = 1 n =
2
4 20
2
(ii) n 4n 2 = 1 n =
2
4 28
2
(iii) n + 4n 2 = 1 n =
2
4 20
2
(iv) n + 4n 2 = 1 n =
2
From the above four cases, we find that whatever integral value n may have, n 4 20n 2 + 4 is the
product of the integers n 2 4n 2 and n 2 + 4n 2 neither of which equals 1..
Example 17 Prove that the product of four consecutive natural numbers cannot be a perfect cube.
Solution
Consider the product
P = n (n + 1) (n + 2)(n + 3), where n is a natural number.
If possible, that P is a perfect cube = k 3 Two cases arises.
36
As n(n + 1)(n + 3) and (n + 2)3 are relatively prime, so second possibility ruled out.
Also n(n + 1)(n + 3) = (n + 1)3 n = 1. Since P = 24, when n = 1 which is not a perfect
cube. So the possibility n = 1 is also ruled out. So n cannot odd.
Case II If n is even.
Then n + 1 is prime to n, n + 2 and n + 3. Consequently n + 1 is relatively prime to
n(n + 2)(n + 3). Since the product of relatively prime numbers n + 1 and
n(n + 2)(n + 3) is a perfect cube, each of them must be a perfect cube.
n 3 < n(n + 2)(n + 3) < (n + 3)3
Example 18 Find all primes p for which the quotient ( 2p 1 1)| p is a square.
Solution
(in some order) p and q are relatively prime and pq = n; Since the product of 2
consecutive integer is even.
m(m + 1) is even, which means that one of the numbers m, m + 1 must be even.
Suppose m = q 2 (so that m + 1 = 7p 2 ). Since every square number is of one of the
forms 4k , 4k + 1. Consequently m + 1 must be of one of the forms 4k + 1, 4k + 2.
However this is not possible for if p is even, then 7p 2 is of the form 4k. If p is odd,
then 7p 2 is of the form 4k + 3.
m + 1 7p 2. So m = 7p 2 and m + 1 = q 2
( 2n + 1)2 1 mod 4
Now, if
(a) x and y are both even then,
x 2 + y 2 0 mod 4
(b) x and y are both odd then,
x 2 + y 2 2 mod 4
37
Theory of Numbers
(c) one is even and other is odd then,
x 2 + y 2 1 mod 4
/ 3 and 4}
{x 2 + y 2 0, 1, 2 mod 4 and x 2 + y 2
x 4 + y 4 0, 1, 2 mod 16
and
x 4 + y4
/ i mod 16,
where
i = (3, 4, 5, .. , 15)
x i4 0, 1, 2 K 14 mod 16
i =1
Reason
[If all the variables are considered to be odd, then maximum remainder which can come out is 14 and if
any of the variable is an even number then remainder will be less than 14.]
Now, let us consider another discussion.
If we have
a 2 + b 2 + c 2 = a 2b 2
we know,
( 2n )2 0 mod 4 and
( 2n + 1)2 1 mod 4
38
whereas
Again we get no integral solution.
a 2b 2 0 mod 4
k = 4m + 2
considering
k = 4m
x 2 + y 2 = 20
here, 20 is of the form 4(5) and 5 can be expressed as 5 = 12 + 22 which gives i = 1 and j = 2 so, it implies
there are 4 integral solutions, which will be of the form 2i and 2j also we have 8 ordered pairs.
Therefore in this case we have (2, 4) as one of the solutions and other solutions are
(2, 4), (2, 4), and (2, 4) also (4, 2), (4, 2), (4, 2) and (4, 2) keep this thing in mind there are only 4
integers used.
e.g.,
x 2 + y2 = 8
Here,
8 = 4(2)
and
2 = 12 + 12
which gives i = j .
So, it implies there are 2 integral solutions which will be of the form 2i and 2j also we have 4 ordered
pairs therefore in this case we have our solutions are
(2, 2), (2, 2), (2, 2) and (2, 2)
keep this thing in mind there are only 2 integers used.
39
Theory of Numbers
e.g.,
x 2 + y2 = 4
Here,
4 = 4(1)
and
1 = 12 + 02
x 2 + y 2 = 24
24 = 4 6
x 2 + y 2 = 12
12 = 4 3
and 3 again can't be expressed as i 2 + j 2 so it will also not have any integral solution.
Now, considering k = 4m + 2 and if m can be written as (i 2 + j 2 + i + j ) and if i j , then these will be
4 integers and 8 ordered pairs of solutions.
And if i = j , then there will be 2 integers and 4 ordered pairs of solutions.
e.g.,
x 2 + y 2 = 10
Here,
10 = 4 ( 2) + 2
and
Therefore there will be four integral solutions which will be given as (2i + 1) and (2 j + 1) and in this
case the solutions are 3 and 1 which will give eight ordered pairs as (3, 1), (3, 1), (3, 1) and (3, 1)
also (1, 3), (1, 3), (1, 3) and (1, 3).
e.g.,
x 2 + y2 = 2
Here,
2 = 4 (0) + 2
and
Therefore there are only two integral solutions which will again be given as ( 2i + 1) and ( 2 j + 1)
and in this case the solutions are 1 and 1, which will give four ordered pairs as (1, 1), (1, 1), (1, 1) and
(1, 1).
e.g.,
x 2 + y 2 = 18
Here,
18 = 4 (4) + 2
and
So
i = 1 and j = 1
i = j
Therefore it will have 2 integral solutions which will be given as ( 2i + 1) and ( 2 j + 1) and in this case
the solutions are 3 and 3 which gives four ordered pairs as
( 3, 3), ( 3, 3), (3, 3) and (3, 3)
e.g.,
Here,
x 2 + y 2 = 14
14 = 4 (3) + 2
and 3 can't be expressed as (i 2 + j 2 + i + j ) as it is always an even number and an even number can't be
equal to an odd number. So it implies if right hand side is (4m + 2) and m is an odd number. So the
equation will never produce any integral solution.
Now, we will extend this concept for an odd number in right hand side of the equation.
40
i.e.,
k = 4m + 1
or
k = 4m + 3
As it has been already discussed (k = 4m + 3) will not produce any integral solutions.
So, considering k = 4m + 1, only.
If
m = i 2 + j 2 + j,
then there will be an odd integer and an even integer, if i 0 and j 0 or i 0 and j = 0 , then there are
four integers and 8 ordered pairs which will satisfy the equation.
So, one of the integral solution is 2i and other is ( 2 j + 1).
Now, if i = 0, j 0, then there are two integers and four ordered pairs which will satisfy the equations.
So, one of the integral solution is 0 and other is ( 2 j + 1) .
e.g.,
Here,
x 2 + y 2 = 21
21 = 4 5 + 1
x 2 + y2 = k
and k is an odd and a perfect square, then perform the following test always.
Take square root of k, which will come out to be as k, now subtract 1 from it we get ( k 1) always
double it, so it becomes 2( k 1), now add 1 to it which becomes 2( k 1). If this value is a perfect
square say, it is a 2 , then the equation will always have 6 integers and 12 ordered pairs as its solutions
and the integers will be a , ( k 1), k and 0. Always keep this thing in mind k is an integer.
And if the test fails, then equation will be solved by the method discussed earlier.
e.g.,
x 2 + y 2 = 169
here 169 = 4(42) + 1, which is of the form (4m + 1) and also it is an odd perfect square so we will have to
perform the mentioned test.
e.g.,
169 = 13
13 1 = 12
and
12 2 = 24
24 + 1 = 25
25 = 52
we will have 4 integers in which 5, 12, will form 8 ordered pairs (5, 12), (5, 12), (5, 12), (5, 12), (12, 5),
(12, 5), (12, 5), (12, 5) also there will be three 13, 0 which will form four pairs (13, 0),(13, 0), (0, 13),
(0, 13)
e.g.,
x 2 + y 2 = 49
here 49 = 4 12 + 1, which is of the form (4m + 1) and also an odd perfect, so we will again perform the
mentioned test.
49 = 7
71= 6
6 2 = 12
12 + 1 = 13
but 13 is not a perfect square therefore the solution will be checked by the earlier method.
12 = (0)2 + (3)2 + (3)
Here,
i = 0 and j = 3
so the solutions will be 0 and 7. Also the ordered pairs will be (0, 7), (0, 7), (7, 0) and (7, 0)
41
Theory of Numbers
Concept
If we are asked to find the number of positive integral solution for xy = n, we first write n is the form
p1 1 . p 2 2 . p3 3 . The number of positive integral solution is same as the number of divisors of n which is
equal to (1 + 1)( 2 + 1)(3 + 1)
Let us consider example xy = 8 = 23
Number of divisors of 8 are 3 + 1 = 4. So there are 4 integral solution and 4 ordered pair namely (1, 8)
(8, 1) (2, 4) (4, 2)
Now let us consider another example xy = 72(x + y )
we can write it as (x 72)( y 72) = 722.
x 72 = X , y 72 = 722
Let
XY = 722 = 26.34
Concept
k2 + 1
k2 1
= (x x )
3
p (x ) = x 3 x
Let
2k
p (m + 1) = (m + 1)3 (m + 1)
= (m + 1)3 (m + 1) = m3 + 3m 2 + 2m
= 3c + m + 3m 2 + 2m = 3(c + m + m 2 )
P (m + 1) is true.
The radius of the circumcircle of a formed by pythogorean
triplet cannot be integer.
The hypotenuse of the ABC is the diameter of the circle.
Concept
x2 + 1
Radius of circumcircle is
2
Concept
2n 2x
+ 1)]
2x
+ 1)
42
= 22x (24n
= (24n
AC 2 = (24n
4 x + 2x
2x
2x + 1
+ 1)
+ 22n 2x + 1 + 2x + 22x )
+ 22n
AB 2 + BC 2 = [22x (22n
= 22x (24n
+ 22n
2x
4x
+1
+ 2 2x )
1)2 ] + (2n
2 22n
2x(22n2x + 1)
+1 2
2x
+ 1) + 22n
= 2 4n
2x
= 2 4n
2x
+ 22x + 4 22n 22
. 2n
= 2 4n
2x
+ 22x + 22
. 2n
= 2 4n
2x
+ 22x + 22n
+ 2
2x (22n2x 1)
+1
Example 1 Prove that there are no natural numbers, which are solutions of15x 2 7y 2 = 9.
Solution
15x 2 9 = 7y 2
3( 5x 2 3) = 7y 2
7y 2 is a multiple of 3.
y is a multiple of 3.
Let
y = 3z
3( 5x 2 3) = 7 9z 2
5x 2 3 = 21z 2
5x 2 = 21z 2 + 3
5x 2 is a multiple of 3.
x is a multiple of 3
x = 3u
Let
15u 2 = 1 + 7z 2
15u 6z 2 = 1 + z 2
2
1 + z 2 is a multiple of 3.
But for any z between 0 to 9, 1 + z 2 is not a multiple of 3.
For any z, the given equation has no integral solution.
Aliter
Since RHS is odd, x and y must be opposite
i.e., one even and one odd.
As 3|15 and 3|9
3 must divide 7y 2.
Let y = 3y1 so 5x 2 21y12 = 3
Again, since 3 divide 21 so 3 must divide 5x 2.
Let
x = 3x 1 , we get
15x 12 7y12 = 1
15x 12 = 7y12 + 1
2x + 1
43
Theory of Numbers
Last digit of perfect square y12 may be one of these values 0, 1, 4, 9, 6, 5.
Hence, last digit of 7y12 + 1 will be 1, 8, 9, 4, 3, 6 respectively.
But 15x 12 ends in 0 or 5.
15x 12 = 7y12 + 1 has no solutions.
21x 2 9 = 10y 2
3 (7x 2 3) = 10y 2
10y 2 is a multiple of 3.
y is a multiple of 3.
y = 3y1
Let
3 (7x 3) = 10 9y12
2
7x 2 3 = 30y12
7x 2 = 3 + 30y12
7x 2 = 3 (1 + 10y12 )
7x 2 is a multiple of 3
So, x is multiple of 3.
x = 3x1
Let
7 9x12 = 3 (1 + 10y12 )
21 x12 = 1 + 10y12
21 x12 9y12 = 1 + y12
3 (7x12 3y12 ) = 1 + y12
1 + y12 is a multiple of 3.
44
Example 4 Prove
Solution
1
n +1
2n
Cn is an integer.
Let
2n
kn
Cn
2n
Cn 1 =
Cn knCn 1
2n
Cn ; b =
2n
Cn 1
2n !
2n !
n
2n !
=
1
n ! n ! (n + 1)!(n 1)! n ! n ! n + 1
1
n + 1 it is an integer.
(kn )!
kn !
=
2n !
n !n !
(kn )!
(kn n )! n !
1
(kn n )! n ! (kn n + 1)!(n 1)!
(kn )!
(kn n )! n !
n
1 kn n + 1
kn n + 1 n kn
kn 2n + 1
= knCn
= Cn kn n + 1 .
+
kn
n
1
It is an integer.
Let
N = 22 34 57
xy = N( x + y )
xy = Nx + Ny
xy Nx Ny = 0
( x N )( y N ) = N 2
( x N )( y N ) = 24.38.514
Solution
1
1
1
=
=
y
20
x
1 x + 20 4 5x
=
y
20x
x 20
20 x
(i)
45
Theory of Numbers
2(a + b ) = ab
(a 2)(b 2) = 4
Example 7 Find the number of solutions in positive integers of the equation 3x + 5y = 1008.
Solution
3x + 15k = 1008
x + 5k = 336
5k 335
k 67
Solution
[Q 2 | ( x + z )]
Again y1 and one of x1, z1, say x1, are even writing x1 = 2x 2 and y1 = 2y 2
We have x 2z1 = y 22 and 2x 2 + z1 = 997
Since, 997 is a prime, x 2 and z1 are relatively prime.
Each is a square since their product is square.
Since any square is of the form 8n, 8n + 1 or 8n + 4, 2x 2 0 or 2(mod 8) and z1 1
(mod 8) (Q z1 is odd).
Hence
2x 2 + z1 1 or 3 (mod 8).
1110|3x 10 y 10 = 1110|1991
an impossibility.
Hence x and y are prime to 11.
x 10 y 10 1 (mod 11)
1991 = 3x 10 y 10 3 1 = 2 a contradiction.
46
Solution
Example 11 For n N, let s(n) denote the number of ordered pairs ( x , y ) of positive integers for
1 1 1
+ = . Determine the set of positive integers n for which s(n ) = 5 .
x y n
1 1 1
+ = x, y > n
x y n
which
Solution
x = n + a and n + b, a, b N.
1
1
1
+
=
n+a n+b n
Now,
(n + b + n + a )n = (n + a )(n + b )
n 2 = ab
s(n ) = 5
1 + 2 1 = 5
and
m =1
n = p12
Example 12 If +
Solution
i.e.,
(a + b )c = ab
Let p be any prime which divides (a + b ); then p divides one of a, b and therefore
both.
Since gcd (a, b, c ) = 1; p does not divide c.
for any k N, pk | a pk | b
Hence the maximum power of p which divides a + b is the square of the maximum
power of p which divides a.
a + b is a square.
47
Theory of Numbers
Since,
3n 5
is also an integer.
n +1
3n 5
8
is an integer.
= 3
n +1
n +1
8
{ 1, 2, 4, 8}
n +1
and
Consequently
8
is a square.
n +1
8
= 1 or 2 ;
n +1
n = 9 or 3
i.e.,
Solution
a 3 + a 2b + ab 2 + b 3
= (a + b ) (a 2 + b 2 ) = 2001
= 3 23 29
a + b is therefore one of the three numbers 3, 23, or 29.
If a + b = 3, then a = 1, b = 2
(or a = 2, b = 1) so that a 2 + b 2 = 5.
But in this case a 2 + b 2 = 23 29
a + b is not 3.
If a + b = 23, then a 2 + b 2 = 87
so that both a and b will be less than 10 and a + b < 20, a contradiction.
If a + b = 29, then a 2 + b 2 = 69 so that both a and b will be less than 10 and
a + b < 20, a contradication.
Thus, the number of pairs (a, b ) satisfying the given condition is zero.