Glimpses of the Geniuses - Part 1

Self taught Indian genius mathematacian S Ramanujan does not require any introduction and he was the man who knew infinity.

This small app deals with one of his famous problems and two other number related problems.

This app deals with the following three problems :

1. Continued Fraction mode :

Continued Fraction as described in Wikipedia :

In mathematics, a continued fraction is an expression obtained through an iterative process of representing a number as the sum of its integer part and the reciprocal of another number, then writing this other number as the sum of its integer part and another reciprocal, and so on. In a finite continued fraction (or terminated continued fraction), the iteration / recursion is terminated after finitely many steps by using an integer in lieu of another continued fraction.

(i;f1,f2,f3 ...) means i+1/(f1+(1/f2+1/(f3+ ...
where i is the integer part and f1, f2, f3 ... after evaluation gives the fractional part.

If you enter a fraction like 123 / 456 or a decimal number like 3.1415926, it will give some terms of the equivalent continued fraction.

*** Continued fraction contains only a few terms and may not be exact.


2. Problem Mode :

In this mode a famous problem of the great genius S Ramanujan is given.

The problem goes like :

Ramanujan said the house of his friend was in a long street, numbered on this side one, two, three, and so on, and that all the numbers on one side of him added up exactly the same as all the numbers on the other side of him.

He said he knew there was more than fifty houses on that side of the street, but not so many as five hundred.

Ramanujan took a pencil and worked out the number of the house where his friend lived.

In this mode if you enter the minimum and maximum number of houses, app will calculate the desired house number.

*** There may not be a solution for the entered numbers.

3. Fibonacci Mode:

Fibonacci number as described in Wikipedia :

In mathematics, the Fibonacci numbers are the numbers in the following integer sequence, called the Fibonacci sequence, and characterized by the fact that every number after the first two is the sum of the two preceding ones:

1,1,2,3,5,8,13,21,34,55,89,144 ...

Any +ve integer can be expressed as a sum of distinct Fibonacci numbers. In this mode if you enter a +ve integer between 1 to 1000, the entered number will be represented as a sum of distinct Fibonacci numbers.

*** The representation of this sum may not be unique and exhaustive.

Have some fun with this simple app.

This app has NO-ADD, NO IN-APP PURCHASE and is ABSOLUTELY FREE.

If there is any bug please let me know through email.