Scribd
Upload
6 views1 page

Assignment Unit 5

The document outlines an assignment consisting of various mathematical problems and concepts, including Peano's axioms, mathematical induction, recurrence relations, generating functions, and counting principles. It requires explanations, proofs, and applications of these concepts, such as proving the sum of odd numbers and the Pigeonhole Principle. Additionally, it covers combinatorial topics like permutations and Polya's Counting Theorem.

Uploaded by

adityamaurya22092002
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
6 views1 page

Assignment Unit 5

The document outlines an assignment consisting of various mathematical problems and concepts, including Peano's axioms, mathematical induction, recurrence relations, generating functions, and counting principles. It requires explanations, proofs, and applications of these concepts, such as proving the sum of odd numbers and the Pigeonhole Principle. Additionally, it covers combinatorial topics like permutations and Polya's Counting Theorem.

Uploaded by

adityamaurya22092002
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

Assignment-2

1. Explain Piano’s axioms and describe how they help in defining natural numbers.
2. Using mathematical induction, prove that
a. 1+2+3+⋯+n = n(n+1)/2
3. What is strong induction? How is it different from ordinary mathematical induction?
Give an example.
4. Using induction, prove that the sum of first n odd numbers is n2.
5. Explain the role of the successor function in Peano’s axioms with an example.
6. Prove using strong induction that every integer n≥2 is divisible by some prime
number.
7. Define a recurrence relation. Explain with an example how to form a recurrence for
the Tower of Hanoi problem.
8. Solve the recurrence relation an=3an−1−2 with a0=1.
9. What is a generating function? State its important properties. Find the generating
function for the sequence 1,1,1,1,…
10. Solve the recurrence relation an=an−1+an−2 (Fibonacci type) using characteristic roots.
11. Explain the general method of solving linear recurrence relations with constant
coefficients. Use it to solve:
an=4an−1−4an−2
12. Find a closed form for the recurrence an=2an−1+1, given a0=0.
13. State and explain the Pigeonhole Principle. Use it to prove that in any group of 13
people, at least two will have birthdays in the same month.
14. In how many ways can 6 people be seated around a round table? Explain your answer.
15. Define permutations and combinations. Compute the number of ways to choose 4
items from 10 distinct items.
16. What is Polya’s Counting Theorem? Write its statement and explain its significance.
17. How many 4-digit numbers can be formed using digits 1–9 if repetition is allowed?
Show your reasoning.
18. Explain the addition and multiplication principles of counting with examples.

You might also like