Home
Class 12
MATHS
Prove that for every positive integer n ...

Prove that for every positive integer n the following inequality holds true: `(1)/(9)+(1)/(25)+…..+(1)/((2n+1)^2)lt(1)/(4)`.

Promotional Banner

Similar Questions

Explore conceptually related problems

Prove that for every positive integer n, 1^(n) + 8^(n) - 3^(n) - 6^(n) is divisible by 10.

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

For a positive integer (n gt 1) , Let a (n) = 1+ (1)/(2) + (1)/(3) + (1)/(4) ….... + (1)/( (2^(n) )-1) Then

The lest positive integer n such that 1- (2)/(3)- (2)/(3^(2))- ….- (2)/(3^(n-1)) lt (1)/(100) , is

Prove that : If n is a positive integer, then prove that C_(0)+(C_(1))/(2)+(C_(2))/(3)+….+(C_(n))/(n+1)=(2^(n+1)-1)/(n+1).

True / False For every intger n >1 , the inequality (n !)^(1//n)<(n+1)/2 holds

True / False For every intger n >1 , the inequality (n !)^(1//n)<(n+1)/2 holds

True / False For every intger n >1 , the inequality (n !)^(1//n)<(n+1)/2 holds

The number of positive integers satisfying the inequality ""^(n+1)C_(3) - ""^(n-1) C_(2) le 100 is