Learning F#

Project Euler – Problem 206 Solution

Problem Find the unique positive integer whose square has the form 1_2_3_4_5_6_7_8_9_0, where each “_” is a single digit. Solution Initially I started solving this problem by creating all permutations of 19 digits numbers which fits the required pattern and iteratively square rooting them to find a square root which is a whole number. Unfortunately …

Project Euler – Problem 206 Solution Read More »

Project Euler – Problem 33 Solution

Problem The fraction 49/98 is a curious fraction, as an inexperienced mathematician in attempting to simplify it may incorrectly believe that 49/98 = 4/8, which is correct, is obtained by cancelling the 9s. We shall consider fractions like, 30/50 = 3/5, to be trivial examples. There are exactly four non-trivial examples of this type of …

Project Euler – Problem 33 Solution Read More »

Project Euler – Problem 97 Solution

Problem The first known prime found to exceed one million digits was discovered in 1999, and is a Mersenne prime of the form 26972593-1; it contains exactly 2,098,960 digits. Subsequently other Mersenne primes, of the form 2p-1, have been found which contain more digits. However, in 2004 there was found a massive non-Mersenne prime which …

Project Euler – Problem 97 Solution Read More »

By continuing to use the site, you agree to the use of cookies. more information

The cookie settings on this website are set to "allow cookies" to give you the best browsing experience possible. If you continue to use this website without changing your cookie settings or you click "Accept" below then you are consenting to this.

Close