Skip to content

Instantly share code, notes, and snippets.

View JossWhittle's full-sized avatar
😸

Joss Whittle JossWhittle

😸
View GitHub Profile
public void p23() {
int[] dif = new int[28124];
for (int i = 1; i < dif.length; i++) {
dif[i] = type(i);
}
int sum = 0;
for (int i = 1; i < dif.length; i++) {
int[] c = {0,1,2,3,4,5,6,7,8,9};
boolean fin = false;
int count = 1;
while (!fin && count < 1000000) {
int k = 0, j = 0;
for (int i = 0; i < c.length - 1; i++) {
public void p16() {
String v = "2";
for (int i = 2; i = 0; i--) {
int digit = (int)Character.digit(a.charAt(i), 10)
+ (int)Character.digit(b.charAt(i), 10)
+ carry;
if (digit > 9) {
carry = 1;
pascal :: Double -> Double -> Double
pascal r 0 = 1
pascal r c = (pascal r (c - 1)) * (((r + 1) - c) / c)
public void p14() {
int max = 0;
for (int i = 1000000; i > 0; i--) {
int c = collatz((long)i,2);
if (c > max) {
max = c;
}
}
37107287533902102798797998220837590246510135740250
46376937677490009712648124896970078050417018260538
74324986199524741059474233309513058123726617309629
91942213363574161572522430563301811072406154908250
23067588207539346171171980310421047513778063246676
89261670696623633820136378418383684178734361726757
28112879812849979408065481931592621691275889832738
44274228917432520321923589422876796487670272189318
47451445736001306439091167216856844588711603153276
70386486105843025439939619828917593665686757934951
1: 1
3: 1,3
6: 1,2,3,6
10: 1,2,5,10
15: 1,3,5,15
21: 1,3,7,21
28: 1,2,4,7,14,28
08 02 22 97 38 15 00 40 00 75 04 05 07 78 52 12 50 77 91 08
49 49 99 40 17 81 18 57 60 87 17 40 98 43 69 48 04 56 62 00
81 49 31 73 55 79 14 29 93 71 40 67 53 88 30 03 49 13 36 65
52 70 95 23 04 60 11 42 69 24 68 56 01 32 56 71 37 02 36 91
22 31 16 71 51 67 63 89 41 92 36 54 22 40 40 28 66 33 13 80
24 47 32 60 99 03 45 02 44 75 33 53 78 36 84 20 35 17 12 50
32 98 81 28 64 23 67 10 26 38 40 67 59 54 70 66 18 38 64 70
67 26 20 68 02 62 12 20 95 63 94 39 63 08 40 91 66 49 94 21
24 55 58 05 66 73 99 26 97 17 78 78 96 83 14 88 34 89 63 72
21 36 23 09 75 00 76 44 20 45 35 14 00 61 33 97 34 31 33 95
public void p9() {
for (int a = 1; a < 1000; a++) {
for (int b = a + 1; b < 1000; b++) {
double c = sqrt(Math.pow(a, 2) + Math.pow(b, 2), 1);
if (((int)c == c) && (a + b + c == 1000)) {
System.out.println((int)(a*b*c));
}
}
}
73167176531330624919225119674426574742355349194934
96983520312774506326239578318016984801869478851843
85861560789112949495459501737958331952853208805511
12540698747158523863050715693290963295227443043557
66896648950445244523161731856403098711121722383113
62229893423380308135336276614282806444486645238749
30358907296290491560440772390713810515859307960866
70172427121883998797908792274921901699720888093776
65727333001053367881220235421809751254540594752243
52584907711670556013604839586446706324415722155397