Home
Class 11
MATHS
If nge2 is an integer, prove by inductio...

If `nge2` is an integer, prove by induction that,
`1+(1)/(4)+(1)/(9)+ . . .+(1)/(n^(2))lt2-(1)/(n)`.

Promotional Banner

Similar Questions

Explore conceptually related problems

If nge4 is an integer,prove by induction that n^(2)ltn! .

If ngt1 is an integer, prove induction that, (1)/(n+1)+(1)/(n+2)+ . . .+(1)/(2n)gt(13)/(24) .

Prove that 1+(1)/(4)+(1)/(9)+...........+(1)/(n^(2))lt2-(1)/n,(ngt1)

If nge3 is an integer, prove by mathmatical induction that, 2n+1lt2^(n) .

Let P(n) : 1+ (1)/(4) + (1)/(9) + …. + (1)/(n^2) lt 2 - (1)/( n) is true for

If nge0 is an integer, prove by induction that 3*5^(2n+1)+2^(3n+1) is divisible by 17.

If nge3 is an integer prove that 2n+1 lt 2^n by P.M.I.

Prove that 1+(1)/(4)+(1)/(9)+(1)/(16)+....+(1)/(n^(2)) 2,n in N

Prove the following by using the Principle of mathematical induction AA n in N and n>1 1+(1)/(4)+(1)/(9)+…….+(1)/(n^(2))<2-(1)/(n)