49^n + 16n -1 is divisible by 64
jaspritaravind228:
by mathematical induction
Answers
Answered by
36
Solution:
let
![p(n) = {49}^{n} + 16n - 1 \\ \\ p(n) = {49}^{n} + 16n - 1 \\ \\](https://tex.z-dn.net/?f=p%28n%29+%3D+%7B49%7D%5E%7Bn%7D+%2B+16n+-+1+%5C%5C+%5C%5C+)
is divisible by 64.
Check for n=1
![p(1) = {49}^{1} + 16(1) - 1 \\ \\ = 49 + 16 - 1 \\ \\ = 64 \\ \\ p(1) = {49}^{1} + 16(1) - 1 \\ \\ = 49 + 16 - 1 \\ \\ = 64 \\ \\](https://tex.z-dn.net/?f=p%281%29+%3D+%7B49%7D%5E%7B1%7D+%2B+16%281%29+-+1+%5C%5C+%5C%5C+%3D+49+%2B+16+-+1+%5C%5C+%5C%5C+%3D+64+%5C%5C+%5C%5C+)
which is divisible by 64.
Now let us assume that it is also divisible by 64 when n= k
![p(k) = {49}^{k} + 16k - 1 = 64 \: r \: \: \: \: r \epsilon \: {Z}^{ + } \\ \\ p(k) = {49}^{k} + 16k - 1 = 64 \: r \: \: \: \: r \epsilon \: {Z}^{ + } \\ \\](https://tex.z-dn.net/?f=p%28k%29+%3D+%7B49%7D%5E%7Bk%7D+%2B+16k+-+1+%3D+64+%5C%3A+r+%5C%3A+%5C%3A+%5C%3A+%5C%3A+r+%5Cepsilon+%5C%3A+%7BZ%7D%5E%7B+%2B+%7D+%5C%5C+%5C%5C+)
now put n= k+1
![p(k + 1) = {49}^{(k + 1)} + 16(k + 1) - 1 \\ \\ manipulate \: these \: terms \: so \\ \: as \: we \: can \: put \: values \: from \: p(k) \\ \\ p(k + 1) = {49}^{k} \times 49 + 16(k + 1) - 1 \\ \\ \\ = 49( {49}^{k} + 16k - 1 - 16k + 1) + 16(k + 1) - 1 \\ \\ = 49(64 \: r - 16k + 1) + 16k + 16 - 1 \\ \\ = 49 \times 64r - 784k +49 + 16k + 15 \\ \\ = 49 \times 64r - 768k + 64 \\ \\ = 64(49r - 12k + 1) \\ \\ p(k + 1) = 64m \: \: \: m \epsilon \: {Z}^{ + } \\ \\ p(k + 1) = {49}^{(k + 1)} + 16(k + 1) - 1 \\ \\ manipulate \: these \: terms \: so \\ \: as \: we \: can \: put \: values \: from \: p(k) \\ \\ p(k + 1) = {49}^{k} \times 49 + 16(k + 1) - 1 \\ \\ \\ = 49( {49}^{k} + 16k - 1 - 16k + 1) + 16(k + 1) - 1 \\ \\ = 49(64 \: r - 16k + 1) + 16k + 16 - 1 \\ \\ = 49 \times 64r - 784k +49 + 16k + 15 \\ \\ = 49 \times 64r - 768k + 64 \\ \\ = 64(49r - 12k + 1) \\ \\ p(k + 1) = 64m \: \: \: m \epsilon \: {Z}^{ + } \\ \\](https://tex.z-dn.net/?f=p%28k+%2B+1%29+%3D+%7B49%7D%5E%7B%28k+%2B+1%29%7D+%2B+16%28k+%2B+1%29+-+1+%5C%5C+%5C%5C+manipulate+%5C%3A+these+%5C%3A+terms+%5C%3A+so+%5C%5C+%5C%3A+as+%5C%3A+we+%5C%3A+can+%5C%3A+put+%5C%3A+values+%5C%3A+from+%5C%3A+p%28k%29+%5C%5C+%5C%5C+p%28k+%2B+1%29+%3D+%7B49%7D%5E%7Bk%7D+%5Ctimes+49+%2B+16%28k+%2B+1%29+-+1+%5C%5C+%5C%5C+%5C%5C+%3D+49%28+%7B49%7D%5E%7Bk%7D+%2B+16k+-+1+-+16k+%2B+1%29+%2B+16%28k+%2B+1%29+-+1+%5C%5C+%5C%5C+%3D+49%2864+%5C%3A+r+-+16k+%2B+1%29+%2B+16k+%2B+16+-+1+%5C%5C+%5C%5C+%3D+49+%5Ctimes+64r+-+784k+%2B49+%2B+16k+%2B+15+%5C%5C+%5C%5C+%3D+49+%5Ctimes+64r+-+768k+%2B+64+%5C%5C+%5C%5C+%3D+64%2849r+-+12k+%2B+1%29+%5C%5C+%5C%5C+p%28k+%2B+1%29+%3D+64m+%5C%3A+%5C%3A+%5C%3A+m+%5Cepsilon+%5C%3A+%7BZ%7D%5E%7B+%2B+%7D+%5C%5C+%5C%5C+)
Hence the number is divisible by 64 by some positive integer m.
Prove
let
is divisible by 64.
Check for n=1
which is divisible by 64.
Now let us assume that it is also divisible by 64 when n= k
now put n= k+1
Hence the number is divisible by 64 by some positive integer m.
Prove
Answered by
1
Step-by-step explanation:
hope it's helpful to you
Attachments:
![](https://hi-static.z-dn.net/files/d3a/7e538b9697b64ae7ca3cb136f5a94428.jpg)
Similar questions