|
|
6a393c7441
|
adding problem 12 back in - still slow, but much faster.
|
2017-07-17 03:34:43 -07:00 |
|
|
|
7f71a8b235
|
add main routine for problem 10
|
2017-07-17 03:34:19 -07:00 |
|
|
|
9203d84f8e
|
fix highly factorable triangular number search to run faster
|
2017-07-17 03:32:36 -07:00 |
|
|
|
cf858a617e
|
speed up
|
2017-07-17 03:09:52 -07:00 |
|
|
|
301f03bc91
|
add makefile for problem 63.
|
2017-07-17 02:44:19 -07:00 |
|
|
|
f65823d02a
|
update solution for problem 62 to compile/return correctly.
|
2017-07-17 02:42:53 -07:00 |
|
|
|
3331c149e4
|
fixing typo in javadocs.
|
2017-07-17 02:40:56 -07:00 |
|
|
|
4e6e1a18c8
|
correct typo in javadocs.
|
2017-07-17 02:40:13 -07:00 |
|
|
|
06df0f56f5
|
adding problem 61.
|
2017-07-17 02:39:46 -07:00 |
|
|
|
bc71a19e41
|
memoize integer powers.
|
2017-07-15 04:33:54 -07:00 |
|
|
|
66d857d17f
|
eliminating outer loop from ordering.
|
2017-07-15 04:15:04 -07:00 |
|
|
|
d8298a0dab
|
Fixing bigmultiply algorithm to decide, ad hoc, which factor generating pattern to use. this is much more efficient than trying every single one.
|
2017-07-15 04:02:09 -07:00 |
|
|
|
4b34c1bed4
|
Updating ordering - shows that smallest number with 2^n factors is ALWAYS of form p1*p2*...*pn
|
2017-07-15 02:30:41 -07:00 |
|
|
|
b2394da5b5
|
running numerical experiment to check ordering of factor generators for numbers with 2^6 factors.
|
2017-07-15 02:17:23 -07:00 |
|
|
|
1c50759043
|
adding caveat.
|
2017-07-15 01:30:14 -07:00 |
|
|
|
58e66c304e
|
wrong approach - combining primes in incorrect way.
|
2017-07-14 15:02:18 -07:00 |
|
|
|
49738e8635
|
moving main functionality into FactorGenerator class.
|
2017-07-14 05:42:35 -07:00 |
|
|
|
fe1bf9321a
|
Adding a nice hash map solution for problem 062.
|
2017-07-14 03:48:06 -07:00 |
|
|
|
c8506868b7
|
almost forgot 0^1.
|
2017-07-14 03:04:38 -07:00 |
|
|
|
6dab1f1602
|
add continued fraction method. only small modifications made.
|
2017-07-14 02:48:59 -07:00 |
|
|
|
26b243f8aa
|
Adding problem 64 with correct level of accuracy.
|
2017-07-14 02:48:27 -07:00 |
|
|
|
fce9c3a0d1
|
add clean rule
|
2017-07-14 02:09:29 -07:00 |
|
|
|
66cbf992e2
|
adding solution. using e and not sqrt(2).
|
2017-07-14 02:09:05 -07:00 |
|
|
|
95f63493a1
|
able to replicate 10 terms of sqrt(2) and e continued fraction sequences given in problem 65.
|
2017-07-14 01:58:51 -07:00 |
|
|
|
806edbf5df
|
correctly computing 100th term.
|
2017-07-14 01:52:00 -07:00 |
|
|
|
e0fbec6208
|
adding useful resources list
|
2017-07-14 01:51:11 -07:00 |
|
|
|
2d8ff8ec22
|
adding problem and makefile for problem 65
|
2017-07-14 01:40:40 -07:00 |
|
|
|
b24a969540
|
adding method to get continued fraction representation of e.
|
2017-07-14 01:40:03 -07:00 |
|
|
|
c2e0f8b749
|
Moving continued fraction to BigInteger/BigDecimal verison. Spent a while realizing I needed to input D, not x.
|
2017-07-14 01:27:14 -07:00 |
|
|
|
4ace910738
|
Adding javadoc to BigDecimal square root method.
|
2017-07-14 00:48:29 -07:00 |
|
|
|
65c5e69212
|
Bingo. Some trickiness involved in getting the BigDecimal implementation of continued fraction representation correct.
|
2017-07-14 00:47:42 -07:00 |
|
|
|
67f6e17947
|
working ok for D<=100.
|
2017-07-13 23:26:57 -07:00 |
|
|
|
b439f89743
|
Working out an indexing error with convergents calculation.
|
2017-07-13 23:23:39 -07:00 |
|
|
|
f7c1018ec3
|
Return -1 if D is a perfect square.
|
2017-07-13 22:47:24 -07:00 |
|
|
|
11143bd30e
|
adding non-working solution. template ok, but int overflow.
|
2017-07-13 22:25:15 -07:00 |
|
|
|
92d8177cd3
|
adding makefile
|
2017-07-13 22:05:08 -07:00 |
|
|
|
2823e9c370
|
adding method to 66 to compute convergents.
|
2017-07-13 22:04:47 -07:00 |
|
|
|
6bbb0bc4c9
|
Merge branch 'master' of https://charlesreid1.com:3000/cs/euler
* 'master' of https://charlesreid1.com:3000/cs/euler:
update problem 501 for running on jupiter machine.
|
2017-07-13 20:27:05 -07:00 |
|
|
|
57b5c117ce
|
adding problem 66, and adding continued fraction javadocs.
|
2017-07-13 20:26:40 -07:00 |
|
|
|
680c7a5ed9
|
adding description of proposed solution procedure.
|
2017-07-13 20:26:14 -07:00 |
|
|
|
96623ab342
|
update problem 501 for running on jupiter machine.
|
2017-07-13 03:39:00 -07:00 |
|
|
|
7c470a2c32
|
adding problem statement for prob 502.
|
2017-07-12 00:50:36 -07:00 |
|
|
|
be6bec8fe1
|
adding problem 502, program to draw a random castle.
|
2017-07-12 00:49:06 -07:00 |
|
|
|
98b3694258
|
adding problem 19 solution.
|
2017-07-11 23:59:29 -07:00 |
|
|
|
536bdfbc2e
|
adding problem 18 to euler test.
|
2017-07-11 22:25:49 -07:00 |
|
|
|
9f22f194a2
|
Adding problems 16 and 17.
|
2017-07-11 22:22:11 -07:00 |
|
|
|
c280af234a
|
removing old files - moved to scratch.
|
2017-07-11 21:25:44 -07:00 |
|
|
|
179d3e490a
|
adding problem 15
|
2017-07-11 21:25:32 -07:00 |
|
|
|
4e59589b3f
|
adding problem 13 and 14 to euler test.
|
2017-07-11 21:19:58 -07:00 |
|
|
|
14edc6d102
|
Adding problems 8 through 12.
|
2017-07-11 21:11:51 -07:00 |
|
