Scribd
Upload
94 views

Computational Mathematics (Math 3221)

This document provides information about a computational mathematics exam for 6th semester B.Tech CSE students in 2021. It contains 10 multiple choice questions worth 1 mark each (Group A). It also contains 5 other questions worth 12 marks each (Groups B-E) covering topics like recurrence relations, generating functions, Fibonacci numbers, modular arithmetic, and proofs. Students must answer all of Group A and 5 questions total with at least one from each group. Submissions must be made online through a provided Google Classroom link.

Uploaded by

gidano
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
94 views

Computational Mathematics (Math 3221)

This document provides information about a computational mathematics exam for 6th semester B.Tech CSE students in 2021. It contains 10 multiple choice questions worth 1 mark each (Group A). It also contains 5 other questions worth 12 marks each (Groups B-E) covering topics like recurrence relations, generating functions, Fibonacci numbers, modular arithmetic, and proofs. Students must answer all of Group A and 5 questions total with at least one from each group. Submissions must be made online through a provided Google Classroom link.

Uploaded by

gidano
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/ 3

B.

TECH/CSE/6TH SEM/MATH 3221/2021


B.TECH/CSE/6TH SEM/MATH 3221/2021

COMPUTATIONAL MATHEMATICS
(MATH 3221)
Time Allotted : 3 hrs Full Marks : 70
Figures out of the right margin indicate full marks.
Candidates are required to answer Group A and
any 5 (five) from Group B to E, taking at least one from each group.
Candidates are required to give answer in their own words as far as practicable.

Group – A
(Multiple Choice Type Questions)

1. Choose the correct alternative for the following: 10 × 1 = 10


(i) The generating function of the sequence {1, 3, 9, 27, 81, 243, … . , 3𝑛 , … . } is
1 1 1 1
(a) 3
(b) 3
(c) (d)
1−𝑥 1+𝑥 1+3𝑥 1−3𝑥

(ii) The third harmonic number 𝐻3 =


1 3 11
(a) 1 (b) (c) (d)
2 2 6

(iii) The second Bernoulli number 𝐵2 =


1 1 1
(a) (b) (c) − (d) 0
6 2 2

(iv) Which of the following is a Fibonacci number?


(a) 235 (b) 144 (c) 133 (d) 35
(v) 𝜑 32 =
(a) 12 (b) 8 (c) 31 (d)16
4 4
(vi) 3 + 3 =
(a) 1 (b) 2 (c) 3 (d) 4
(vii) The remainder in the division of 10100 − 1 by 99 is
(a) 1 (b) 9 (c) 0 (d)10
(viii) Δ(𝑥 10 ) is a polynomial in 𝑥 whose degree is
(a) 10 (b) 9 (c) 11 (d) 8
(ix) The generating function of the sequence 1, −3,9, −27,81, … , −1 𝑛 3𝑛 , … is
1 1 1 1
(a) (b) 2
(c) (d)
1−3𝑥 (1+3𝑥) 1+3𝑥 1+𝑥 3

(x) Which one of the following is a Fibonacci number?


(a) 89 (b) 235 (c) 146 (d)36.
MATH 3221 1
B.TECH/CSE/6TH SEM/MATH 3221/2021
Group – B
𝑛 𝑘
2. (a) Express 𝑆𝑛 = 𝑘=1 𝑘2 as a function of 𝑛. Show your work in detail.
(b) Consider the Tower of Hanoi problem. Let 𝑇𝑛 denote the maximum number of
moves that will transfer 𝑛 disks from one peg to another, if only one disk is
moved at a time, and a larger one is never moved onto a smaller one. Prove that
𝑇𝑛 ≥ 2𝑇𝑛−1 + 1 for 𝑛 > 0.
6 + 6 = 12

𝑛 2 𝑛 𝑛+1 (𝑛+2)
3. (a) Prove that 𝑘=0 𝑘 = by the perturbation method.
6

𝑥𝑚 𝑥𝑛
(b) Prove that = .
(𝑥−𝑛)𝑚 (𝑥−𝑚)𝑛
7 + 5 = 12

Group – C
𝑛
4. (a) Prove the recurrence relation for the Sterling numbers of the first kind, :
𝑘
𝑛 𝑛−1 𝑛−1
= 𝑛−1 +
𝑘 𝑘 𝑘−1
where 𝑛, 𝑘 are positive integers and 2 ≤ 𝑘 ≤ 𝑛.
𝑥 𝐵
(b) The generating function of the Bernoulli numbers 𝐵𝑛 is 𝑥 = ∞ 𝑛 𝑛
𝑛=0 𝑛 ! 𝑥 .
𝑒 −1
Use this to prove that for any integer𝑘 ≥ 1, the following recurrence relation
hold true.
𝐵𝑘 𝐵 𝐵 𝐵 𝐵 1
+ 𝑘 −1 + 𝑘 −2 + 𝑘 −3 + … … + 𝑘 −2 + = 0.
1!𝑘! 2!(𝑘−1)! 3!(𝑘−2)! 4!(𝑘−3)! 𝑛!1! 𝑛+1 !
6 + 6 = 12

5. (a) Let𝐹𝑘 denote the Fibonacci numbers. Let 𝑚 ≥ 2 be a fixed integer. Prove that
𝐹𝑚 +𝑛 = 𝐹𝑚 −1 𝐹𝑛 + 𝐹𝑚 𝐹𝑛+1 for all integers 𝑛 ≥ 1, by induction on 𝑛.
(b) Let 𝑟, 𝑘 be positive integers and 𝑟 > 𝑘. Prove that
𝑟 𝑟−1
𝑟−𝑘 =𝑟
𝑘 𝑘
6 + 6 = 12

Group – D
6. (a) Show that 18! + 3310 + 4416 + 20! ≡ 1 𝑚𝑜𝑑 19 . Show your calculations and
state every theorem that you use.
(b) (i) Let 𝑛 be a positive integer. Prove that if 𝑛 − 1 ! ≡ −1 (𝑚𝑜𝑑 𝑛), then 𝑛
must be a prime number.
(ii) Let 𝑎, 𝑏, 𝑚, 𝑘 be positive integers. If 𝑎 ≡ 𝑏 𝑚𝑜𝑑 𝑚 , prove that 𝑎𝑘 ≡
𝑏𝑘 𝑚𝑜𝑑 𝑚 .
6 + (3 + 3) = 12

MATH 3221 2
B.TECH/CSE/6TH SEM/MATH 3221/2021
7. (a) Given that 𝑎 has order 3 modulo 𝑝, where 𝑝 is an odd prime, show that
(𝑎 + 1)6 ≡ 1 𝑚𝑜𝑑 𝑝 .
(b) Let 𝑛, 𝑚 be positive integers such that𝑛 > 𝑚.
Prove the Dirichlet Box Principle: If 𝑛 objects are put into 𝑚 boxes, then some
𝑛
box must contain ≥ .
𝑚
6 + 6 = 12

Group – E
8. (a) Solve the recurrence relation an1  an  3n 2  n; n  0, a0  3.

(b) Find a formula for the general term Fn of the Fibonacci sequence
0, 1, 1, 2, 3, 5, 8, 13, ......
6 + 6= 12

9. (a) Solve the recurrence relation by using the method of generating function
an1  4an  4an1  n  1; n  1, given a0  0 & a1  1.

(b) Use mathematical induction to prove that 5 2n  25n is divisible by 7.


6 + 6 = 12

Department &
Submission Link
Section
CSE https://classroom.google.com/c/MzExNTQ4NTg0MTY3/a/MzQ0MTcyNTUzNjY5/details

MATH 3221 3

You might also like