1. Show that 9n+1– 8n – 9 is divisible by 64, whenever n is a positive integer.
1. Show that 9n+1– 8n – 9 is divisible by 64, whenever n is a positive integer.
-
1 Answer
-
1. For a number x to be divisible by y, we can write x as a factor of y i.e., x = ky where k is some natural number. Thus in order for 9n+1 – 8n – 9 to be divisible by 64 we need to show that 9n+1 – 8n – 9 = 64k where k is some natural number.
We have, by binomial theorem
(1 + a)m = mC0 + mC1 (a) + mC2 (a)2 + mC3 (a)3 + ………… + mCm (a)m
Putting, a = 8 and m = n + 1
(1 + 8)n+1 = n+1C0 + n+1C1.8 + n+1C2.82 + n+1C3.83 + ……. + n+1Cn+1. (8)n+1
=> 9n+1= 1 + (n + 1)8 + 82× [n+1C2 + n+1C3.8 + ………. + n+1Cn+1. (8)n+1–2] [since, n+1C0 =
...more
Similar Questions for you
Kindly consider the following figure
for
->r = 24
k = 3 + exponent of 5 in 
=
= 3 + (12 + 2 – 4 – 0 – 7 – 1)
= 3 + 2 = 5
15.
=
We know that by binomial theorem,
=
=
Then,
= (3x2)3 + + +
= 27x6 + + +
= 27x6 + + + [ ]
= 27x6 + [ ] + [ ] + [ ]
= 27x6 +
= 27x6– 54ax5 +
15.
=
We know that by binomial theorem,
=
=
Then,
= (3x2)3 + + +
= 27x6 + + +
= 27x6 + + + [ ]
= 27x6 + [ ] + [ ] + [ ]
= 27x6 +
= 27x6– 54ax5 +
14. For (a – b) to be a factor of an – b nwe need to show (an – bn) = (a – b)k as k is a natural number.
We have, for positive n
an = =
=>an = nC0(a – b)n + nC1(a – b)n -1b + nC2(a – b)n – 2b2 + ………… +nCn-1 + nCnbn
=>an= + nC1 + nC2 + …………….…+ nCn-1 + [Since, nC0 = 1 and nCn = 1]
=> = +nC1 + nC2 + ……………… + nCn-1
=> = [ + nC1 + nC2 +………..…… + nCn-1 ]
=> &n
Taking an Exam? Selecting a College?
Get authentic answers from experts, students and alumni that you won't find anywhere else
Sign Up on ShikshaOn Shiksha, get access to
- 65k Colleges
- 1.2k Exams
- 679k Reviews
- 1800k Answers