If ninNN, then by princuple of mathemati...

If `ninNN`, then by princuple of mathematical induction prove that,
`2+222+22222+ . . .+22 . . .{(2n-1)"digits"}=(20)/(891)(10^(2n)-1)-(2n)/(9)` for all positive integers n.

Similar Questions

Explore conceptually related problems

If ninNN , then by principle of mathematical induction prove that, 1+2+3+....+nlt(1)/(8)(2n+1)^(2) .

If ninNN , then by principle of mathematical induction prove that, 3^(2n+2)-8n-9 is divisible by 64.

If ninNN , then by principle of mathematical induction prove that, 5^(2n+2)-24n-25 is divisible by 576.

If ninNN , then by princuple of mathematical induction prove that, n*1+(n-1)*2+(n-2)*3+ . . . +2*(n-1)+1*n=(1)/(6)n(n+1)(n+2)

If ninNN , then by principle of mathematical induction prove that, 1^(2)+2^(2)+3^(2)+....+n^(2)gt(n^(3))/(3) .

For all ninNN , prove by principle of mathematical induction that, 1+3+5+ . . .+(2n-1)=n^(2) .

If ninNN , then by principle of mathematical induction prove that, 7+77+777+ . . . to n terms =(7)/(81)(10^(n+1)-9n-10) .

If ninNN , then by principle of mathematical induction prove that, 3^(4n+1)+2^(2n+2)" "[nge0] is a multiple of 7.

If ninNN , then by principle of mathematical induction prove that, 10^(n)+3*4^(n+2)+5" "[nge0] is divisible by 9.

If ninNN , then by principle of mathematical induction prove that, .^(n)C_(0)+.^(n)C_(1)+.^(n)C_(2)+ . . .+.^(n)C_(n)=2^(n)(ninNN)