Euler Project problems can be addictive. This one gave me fits.
If a box contains twenty-one coloured discs, composed of fifteen blue discs and six red discs, and two discs were taken at random, it can be seen that the probability of taking two blue discs, P(BB) = (15/21)×(14/20) = 1/2.
The next such arrangement, [...]
I have not worked a Euler Project problem in some time. Here’s problem 183:
Let N be a positive integer and let N be split into k equal parts, r = N/k, so that N = r + r + … + r.
Let P be the product of these parts, P = r × [...]
Another Euler problem. It has a cute recursive solution, and the problem looks like something that might have real applications, say the scoring of a decision tree. I’ll leave the description of the problem to link above. Might as well send Project Euler some link love. And it would be tedious to provide the nice [...]
Project Euler has a bunch of interesting mathematical programming challenges. I think they’re great for helping to learn a new language, and so will be using a few of the Euler problems to help me learn Erlang.
Here is the first problem.
If we list all the natural numbers below 10 that are multiples of 3 or [...]
Another Euler problem.
Find the greatest product of five consecutive digits in the 1000-digit number.
73167176531330624919225119674426574742355349194934
96983520312774506326239578318016984801869478851843
85861560789112949495459501737958331952853208805511
12540698747158523863050715693290963295227443043557
66896648950445244523161731856403098711121722383113
62229893423380308135336276614282806444486645238749
30358907296290491560440772390713810515859307960866
70172427121883998797908792274921901699720888093776
65727333001053367881220235421809751254540594752243
52584907711670556013604839586446706324415722155397
53697817977846174064955149290862569321978468622482
83972241375657056057490261407972968652414535100474
82166370484403199890008895243450658541227588666881
16427171479924442928230863465674813919123162824586
17866458359124566529476545682848912883142607690042
24219022671055626321111109370544217506941658960408
07198403850962455444362981230987879927244284909188
84580156166097919133875499200524063689912560717606
05886116467109405077541002256983155200055935729725
71636269561882670428252483600823257530420752963450
Scanning through some of the many Project Euler problems, I could see that converting large integers into lists of digits was going to be a recurring theme, so I decided to handle it once and for all.
integer_to_digits(N) ->
[...]
Another Project Euler problem:
2^15 = 32768 and the sum of its digits is 3 + 2 + 7 + 6 + 8 = 26.
What is the sum of the digits of the number 2^1000?
Here ^ denotes exponentiation. And there’s the first rub. The Erlang math:pow/2 function returns a floating point approximation, so we need to [...]
Posts