Scribd
Upload
2 views2 pages

P2

The document presents a series of mathematical problems and proofs, including summation formulas, inequalities, and properties of sequences. It covers topics such as the Fibonacci sequence, factorial growth, and the Tower of Hanoi puzzle. Each problem requires a demonstration of mathematical principles through induction or recursive methods.

Uploaded by

md.shihab.sharar
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
2 views2 pages

P2

The document presents a series of mathematical problems and proofs, including summation formulas, inequalities, and properties of sequences. It covers topics such as the Fibonacci sequence, factorial growth, and the Tower of Hanoi puzzle. Each problem requires a demonstration of mathematical principles through induction or recursive methods.

Uploaded by

md.shihab.sharar
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/ 2

𝑛 (𝑛+1)

1. Show that: 0 + 1 + 2 + ….. + 𝑛 = 2

2
2. For any natural number 𝑛 such that 𝑛 ≥ 2, show that 𝑛 + 1 < 𝑛 .
[𝑊𝑒 𝑚𝑢𝑠𝑡 𝑐ℎ𝑜𝑜𝑠𝑒 𝑛0 = 2]

2
3. For any natural number 𝑛 such 𝑛 ≥ 4, 𝑝𝑟𝑜𝑣𝑒 𝑡ℎ𝑎𝑡 𝑛! > 𝑛

4. 𝐹𝑖𝑏𝑜𝑛𝑎𝑐𝑐𝑖 𝑆𝑒𝑞𝑢𝑒𝑛𝑐𝑒: 1, 1, 2, 3, 5, 8, 13, 21, . . . .


𝑆ℎ𝑜𝑤 𝑡ℎ𝑎𝑡 𝑡ℎ𝑒 𝑖𝑑𝑒𝑛𝑡𝑖𝑡𝑦 F1 + F3 + . . . + F2𝑛 − 1 = F2𝑛 − 1 𝑖𝑠 𝑡𝑟𝑢𝑒 𝑓𝑜𝑟 𝑎𝑙𝑙 𝑛 ≥ 1 .

5. 𝐹𝑜𝑟 𝑎𝑛𝑦 𝑛𝑎𝑡𝑢𝑟𝑎𝑙 𝑛𝑢𝑚𝑏𝑒𝑟 𝑛 𝑎𝑛𝑑 𝑓𝑜𝑟 𝑎𝑛𝑦 𝑟𝑒𝑎𝑙 𝑛𝑢𝑚𝑏𝑒𝑟 𝑥, 𝑝𝑟𝑜𝑣𝑒 𝑡ℎ𝑎𝑡
2 3 𝑛 𝑛+1
(1 − 𝑥)(1 + 𝑥 + 𝑥 + 𝑥 + . . . + 𝑥 ) = 1 − 𝑥

𝑛 𝑛+1
𝑖 1−𝑟
6. 𝑈𝑠𝑒 𝑡ℎ𝑒 𝑐𝑜𝑟𝑜𝑙𝑙𝑎𝑟𝑦 ∑ 𝑎 · 𝑟 = 𝑎 · 1−𝑟
𝑡𝑜 𝑓𝑖𝑛𝑑 𝑡ℎ𝑒 𝑠𝑢𝑚 𝑜𝑓
𝑖=0
2 3 𝑛
3 · 2 + 3 ·2 + 3 ·2 + . . . + 3 ·2

𝑛 𝑛+1
𝑖 1−𝑟
7. 𝑈𝑠𝑒 𝑡ℎ𝑒 𝑐𝑜𝑟𝑜𝑙𝑙𝑎𝑟𝑦 ∑ 𝑎 · 𝑟 = 𝑎 · 1−𝑟
𝑡𝑜 𝑓𝑖𝑛𝑑 𝑡ℎ𝑒 𝑠𝑢𝑚 𝑜𝑓
𝑖=0
2 + 10 + 50 + . . . + 1250

8. 𝑇ℎ𝑒 𝑡𝑒𝑟𝑚𝑠 𝑜𝑓 𝑎 𝑠𝑒𝑞𝑢𝑒𝑛𝑐𝑒 𝑎𝑟𝑒 𝑔𝑖𝑣𝑒𝑛 𝑟𝑒𝑐𝑢𝑟𝑠𝑖𝑣𝑒𝑙𝑦 𝑎𝑠


𝑎0 = 0, 𝑎1 = 2, and 𝑎n = 4(𝑎n-1− 𝑎n-2) 𝑓𝑜𝑟 𝑛 ≥ 2
𝑛
𝑃𝑟𝑜𝑣𝑒 𝑏𝑦 𝑖𝑛𝑑𝑢𝑐𝑡𝑖𝑜𝑛 𝑡ℎ𝑎𝑡 𝑏n = 𝑛 · 2 𝑖𝑠 𝑎 𝑐𝑙𝑜𝑠𝑒𝑑 𝑓𝑜𝑟𝑚 𝑓𝑜𝑟 𝑡ℎ𝑒 𝑠𝑒𝑞𝑢𝑒𝑛𝑐𝑒.
𝑇ℎ𝑎𝑡 𝑖𝑠, 𝑝𝑟𝑜𝑣𝑒 𝑡ℎ𝑎𝑡 𝑎n= 𝑏n 𝑓𝑜𝑟 𝑒𝑣𝑒𝑟𝑦 𝑛 ∈ 𝑁

9. 𝑇ℎ𝑒 𝑡𝑒𝑟𝑚𝑠 𝑜𝑓 𝑎 𝑠𝑒𝑞𝑢𝑒𝑛𝑐𝑒 𝑎𝑟𝑒 𝑔𝑖𝑣𝑒𝑛 𝑟𝑒𝑐𝑢𝑟𝑠𝑖𝑣𝑒𝑙𝑦 𝑎𝑠


𝑎0 = 1, 𝑎1 = 1, 𝑎𝑛𝑑 𝑎𝑛 = 2 · 𝑎𝑛−1 + 3 · 𝑎𝑛−2 𝑓𝑜𝑟 𝑛 ≥ 2
1 𝑛 1 𝑛
𝑃𝑟𝑜𝑣𝑒 𝑏𝑦 𝑖𝑛𝑑𝑢𝑐𝑡𝑖𝑜𝑛 𝑡ℎ𝑎𝑡 𝑏𝑛 = 2
·3 + 2
· (− 1) 𝑖𝑠 𝑎 𝑐𝑙𝑜𝑠𝑒𝑑 𝑓𝑜𝑟𝑚 𝑓𝑜𝑟 𝑡ℎ𝑒 𝑠𝑒𝑞𝑢𝑒𝑛𝑐𝑒
[ 𝑎𝑛 = 𝑏𝑛]

10. 𝐹𝑖𝑛𝑑 𝑡ℎ𝑒 𝑓𝑖𝑟𝑠𝑡 𝑠𝑖𝑥 𝑣𝑎𝑙𝑢𝑒𝑠 [𝑓𝑟𝑜𝑚 𝐹(0) 𝑡𝑜 𝐹(5)] 𝑜𝑓 𝑡ℎ𝑒 𝑓𝑢𝑛𝑐𝑡𝑖𝑜𝑛 𝑑𝑒𝑓𝑖𝑛𝑒𝑑 𝑜𝑛 𝑁 𝑔𝑖𝑣𝑒𝑛 𝑏𝑦
𝐹(0) = 2, 𝐹(1) = 3, 𝐹(2) = 5, 𝑎𝑛𝑑 𝐹(𝑛) = 2𝐹(𝑛 − 1) + 3𝐹(𝑛 − 2) + 𝐹(𝑛 − 3)
𝑓𝑜𝑟 𝑛 ≥ 3.
11. 𝑇𝑜𝑤𝑒𝑟 𝑜𝑓 𝐻𝑎𝑛𝑜𝑖 𝑖𝑠 𝑎 𝑚𝑎𝑡ℎ𝑒𝑚𝑎𝑡𝑖𝑐𝑎𝑙 𝑝𝑢𝑧𝑧𝑙𝑒 𝑤ℎ𝑒𝑟𝑒 𝑤𝑒 ℎ𝑎𝑣𝑒 𝑡ℎ𝑟𝑒𝑒 𝑟𝑜𝑑𝑠 𝑎𝑛𝑑.
𝑛 𝑑𝑖𝑠𝑘𝑠. 𝑇ℎ𝑒 𝑜𝑏𝑗𝑒𝑐𝑡𝑖𝑣𝑒 𝑜𝑓 𝑡ℎ𝑒 𝑝𝑢𝑧𝑧𝑙𝑒 𝑖𝑠 𝑡𝑜 𝑚𝑜𝑣𝑒 𝑡ℎ𝑒 𝑒𝑛𝑡𝑖𝑟𝑒 𝑠𝑡𝑎𝑐𝑘 𝑡𝑜 𝑎𝑛𝑜𝑡ℎ𝑒𝑟 𝑟𝑜𝑑,
𝑜𝑏𝑒𝑦𝑖𝑛𝑔 𝑡ℎ𝑒 𝑓𝑜𝑙𝑙𝑜𝑤𝑖𝑛𝑔 𝑠𝑖𝑚𝑝𝑙𝑒 𝑟𝑢𝑙𝑒𝑠:
𝑎. 𝑂𝑛𝑙𝑦 𝑜𝑛𝑒 𝑑𝑖𝑠𝑘 𝑐𝑎𝑛 𝑏𝑒 𝑚𝑜𝑣𝑒𝑑 𝑎𝑡 𝑎 𝑡𝑖𝑚𝑒.
𝑏. 𝐸𝑎𝑐ℎ 𝑚𝑜𝑣𝑒 𝑐𝑜𝑛𝑠𝑖𝑠𝑡𝑠 𝑜𝑓 𝑡𝑎𝑘𝑖𝑛𝑔 𝑡ℎ𝑒 𝑢𝑝𝑝𝑒𝑟 𝑑𝑖𝑠𝑘 𝑓𝑟𝑜𝑚 𝑜𝑛𝑒 𝑜𝑓 𝑡ℎ𝑒 𝑠𝑡𝑎𝑐𝑘𝑠
𝑎𝑛𝑑 𝑝𝑙𝑎𝑐𝑖𝑛𝑔 𝑖𝑡 𝑜𝑛 𝑡𝑜𝑝 𝑜𝑓 𝑎𝑛𝑜𝑡ℎ𝑒𝑟 𝑠𝑡𝑎𝑐𝑘 𝑖. 𝑒. 𝑎 𝑑𝑖𝑠𝑘 𝑐𝑎𝑛 𝑜𝑛𝑙𝑦 𝑏𝑒 𝑚𝑜𝑣𝑒𝑑 𝑖𝑓 𝑖𝑡 𝑖𝑠 𝑡ℎ𝑒
𝑢𝑝𝑝𝑒𝑟𝑚𝑜𝑠𝑡 𝑑𝑖𝑠𝑘 𝑜𝑛 𝑎 𝑠𝑡𝑎𝑐𝑘.
𝑐. 𝑁𝑜 𝑑𝑖𝑠𝑘 𝑚𝑎𝑦 𝑏𝑒 𝑝𝑙𝑎𝑐𝑒𝑑 𝑜𝑛 𝑡𝑜𝑝 𝑜𝑓 𝑎 𝑠𝑚𝑎𝑙𝑙𝑒𝑟 𝑑𝑖𝑠𝑘.
𝑆𝑜𝑙𝑣𝑒 𝑡ℎ𝑒 𝑝𝑟𝑜𝑏𝑙𝑒𝑚 𝑢𝑠𝑖𝑛𝑔 𝑟𝑒𝑐𝑢𝑟𝑠𝑖𝑜𝑛: 𝑇(𝑛) = 2𝑇(𝑛 − 1) + 1 𝑓𝑜𝑟 𝑛 > 1
[𝑇(1) = 1]

12. 𝑆𝑜𝑙𝑣𝑒 𝑡ℎ𝑒 𝑓𝑜𝑙𝑙𝑜𝑤𝑖𝑛𝑔 𝑓𝑖𝑟𝑠𝑡 − 𝑜𝑟𝑑𝑒𝑟 𝑟𝑒𝑐𝑢𝑟𝑟𝑒𝑛𝑐𝑒 𝑢𝑠𝑖𝑛𝑔 𝑏𝑎𝑐𝑘 𝑠𝑢𝑏𝑠𝑡𝑖𝑡𝑢𝑡𝑖𝑜𝑛:

13. 𝑆𝑜𝑙𝑣𝑒 𝑡ℎ𝑒 𝑓𝑜𝑙𝑙𝑜𝑤𝑖𝑛𝑔 𝑓𝑖𝑟𝑠𝑡 − 𝑜𝑟𝑑𝑒𝑟 𝑟𝑒𝑐𝑢𝑟𝑟𝑒𝑛𝑐𝑒 𝑢𝑠𝑖𝑛𝑔 𝑏𝑎𝑐𝑘 𝑠𝑢𝑏𝑠𝑡𝑖𝑡𝑢𝑡𝑖𝑜𝑛:
𝑛
𝑇(𝑛) = 2𝑇( 2 ) + 𝑛 , [ 𝑇(1) = 1 ]

14. 𝑆𝑜𝑙𝑣𝑒 𝑡ℎ𝑒 𝑓𝑜𝑙𝑙𝑜𝑤𝑖𝑛𝑔 𝑓𝑖𝑟𝑠𝑡 − 𝑜𝑟𝑑𝑒𝑟 𝑟𝑒𝑐𝑢𝑟𝑟𝑒𝑛𝑐𝑒 𝑢𝑠𝑖𝑛𝑔 𝑏𝑎𝑐𝑘 𝑠𝑢𝑏𝑠𝑡𝑖𝑡𝑢𝑡𝑖𝑜𝑛:
𝑛
𝑇(𝑛) = 2𝑇( 2 ) + 1 , [ 𝑇(1) = 1 ]

15. 𝑆𝑜𝑙𝑣𝑒 𝑡ℎ𝑒 𝑓𝑜𝑙𝑙𝑜𝑤𝑖𝑛𝑔:


𝑇(𝑛) = 𝑇(𝑛 − 1) + 𝑛 , [ 𝑇(1) = 1 ]

You might also like