Scribd
Upload
84 views

Assignment of Number Theory

This document contains 10 questions regarding number theory concepts. The questions cover topics like the Euclidean algorithm, Fibonacci sequences, recurrence relations, congruences, and theorems like Euler's theorem and Fermat's little theorem. The questions ask students to find greatest common divisors, solve congruences, derive and solve recurrence relations, and prove statements using number theory principles.

Uploaded by

aaa
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
84 views

Assignment of Number Theory

This document contains 10 questions regarding number theory concepts. The questions cover topics like the Euclidean algorithm, Fibonacci sequences, recurrence relations, congruences, and theorems like Euler's theorem and Fermat's little theorem. The questions ask students to find greatest common divisors, solve congruences, derive and solve recurrence relations, and prove statements using number theory principles.

Uploaded by

aaa
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 2

ASSIGNMENT OF NUMBER THEORY

Q1 (a) Find the greatest common divisor of 625 & 1000 using the Euclidean
Algorithm
(b)Find the integers m & n such that 28844m + 15712n = 4

Q2 (a)Find the recurrence formula for the general term F n of the Fibonacci
sequence 0,1,1,2,3,5,8,13,……..
b)Solve the congruence 9x≡ 12 (mod 21)

Q3
a) Calculate the recurrence relation of the sequence
S = { 5 , 8, 11 , 14 , 17……}
b) Find the first four terms of each of the following recurrence relation
i) ak = 2ak-1 + k, for all integers k≥2, a1=1
ii) ak= ak-1 + 5,a1=1,a0=1
iii) 3ak-2, for all integers k ≥ 2, a1=2, ,a0=1
iv) ak= k(ak-1)2, for all integers k≥1, a0=1

Q4 (a) What is the solution of Recurrence Relations


an = an-1 + 2 an-2 with a0 = 2 and a1 = 7?

(b) Find the Recurrence Relations of the sequences.


i) S = {5, 8, 11, 14, 17}
ii) S = {1, 1, 2, 3, 5, 8, 13}
(c) Find first four terms of each of the following Recurrence Relation
ak = ak-1 + 3ak-2 , for all integers k = 2, a0 = 1, a1 = 2.
Q5 Solve an+2 – 5 an+1 + 6an = 2 with initial condition a0 = 1 and a1 = -1
Q 6 Solve the following

Yn+2-Yn+1-2Yn=n2

Q7 SolveAn+2 -4An-1+4An =2n

Q8 Find the remainder when 3 100 is divisible by 5 .

Q 9 Use theory of congruence to prove that

a) 41 divides 2 20 - 1 b) 89 divides 2 44 -1

Q10 State Euler,s theorem and Fermat’s little theorem.

You might also like