Thanks to visit codestin.com
Credit goes to www.scribd.com

Scribd
Upload
18 views1 page

Math Problems for IISER Students

The document contains a problem sheet for Mathematics I (MA 1101) at IISER Kolkata, outlining various mathematical problems and proofs. It includes summation formulas, inequalities, and properties of prime numbers and the Fibonacci sequence. Each problem requires mathematical proofs or derivations for the statements provided.

Uploaded by

Praveen Krishnan
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
18 views1 page

Math Problems for IISER Students

The document contains a problem sheet for Mathematics I (MA 1101) at IISER Kolkata, outlining various mathematical problems and proofs. It includes summation formulas, inequalities, and properties of prime numbers and the Fibonacci sequence. Each problem requires mathematical proofs or derivations for the statements provided.

Uploaded by

Praveen Krishnan
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 1

IISER Kolkata Problem Sheet IV

MA 1101 : Mathematics I

Problem 1.
For all n ∈ N,
(i) 1 + 2 + · · · + n = 12 n(n + 1).
(ii) 12 + 22 + · · · + n2 = 16 n(n + 1)(2n + 1).
(iii) 12 + 32 + · · · + (2n − 1)2 = 13 4n3 − n .


(iv) 13 + 23 + · · · + n3 = 14 n2 (n + 1)2 .
Pn 1
(v) r=1 r(r + 1) · · · (r + 9) = 11 n(n + 1) · · · (n + 10).

Problem 2.
Prove that
(i) 3n > n2 , for all n ∈ N.
(ii) (1 + x)n > 1 + nx, for all x > −1 and n ∈ N.
(iii) 2n
 2n−2
n <2 , for all n > 5, n ∈ N.

Problem 3.
Prove that
(i) Every n ∈ N, n > 2, has a prime divisor/factor.
(ii) Fibonacci sequence : We define the sequence (fn )n>0 as

f0 = 0, f1 = 1, and fn := fn−1 + fn−2 , for all n > 2.

Prove that, for all n ∈ N,


h √ n  √ n i
(a) fn = √15 1+2 5 − 1−2 5 .
(b) f1 + · · · + f2n−1 = f2n .
(c) f2 + · · · + f2n = f2n+1 − 1.

You might also like