Scribd
Upload
114 views2 pages

Gaussian Gamble: Problem Set 3: September 25, 2020

This document is a problem set for a course on Gaussian distributions. It contains 4 questions worth a total of 25 points. Question 1 has two parts asking to prove two mathematical identities. Question 2 has two parts about the lowest common multiple of natural numbers. Question 3 is about a sequence of rational numbers. Question 4 has two parts about the minimum number of meetings needed for researchers to share knowledge.

Uploaded by

Mr. 73
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
114 views2 pages

Gaussian Gamble: Problem Set 3: September 25, 2020

This document is a problem set for a course on Gaussian distributions. It contains 4 questions worth a total of 25 points. Question 1 has two parts asking to prove two mathematical identities. Question 2 has two parts about the lowest common multiple of natural numbers. Question 3 is about a sequence of rational numbers. Question 4 has two parts about the minimum number of meetings needed for researchers to share knowledge.

Uploaded by

Mr. 73
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

Gaussian Gamble: Problem Set 3

September 25, 2020

Maximum possible score : 25

The deadline to submit solutions is 11:59 PM, 2nd October 2020.


Partial solutions will receive partial marking, so mention any
result you may have obtained, including any conjectures that you
make.

Q1. (a) Prove that for all positive integers n, (3)


n n
X 1 n X 1
= +
n+k 2n + 1 (2k)3 − 2k
k=1 k=1

(b) Taking hints from your solution to part (a), prove that (1)
n
1 X 1
ln(2) = + lim 3
2 n→∞ (2k) − 2k
k=1

Q2. Let the lowest common multiple (LCM) of n natural numbers a1 , a2 ..., an
be denoted by [a1 , a2 ..., an ].

(a) Show that that for any k ∈ N there does not exist a pair of natural (3)
numbers (a, b) such that [a,b]
a+b = k.
(b) Find the smallest natural number n such that there exist infinitely (3)
many solutions to a1[a+a
1 ,a2 ...,an ]
2 +...+an
= k for all k ∈ N.

Q3. Let {x} denote the fractional part of a real number x. Define a (7)
sequence of rational numbers (an ) as follows:
a0 = 1
an+1 = 1 + a1n − 2{ a1n } ∀n ≥ 0
Show that every positive rational number appears in the sequence (an )
exactly once.

1
Q4. There are n ≥ 4 math researchers at the Indian institute of Mathemat-
ics. The institute being a strong patron of collaborations organizes a
series of coffee meetings between 2 researchers wherein the researchers
share whatever knowledge of mathematics they have and might have
received from other researchers during their previous meetings.

(a) Prove that the minimum number of meetings that need to be ar- (3)
ranged in order to ensure that each researcher has the knowledge
of everyone else’s in the department is at most 2n − 4.
(b) Prove that the minimum number required above cannot be less (5)
than 2n − 4, and hence conclude that 2n − 4 is exactly the mini-
mum number of required meetings.

You might also like