Commits

Author Commit Message Labels Comments Date
Shlomi Fish
Add more to the analysis
Shlomi Fish
Add an illustration.
Shlomi Fish
Add more
Shlomi Fish
Add Euler 147 analysis
Shlomi Fish
Add some programs that do not work.
Shlomi Fish
Solved Euler Project problem #139.
Shlomi Fish
Start writing the analysis.
Shlomi Fish
Add the analysis for #142.
Shlomi Fish
Add some faster programs. Still not fast enough. These programs see which modulos are possible for n to be and do stuff based on it. The euler-138-2.pl handles only the 5n^2+4n+1 case.
Shlomi Fish
Fix a bug. h must be odd - not even.
Shlomi Fish
Add the (too slow so far) solution to Euler #138.
Shlomi Fish
Add more to Euler #152 - still not good enough.
Shlomi Fish
Tracing.
Shlomi Fish
More, but still too slow.
Shlomi Fish
Implement Euler 152 - still too slow.
Shlomi Fish
Start writing Euler 152.
Shlomi Fish
Add some to 138.
Shlomi Fish
Reduced the number of prints. Now it yields a solution sooner.
Shlomi Fish
Removed the trace.
Shlomi Fish
Fast solution.
Shlomi Fish
The solution was too slow. Trying to optimize it.
Shlomi Fish
Add the solution to Euler #134.
Shlomi Fish
Inefficient solution - not working.
Shlomi Fish
Copying.
Shlomi Fish
Solved Euler #135.
Shlomi Fish
Solved Euler #131.
Shlomi Fish
A small refactoring/optimisation.
Shlomi Fish
Solved Euler #126 (finally). The final, better, approach is in take 4.
Shlomi Fish
Add more.
Shlomi Fish
Convert the record to an array ref instead of a hash ref. A small optimisation.
  1. Prev
  2. Next