# IITJEE Advanced

# Pre-RMO or RMO algebra practice problem: infinite product

Find the product of the following infinite number of terms:

, and also,

Hence, we get , which in turn, equals

, that is, in turn equal to

, that is, in turn equal to

, so that when , and then .

*personal comment: I did not find this solution within my imagination !!! ๐ ๐ ๐*

The credit for the solution goes to “Popular Problems and Puzzles in Mathematics” by Asok Kumar Mallik, IISc Press, Foundation Books. Thanks Prof. Mallik !!

*Cheers,*

Nalin Pithwa

# B.S. in Mathematics : IIT Bombay program

http://www.math.iitb.ac.in/Academics/bs_programme.php

Note that the admission is through IITJEE Advanced only.

*Nalin Pithwa.*

# Algebra Training for RMO and Pre-RMO: let’s continue: Fibonacci Problem and solution

**Fibonacci Problem:**

Leonardo of Pisa (famous as Fibonacci) (1173) wrote a book “Liber Abaci” (1202), wherein he introduced Hindu-Arabic numerals in Europe. In 1225, Frederick II declared him as the greatest mathematician in Europe when he posed the following problem to defeat his opponents.

**Question:**

Determine the rational numbers x, y and z to satisfy the following equations:

and .

**Solution:**

Definition: Euler defined a congruent number to be a rational number that is the area of a right-angled triangle, which has rational sides. With p, q, and r as a Pythagorean triplet such that , then is a congruent number.

It can be shown that square of a rational number cannot be a congruent number. In other words, there is no right-angled triangle with rational sides, which has an area as 1, or 4, or , and so on.

Characteristics of a congruent number: A positive rational number n is a congruent number, if and only if there exists a rational number u such that and are the squares of rational numbers. (Thus, the puzzle will be solved if we can show that 5 is a congruent number and we can determine the rational number ). First, let us prove the characterisitic mentioned above.

Necessity: Suppose n is a congruent number. Then, for some rational number p, q, and r, we have and . In that case,

and n are rational numbers and we have

and similarly,

.

Setting , we get and are squares of rational numbers.

Sufficiency:

Suppose n and u are rational numbers such that and are rational, when

and

and 2n are rational numbers satisfying is a rational square and also , a rational number which is a congruent number.

So, we see that the Pythagorean triplets can lead our search for a congruent number. Sometimes a Pythagorean triplet can lead to more than one congruent number as can be seen with . This set obviously gives 180 as a congruent number. But, as , we can also consider a rational Pythagorean triplet , which gives a congruent number 5 (we were searching for this congruent number in this puzzle!). We also determine the corresponding .

The puzzle/problem is now solved with , which gives , and .

One can further show that if we take three rational squares in AP, , and , and , with their product defined as a rational square and n as a congruent number, then , is a rational point on the elliptic curve .

**Reference:**

1) Popular Problems and Puzzles in Mathematics: Asok Kumar Mallik, IISc Press, Foundation Books, Amazon India link:

2) Use the internet, or just Wikipedia to explore more information on Fibonacci Numbers, Golden Section, Golden Angle, Golden Rectangle and Golden spiral. *You will be overjoyed to find relationships amongst all the mentioned “stuff”. *

Cheers,

Nalin Pithwa

# Euler Series question and solution

**Question:**

Mengoli had posed the following series to be evaluated:

.

Some great mathematicians, including Liebnitz, John Bernoulli and D’Alembert, failed to compute this infinite series. Euler established himself as the best mathematician of Europe (in fact, one of the greatest mathematicians in history) by evaluating this series initially by a not-so-rigorous method. Later on, he gave alternative and more rigorous ways of getting the same result.

*Prove that the series converges and gets an upper limit. Then, try to evaluate the series.*

**Proof:**

Due Nicolas Oresine:

Consider the following infinite series:

We can re-write the preceding series as follows: , which in turn is less than

. Now, the RHS of this can be re-written as

, which is a geometric series and it is given by

.

Now, we can say that will converge if .

In order to prove what is asked, we start with

And, then multiply both sides by and then subtract the resulting equation from the preceding equation to get

where all the terms containing the reciprocals of the sth power of even numbers vanished.

Repeating this procedure with gives

where all terms containing the reciprocals of the sth power of multiples of 3 vanished.

By continuing this with all prime numbers, we get

, where p represents all prime numbers. Thus, we get

This is a remarkable result because the LHS is concerned with only positive integers, whereas the RHS is concerned with only primes. This result is known as the **“Golden Key of Euler”.**

**Riemann** **created his famous** **function by extending the variable s to the entire complex plane, except** **withย **

.

*This function is now very famous as the Riemann zeta function.*

**How can we apply the Golden Key of Euler to Mengoli’s question that we started with?**

Ans. In the Golden Key of Euler, substitute .

Hence, we get the upper limit of the given series is 2.

**Euler’s proof (1775):**

The proof ran as follows:

It is a little roundabout way of arriving at the correct answer from a known result. Consider McLaurin’s series expansion of sin x:

By dividing both sides by x and then substituting on the right side, we get the following:

By taking a special value of (and, hence ), we get the following:

*Noteย that preceding equation is not a polynomial, but an infinite series.ย *But, Euler still treated it as a polynomial (that is why it was not accepted as a rigorous result) and observed that this “infinite” polynomial has roots equal to . Then, Euler had used the fact that the sum of the reciprocals of the roots is determined by the coefficient of the linear term (here, the y-term) when the constant is made unity. *(check this as homework quiz, for a quadratic to be convinced).ย *So, Euler had arrived at the following result:

. With , we get the following:

or, .

**Another proof also attributed to Euler that uses the series expansion of sin (x) goes as follows below:**

has roots given by 0, , , , …So does this polynomial that Euler reportedly constructed:

So, Euler considered the preceding equation to be equivalent to:

Then, he had equated the coefficient of in both to get the result:

.

Thus, .

**Later on, Euler had provided a few more alternate and rigorous proofs of this result.**

**Reference: Popular Problems and Puzzles in Mathematics by Asok Kumar Mallik, IISc Press, Foundation Books.**

**Amazon India link:**

*Hope you all enjoyed it — learning to think like Euler !! By the way, it did take a long time for even analysis to become so rigorous as it is now….You might like this observation a lot. ๐ ๐ ๐*

Nalin Pithwa.

# An algebra question for RMO or Pre-RMO

**Question:**

If a, b, c are non-negative real numbers such that , then prove that the product abc cannot exceed 1.

*Solution will be posted after you attempt it…so that you can compare the two approaches.*

Nalin Pithwa.

# RMO Training: taking help from Nordic mathematical contest: 1988

**Problem:**

Let be a smallest value of the function . Prove that when .

**Proof:**

For ,

.

From this, we see that for and . Consequently, attains its maximum value in the interval . On this interval

So, . But,

As , the first term on the right hand side tends to the limit . In the second term, the factor

of the numerator tends to zero because

.

So,

auf wiedersehen,

Nalin Pithwa.

**Reference: Nordic Mathematical Contest, 1987-2009.**