0% found this document useful (0 votes)
11 views2 pages

Mathematics Induction Question Bank

The document is a question bank for a mathematics module, containing various problems related to mathematical induction, recursive definitions, sequences, and combinatorial arrangements. It includes proofs, definitions, and calculations involving sequences like Fibonacci numbers and arrangements of letters. The questions are designed for students to apply mathematical concepts and techniques.

Uploaded by

karthik.s5354
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
0% found this document useful (0 votes)
11 views2 pages

Mathematics Induction Question Bank

The document is a question bank for a mathematics module, containing various problems related to mathematical induction, recursive definitions, sequences, and combinatorial arrangements. It includes proofs, definitions, and calculations involving sequences like Fibonacci numbers and arrangements of letters. The questions are designed for students to apply mathematical concepts and techniques.

Uploaded by

karthik.s5354
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

Department of Mathematics

QUESTION BANK - MODULE 2


Sl. Questions
No
1 1
Prove by Mathematical induction 12 + 32 + 52 + ⋯ + (2𝑛 − 1)2 = 3 [𝑛 (2𝑛 − 1)(2𝑛 + 1)]
2 Prove by Mathematical induction for every positive integer n, 5 divides 𝑛5 − 𝑛.
3 Prove by Mathematical induction that 6𝑛+2 + 72𝑛+1 is divisible by 43, for each positive integer n.
4 Define the well ordering principle. By, Mathematical Induction, Prove that
(n!) ≥ 2𝑛−1 𝑓𝑜𝑟 𝑎𝑙𝑙 𝑖𝑛𝑡𝑒𝑔𝑒𝑟𝑠 𝑛 ≥ 1.
5 By Mathematical Induction Prove that,
𝑛(𝑛+1)(2𝑛+7)
1.3+2.4+………….+n (n+2) =
6
6 1
Prove by Mathematical induction 12 + 22 + 32 + ⋯ + 𝑛2= 6 [𝑛 (𝑛 + 1)(2𝑛 + 1)]
𝑛
7 1 𝑛
Prove ∑ = 𝑛+1 ∀𝑛𝜖𝑍
𝑖=1 𝑖(𝑖+1)
𝑛
8 Establish the following by Mathematical induction ∑𝑖=1 𝑖 2𝑖 = 2 + (𝑛 − 1)2𝑛+1

9 Obtain a recursive definition for the sequence {an} in each of the following cases
a) 𝑎𝑛 = 6𝑛 b) 𝑎𝑛 = (𝑛 + 1)! c) 𝑎𝑛 = 𝑛(𝑛 + 3) d) 𝑎𝑛 = 2 − (−1)𝑛 e) 𝑎𝑛 = (3𝑛 + 7)
f) 𝑎𝑛 = 5𝑛 g) 𝑎𝑛 = 𝑛2
10 Find an explicit definition of the sequence defined recursively by 𝑎1 = 7, 𝑎𝑛 = 2𝑎𝑛−1 + 1 for
𝑛 ≥ 2.
11 A sequence {an} is defined recursively by 𝑎0 = 1, 𝑎1 = 1, 𝑎2 = 1 𝑎𝑛𝑑 𝑎𝑛 = 𝑎𝑛−1 + 𝑎𝑛−3
𝑛
∀ 𝑛 ≥ 3 . 𝑃rove that 𝑎𝑛+2 ≥ (√2) ∀ 𝑛 ≥ 0.
12 For the sequence {an} defined recursively by 𝑎 = 8, 𝑎 = 22, 𝑎 = 4(𝑎 − 𝑎 )
1 2 𝑛 𝑛−1 𝑛−2
𝑓𝑜𝑟 𝑛 ≥ 3. Prove that 𝑎𝑛 = (5 + 3𝑛)2𝑛−1 𝑓𝑜𝑟 𝑛 ≥ 1.
13 Prove that every positive integer n≥24 can be written as a sum of 5’s and/or 7’s.
14 The Fibonacci numbers are defined by 𝐹0 = 0, 𝐹1 = 1 𝑎𝑛𝑑 𝐹𝑛 = 𝐹𝑛−1 + 𝐹𝑛−2 ∀ 𝑛 ≥ 2.
Prove that ∑𝑛𝑖=0 𝐹𝑖2 = 𝐹𝑛 × 𝐹𝑛+1
15 Let 𝑎0 = 1, 𝑎1 = 2, 𝑎2 = 3 𝑎𝑛𝑑 𝑎𝑛 = 𝑎𝑛−1 + 𝑎𝑛−2 + 𝑎𝑛−3 𝑓𝑜𝑟 𝑛 ≥ 3. Prove that
𝑎𝑛 ≤ 3𝑛 ∀ 𝑛 𝜖 𝑍 +
16 Let 𝐹𝑛 denotes the Fibonacci number, Prove that ∑𝑛 𝐹𝑖−1 = 1 − 𝐹𝑛+2
𝑖=1 2𝑖 2𝑛
17 Find the number of ways of arrangement of the letters of the word ‘TALLAHASSEE’ which have
no adjacent A’s.
18 How many positive integers n can we form using the digits 3,4,4,5,5,6,7 if we want n to exceed
5,000,000?
19 Find the number of permutations of the letters of the word MASSASAUGA. In how many of
these all four A’s are together? How many of them begin with S?
20 How many arrangement are there for all the letters in the word “SOCIOLOGICAL”. In how
many of these arrangements i) A and G are adjacent
ii) All vowels are adjacent
21 How many words can be made with or without meaning from the letters of the word
“STATISTICS” ? In how many of these a and c are adjacent ? In how many vowels are together ?
22 In how many ways one can distribute 8 identical marbles in 4 distinct containers so that
a) No container is empty.
b) The 4th container has an odd number of marbles in it?
23 In how many ways can we distribute 7 apples and 5 oranges among 3 children such that each
child gets atleast one apple and one orange.
24 A woman has 11 close relatives and she wishes to invite 5 of them to dinner. In how many ways
can she invite them in the following situations:
a) No restriction on the choice
b) Two particular persons will not attend separately
c) Two particular persons will not attend together.
25 A message is made up of 12 different symbols and is to be transmitted through a communication
channel. In addition to the 12 symbols, the transmitter will also send a total of 45 blank spaces
between the symbols with at least 3 spaces between each pair of consecutive symbols. In how many
ways can the transmitter send such a message?
26 Determine the co-efficient of 𝑎2 𝑏3 𝑐 2 𝑑 5 in the expansion of (𝑎 + 2𝑏 − 3𝑐 + 2𝑑 + 5)16 .
27 Determine the co-efficient of 𝑥𝑦𝑧 2 in the expansion of (2𝑥 − 𝑦 − 𝑧)4 .
28 a) Obtain the co-efficient of 𝑎5 𝑏2 in the expansion of (2𝑎 − 3𝑏)7 .
b) Using the binomial Theorem find the co-efficient of 𝑥 5 𝑦 2 in the expansion of (𝑥 + 𝑦)7
29 a) Find the co-efficient of 𝑥 12 in the expansion of 𝑥 3 (1 − 2𝑥 )10 .
b) Find the co-efficient of 𝑥 3 𝑦 9 in the expansion of (𝑥 + 2𝑦)12 .
c) Find the co-efficient of 𝑥 3 𝑦 8 in the expansion of (2𝑥 − 𝑦)11 .

You might also like