Scribd
Upload
3 views2 pages

Module 2 DMS Assignment

This document is an assignment for a Discrete Mathematical Structures course, containing a series of mathematical problems and proofs to be solved using concepts such as mathematical induction, recursive definitions, and combinatorial counting. The problems cover topics including well-ordering principles, Fibonacci numbers, Lucas numbers, and permutations of letters. Students are required to provide proofs and explicit definitions for various mathematical sequences and combinatorial arrangements.

Uploaded by

akkimbasha17
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
3 views2 pages

Module 2 DMS Assignment

This document is an assignment for a Discrete Mathematical Structures course, containing a series of mathematical problems and proofs to be solved using concepts such as mathematical induction, recursive definitions, and combinatorial counting. The problems cover topics including well-ordering principles, Fibonacci numbers, Lucas numbers, and permutations of letters. Students are required to provide proofs and explicit definitions for various mathematical sequences and combinatorial arrangements.

Uploaded by

akkimbasha17
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

Approved by AICTE New Delhi | Affiliated to VTU, Belagavi |Accredited by NBA


Virgo Nagar, Bengaluru-560049
Assignment -2
Sem/Sec: IV Subject: DISCRETE MATHEMATICAL STRUCTURES
Subject code: 24CS/IC/AD/IS46B
[Link] Answer all the questions
1 Define well ordering principal. By Mathematical Induction,
Prove that(𝑛!) ≥ 2𝑛−1 for all integers 𝑛 ≥ 1
2 𝑛(𝑛+1)
By mathematical induction prove that 1 + 2 + 3 + ⋯ ⋯ ⋯ ⋯ + 𝑛 = 2
3 𝑛(𝑛+1)(2𝑛+1)
By mathematical induction prove that 12 + 22 + 32 + ⋯ ⋯ ⋯ ⋯ + 𝑛2 = 6
4 Prove that 4𝑛 < (𝑛2 − 7) for all positive integers 𝑛 ≥ 6 .
5 Prove by mathematical induction that, for every positive integer 𝑛, 5 divides 𝑛5 − 𝑛 .
6 Prove that every positive integer 𝑛 ≥ 24 can be written as a sum of 5’s and/or 7’s .
7 Prove by mathematical induction that, for every positive integer 𝑛,
the number 11𝑛+2 + 122𝑛+1 is divisible by 133 .
8 Obtain the recursive definitions for the following cases
(a) 𝑎𝑛 = 5𝑛 (b) 𝑎𝑛 = 3𝑛 + 7 (c) 𝑎𝑛 = 𝑛2 (d) 𝑎𝑛 = 2 − (−1)𝑛
9 Find the explicit definition of the sequence defined recursively by
𝑎1 = 7, 𝑎𝑛 = 2𝑎𝑛−1 for 𝑛 ≥ 2
10 Define recursively Fibonacci number and Prove that ∑𝑛𝑖=1 𝐹𝑖2 = 𝐹𝑘 + 𝐹𝑘+1
𝐹 𝐹𝑛+2
11 If 𝐹0 , 𝐹1 , 𝐹2 , ……. Are Fibonacci numbers, prove that ∑𝑛𝑖=1 2𝑖−1
𝑖 = 1 − 2𝑛 for all positive

integers 𝑛 .
𝑛 𝑛
12 1 1+√5 1−√5
If 𝐹0 , 𝐹1 , 𝐹2 , ……. Are Fibonacci numbers, prove that 𝐹𝑛 = √5 [( ) − ( ) ]
2 2
13 Define recursively Lucas number and Prove that 𝐿𝑛 = 𝐹𝑛−1 + 𝐹𝑛+1
14 How many words can be made with or without meaning from the letters of the word
“STATISTICS”? In many of these A and C are adjacent? In how many vowels together?
15 Find the number of permutations of the word “MASSASAUGA”. In how many of these all four
A’s together? How many of these begin with S?
16 How many positive integer n, can we form using the digits 3,4,4,5,5,6,7. If we want n to
exceeds 5,000,000.
17 Find the number of committees of 5 that can be selected from 7 men and 5 women if the
committee is to consist of at least 1 man and 1 woman.
18 A women has 11 close relatives and wish invite 5 of them to dinner. In how many ways can
she invite them if (i) no restriction on her choice. (ii) 2 persons will not attend separately.
(iii) 2 persons will not attend together.
19 Find the number of arrangements of the letters in THALLAHASSEE which have no adjacent
A’s .
20 In how many ways can we distribute 12 identical pencils to 5 children so that every child
gets at least 1 pencil ?
21 In how many ways can we distribute 7 apples and 5 Oranges among 3 children such that
each child gets at least one apple and one orange?
22 Find the coefficient of 𝑥 3 𝑦 8 in the expression of (2𝑥 − 𝑦)11
23 (i)Obtain the coefficient of 𝑎5 𝑏 2 in the expansion of (2𝑎 − 3𝑏)7
(ii)Using binomial theorem find the coefficient of 𝑥 5 𝑦 2 in the expansion of (𝑥 + 𝑦)7 .
24 Determine the coefficient of 𝑥𝑦𝑧 2 in the expansion of (2𝑥 − 𝑦 − 𝑧)4 .
25 Determine the coefficient of 𝑎2 𝑏 3 𝑐 2 𝑑 5 in the expansion of (𝑎 + 2𝑏 − 3𝑐 + 2𝑑 + 5)16 .

You might also like