Scribd
Upload
23 views2 pages

Basic Principles in Number Theory - Well Ordering Principle, Mathematical Induction, Divisibility - Division Algorithm

The document discusses homework problems in number theory. It includes 5 concept problems covering topics like mathematical induction, divisibility, and sequences. It also includes 2 mixed problems applying these concepts. The problems cover deriving formulas, proving statements, and finding values in number sequences.

Uploaded by

2027anuj
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
23 views2 pages

Basic Principles in Number Theory - Well Ordering Principle, Mathematical Induction, Divisibility - Division Algorithm

The document discusses homework problems in number theory. It includes 5 concept problems covering topics like mathematical induction, divisibility, and sequences. It also includes 2 mixed problems applying these concepts. The problems cover deriving formulas, proving statements, and finding values in number sequences.

Uploaded by

2027anuj
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

Number Theory IOA θ CHEENTA Creators Team

Homework - Week 1
1 Basic Principles in Number Theory - Well or-
dering Principle, Mathematical Induction, Di-
visibility - Division Algorithm
This homework has two parts - concept and mixed problems.

Homework Problems
Concept Problems - Homework

Concept Problem 1
Use mathematical induction to derive the following formula for all n ≥ 1 :

1(1!) + 2(2!) + 3(3!) + · · · + n(n!) = (n + 1)! − 1

Concept Problem 2
For all n ≥ 1, prove the following by mathematical induction:
(a) 112 + 212 + 312 + · · · + n12 ≤ 2 − n1 .

1 2 3 n n+2
(b) 2
+ 22
+ 23
+ ··· + 2n
=2− 2n
.

Concept Problem 3
If the numbers an are defined by a1 = 11, a2 = 21, and an = 3an−1 − 2an−2 for n ≥ 3,
prove that
an = 5 · 2n + 1 n ≥ 1

Concept Problem 4
Use the Division Algorithm to establish the following:
(a) The square of any integer is either of the form 3k or 3k + 1.
(b) The cube of any integer has one of the forms: 9k, 9k + 1, or 9k + 8.
(c) The fourth power of any integer is either of the form 5k or 5k + 1.

Concept Problem 5
If n is an odd integer, show that n4 + 4n2 + 11 is of the form 16k.

1
Number Theory IOA θ CHEENTA Creators Team

Mixed Problems - Homework

Some of the concepts required in this section may be unknown to you. Do


not worry. Try whatever you can. This section is designed to give students
continuous exposure to mixed problems.

Problem 1
Set u0 = 41 , and for k ≥ 0, let uk+1 be determined by the recurrence

uk+1 = 2uk − 2u2k

This sequence tends to a limit; call it L. What is the least value of k such that
1
|uk − L| ≤ ?
21000

Problem 2
A sequence of numbers is defined recursively by a1 = 1, a2 = 37 , and
an−2 · an−1
an =
2an−2 − an−1

for all n ≥ 3. Then a2019 can be written as pq , where p and q are relatively prime
positive integers. What is p + q?

Answer of Mixed Problem


Problem 1) 10
Problem 2) 8078

You might also like