Advertisements
Advertisements
Question
Show that cube of any positive integer is of the form 4m, 4m + 1 or 4m + 3, for some integer m.
Solution
Let a be an arbitrary positive integer.
Then, by division algorithm, corresponding to the positive integers a and 4, there exist non-negative integers q and r such that
a = 4q + r, where 0 ≤ r < 4
`\implies` a3 = (4q + r)3
= 64q3 + r3 + 12qr2 + 48q2r .......[∵ (a + b)3 = a3 + b3 + 3ab2 + 3a2b)
`\implies` a3 = (64q3 + 48q2r + 12qr2) + r3 .......(i)
Where, 0 ≤ r < 4
Case I: When r = 0,
Then putting r = 0 in equation (i), we get
a3 = 64q3 = 4(16q3)
`\implies` a3 = 4m, where, m = 16q3 is an integer.
Case II: When r = 1,
Then putting r = 1 in equation (i), we get
a3 = 64q3 + 48q2 + 12q + 1
= 4(16q3 + 12q2 + 3q) + 1
= 4m + 1
Where, m = (16q3 + 12q2 + 3q) is an integer.
Case III: When r = 2,
Then putting r = 2 in equation (i), we get
a3 = 64q3 + 96q2 + 48q + 8
= 4(16q3 + 24q2 + 12q + 2)
= 4m
Where, m = (16q3 + 24q2 +12q + 2) is an integer.
Case IV: When r = 3,
Then putting r = 3 in equation (i), we get
a3 = 64q3 + 144q2 + 108q + 27
= 64q3 + 144q2 + 108q + 24 + 3
= 4(16q3 + 36q2 + 27q + 6) + 3
= 4m + 3
Where, m = (16q3 + 36q2 + 27q + 6) is an integer.
Hence, the cube of any positive integer is of the form 4m, 4m + 1 or 4m + 3 for some integer m.
APPEARS IN
RELATED QUESTIONS
Use Euclid's Division Algorithm to show that the square of any positive integer is either of the form 3m or 3m + 1 for some integer m.
Define HOE of two positive integers and find the HCF of the following pair of numbers:
75 and 243
Using prime factorization, find the HCF and LCM of 30, 72, 432 .
Find the largest number which divides 438 and 606 leaving remainder 6 in each case.
The LCM of two numbers is 1200. Which of the following cannot be their HCF?
The remainder when the square of any prime number greater than 3 is divided by 6, is
Prove that two consecutive positive integers are always co-prime
The least number that is divisible by all the numbers from 1 to 5 (both inclusive) is ______.
Show that the square of any positive integer cannot be of the form 5q + 2 or 5q + 3 for any integer q.
Prove that if x and y are both odd positive integers, then x2 + y2 is even but not divisible by 4.