Scribd
Upload
15 views2 pages

Set I Laishram

Uploaded by

thespringbreeze3000
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
15 views2 pages

Set I Laishram

Uploaded by

thespringbreeze3000
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

Problem Set I Page 1 Shanta Laishram

Q#1 For a positive integer n, show that

i) 1 · 2 + 2 · 5 + · · · + n(3n − 1) = n2 (n − 1)
n(4n2 − 1)
ii) 12 + 32 + 52 + · · · + (2n − 1)2 = .
3

Q#2 Prove that any finite set of integers has a maximal and a minimal element.

Q#3 Prove that 8|(n2 − 1) for any odd integer n.

Q#4 Prove that 6|(n3 − n) for every integer n.

Q#5 Given a set of 2024 integers, show that there is a subset whose sum of elements is divisible by
2024. Generalize it and prove it.

Q#6 Prove that the product of any k consecutive


 integers is always divisible by k!.
n
Hint: Use induction on n to show that k is an integer.

Q#7 i) Let m and n ≥ 1 be integers. Show that there exist unique integers q and r such that
n n
m = nq + r and − < r ≤ .
2 2
ii) Show that every positive integer n can be uniquely represented in the form

n = n0 + 3n1 + 32 n1 + · · · + 3t nt

with ni ∈ {0, 1, −1} for 0 ≤ i ≤ t where t ≥ 0 is an integer.

Q#8 Recall the Unique Factorization Theorem: Every n > 1 can be written uniquely as product of
primes as
n = pa11 pa22 · · · pat t
where p1 < p2 < · · · < pt are primes and ai ≥ 1 for 1 ≤ i ≤ t. For example 100 = 22 · 52 , 125 =
53 , 127 = 127(prime) etc.

(a) A positive integer n is called squarefree if a prime p|n implies p2 |n. Show that every positive
integer can be written uniquely as the product of a square and a squarefree integer.
(b) A powerful number is a positive integer n such that if a prime p divides n, then p2 divides
n. Show that every powerful number can be written as the product of a square and a cube.
Construct examples to show that this representation of powerful numbers is not unique.
(c) For a prime p and a positive integer n, let νp (n) denote the exact power of p dividing n,
i.e., νp (n) is the maximum ` ≥ 0 such that p` |n but p`+1 - n. We have
∞
X n n n
νp (n!) = b ic = b c + b 2c + ···
i=1
p p p

where bxc denotes the greatest integer of a real x. Use this find the number of zeros at the
end of 2024!.

Q#9 Let n ≥ 2. Show that (n + 1)! + k is composite for k = 2, 3, · · · , n + 1. This shows that there
exist arbitrarily long intervals of composite numbers. In particular, find a list of 2024 consecutive
composite numbers.
Problem Set I Page 2 Shanta Laishram

Q#10 Show that for n ≥ 1, the n−th Harmonic number


1 1
Hn = 1 + + ··· +
2 n
is not an integer for any n ≥ 2.

Q#11 Let n be a positive integer, and let S be a subset of n + 1 elements of the set {1, 2, . . . , 2n}.
Show that

i) There exist two elements of S that are relatively prime, and


ii) There exist two elements of S, one of which divides the other.

Q#12 Let F0 , F1 , F2 , · · · denotes the the Fibonacci sequence given by F0 = 0, F1 = F2 = 1 and satisfying
Fn+2 = Fn+1 + Fn for n ≥ 0. We call Fn the n−th Fibonacci number.

(a) Find all Fibonacci numbers less than 100.


(b) Show that gcd(Fn , Fn+1 ) = 1 for n ≥ 1.
√ √
1+ 5 1− 5
(c) Let α = 2
and β = 2
. Show that

αn − β n
Fn = √ forall n ≥ 0.
5

(d) Show that Fn ≥ αn−2 for all n ≥ 2.


(e) Show that Ln := αn + β n is a positive integer for all n ≥ 0. The numbers Ln are all called
Lucas numbers and they also satisfy the recurrence Ln+2 = Ln+1 + Ln for n ≥ 0. Can you
find all Lucas numbers less than 100?

You might also like