Activity for Quintec
| Type | On... | Excerpt | Status | Date |
|---|---|---|---|---|
| Edit | Post #279201 | Initial revision | — | about 4 years ago |
| Answer | — |
A: Evaluate a single variable polynomial equation Japt, 12 bytes ÊÆgX VpXÃr+ Loops through the range of integers 0 to n-1, calculates each term, and sums. Try it (more) |
— | about 4 years ago |
| Comment | Post #279199 |
I thought this was a nice, simple challenge to start things off (more) |
— | about 4 years ago |
| Edit | Post #279199 | Initial revision | — | about 4 years ago |
| Question | — |
Prime Difference Given an integer n, output the smallest prime such that the difference between it and the next prime is at least n. For example, if `n=5`, you would output `23`, since the next prime is `29`, and `29-23>=5`. More Input/Output Examples 1 -> 2 (3 - 2 >= 1) 2 -> 3 (5 - 3 >= 2) 3 -... (more) |
— | about 4 years ago |
| Edit | Post #279170 | Initial revision | — | about 4 years ago |
| Answer | — |
A: "Hello, World!" Japt, 11 bytes `HÁM, Wld! Just using Japt's builtin compression. Test it (more) |
— | about 4 years ago |