dd4cdf4d53
Prime generator class - primes range method working.
2017-07-08 19:57:01 -07:00
d21eeb5161
adding not-quite-functional version of prime generator, for backup.
2017-07-08 17:40:32 -07:00
cdab5dd627
adding continued fraction problem solution (057)
2017-07-08 15:19:58 -07:00
aa69425168
Updating BOP class with clarifying comment and adding problem.
2017-07-08 15:18:40 -07:00
a74238f2f7
clean up javadoc in 102.
2017-07-08 15:17:46 -07:00
360d703d8e
adding solution to problem 102 - triangles containing origin.
2017-07-08 14:36:06 -07:00
2c6883525d
adding 058 problem statement
2017-07-08 02:40:12 -07:00
d6c96bedac
adding problem statements for 018 and 019
2017-07-08 02:28:36 -07:00
5a71ec62ec
adding problem 101 makefile
2017-07-08 01:45:37 -07:00
9006d77b43
committing finished version of BOP from day ago.
2017-07-08 01:45:22 -07:00
c1eb0f96cb
yay!
2017-07-08 01:44:40 -07:00
31b68f5d12
Adding algorithm to generate primes in a stream, i.e., starting from m and going to n.
2017-07-07 16:53:52 -07:00
101fe9a3d3
Adding working version of test for 8 divisors, problem 501.
2017-07-07 13:22:20 -07:00
39cc30bc93
Adding working test version for optimal polynomial solution.
2017-07-07 01:38:53 -07:00
4f48237b6b
Lychrel number, yet another one to practice palindromes.
2017-07-06 20:25:29 -07:00
193cbd2416
add make clean command.
2017-07-06 19:54:05 -07:00
15d67b3ca8
Adding Euler Solution interface, Euler Test class, and first problem using this format.
2017-07-06 19:53:38 -07:00
c29d3b2635
adding java directory, with proper unit tests.
2017-07-06 19:52:11 -07:00
abc8304f23
Update Poker solution - straight check was broken. Everythign now working.
2017-07-06 15:55:05 -07:00
72f3432b47
Committing finished versions of all methods, plus some major bug fixes. All five tests passing now.
2017-07-06 15:17:15 -07:00
dc6bdbc87b
Adding powerful digit sum. Sometimes it is a matter of knowing when to use the brute force solution.
2017-07-06 12:34:54 -07:00
ce9f95df69
Making progress. Have laid out tests, poker hand class, comparators, and poker cards. Finished implementing several outcomes, have a few left to go.
2017-07-06 03:48:12 -07:00
c756600292
adding initial version that parses poker hands.
2017-07-05 02:59:03 -07:00
681f4186c7
cleanup for problem 100.
2017-07-05 02:35:53 -07:00
7ec81b86a4
adding 20.
2017-07-05 02:35:04 -07:00
4a6ff8e5f4
adding makefile
2017-07-05 02:29:18 -07:00
e2d5860f5e
Finally got this one. Have to update n and b, simultaneously, after computing their new values.
2017-07-05 02:28:46 -07:00
9c9064864d
unsuccessful in finding solution to PE 100 with integer square root idea...
2017-07-05 02:04:37 -07:00
c7c36031f9
fixing up problem 501 statement
2017-07-04 21:17:10 -07:00
98f5cccf3a
Adding 053, combinatoric values greater than 1 million.
2017-07-04 21:04:27 -07:00
00448f77ad
not using this.
2017-07-04 20:08:05 -07:00
c99c655cd0
Adding permuted multiples problem - program design was central.
2017-07-04 19:56:08 -07:00
6ec861c133
adding sums of digits of powers of 2 checker.
2017-07-04 19:27:19 -07:00
aba2868380
Adding number letter counts script. Interval thinking, and method chaining.
2017-07-04 19:07:49 -07:00
b2414b216f
Add 016, sum of digits of 2**1000. Very quick with BigInteger.
2017-07-04 17:37:21 -07:00
0205bb16e9
updating readme.
2017-07-02 13:37:33 -07:00
dce13543dc
Committing actual problem solution.
...
This expands the 1-digit example *3 into a routine that
replaces 2 and 3 digits. Knowing that we had to go past 2
took a while.
2017-07-02 13:27:26 -07:00
fb464af82d
todo item for problem 500.
2017-07-02 04:45:33 -07:00
7a95cb5970
add javadocs, make the size M of our candidate number a parameter.
2017-07-02 03:22:54 -07:00
e07859aa08
Adding problem 51 - worked out example.
2017-07-02 03:13:13 -07:00
de2a0b34fc
adding makefile for problem 12
2017-07-01 23:57:56 -07:00
12fd3b6144
add problem file to problem 11.
2017-07-01 23:57:36 -07:00
79996da29c
adding (untracked??) problem 10 solution.
2017-07-01 23:57:18 -07:00
6f72dac3af
renaming problem 001 file.
2017-07-01 23:56:35 -07:00
2b92edec31
adding a working, but mod-less, answer to problem 500.
...
Note that this will completely blow up with large inputs.
However, it is working for small inputs, i.e., we can find
numbers with 2^4, 2^5, 2^6, etc. factors correctly
(checked with Wolfram Alpha).
2017-07-01 23:55:20 -07:00
44d6363218
update collatz recursive version and makefile.
2017-07-01 01:29:07 -07:00
21bf8ab918
Adding a version of Collatz sequence program that does not use recursion.
2017-07-01 01:28:35 -07:00
50dfb93684
Updating problem.txt files for each problem.
2017-06-30 20:15:40 -07:00
24df376856
Adding supplementary problem files for Problem 13, Digit Sum.
2017-06-30 20:11:57 -07:00
f5dd691b95
removing unneeded javadocs comment.
2017-06-30 20:11:04 -07:00
