Activity for Razetime
| Type | On... | Excerpt | Status | Date |
|---|---|---|---|---|
| Question | — |
The Ludic Numbers The Ludic Numbers are a sequence that pops up when you apply the sieve of eratosthenes to the natural numbers, completely removing the numbers every iteration. Here is how they are generated: The Ludic numbers start with the lists: ``` l = [1] n = [2,3,4,5,6,7,8,9,10....] ``` Every itera... (more) |
— | about 3 years ago |
| Edit | Post #284221 |
Post edited: |
— | about 3 years ago |
| Edit | Post #284221 | Initial revision | — | about 3 years ago |
| Article | — |
The Ludic Numbers[FINALIZED] The Ludic Numbers are a sequence that pops up when you apply the sieve of eratosthenes to the natural numbers, completely removing the numbers every iteration. Here is how they are generated: The Ludic numbers start with the lists: ``` l = [1] n = [2,3,4,5,6,7,8,9,10....] ``` Every itera... (more) |
— | about 3 years ago |
| Edit | Post #284198 | Initial revision | — | about 3 years ago |
| Answer | — |
A: Collatz conjecture; Count the tries to reach $1$ [BQN], 31 28 bytes {1+(1≠𝕩)◶¯1‿𝕊2(|⊑÷˜∾1+3×⊢)𝕩} Try it online! An anonymous function which takes a number. the `¯1` branch is a bit tacky but saves a byte over `(1+𝕊)`. (more) |
— | about 3 years ago |
| Comment | Post #279434 |
errors are ok as long as the correct output is on STDOUT. (more) |
— | about 3 years ago |
| Comment | Post #284102 |
18 bytes: [Try it online!](https://tio.run/##yyr8/z9aQ69YX0lJMzpWSy8vtiYxJeX//2ouBQWlYiUrJY/UnJx8hfD8opwUJR2QYJ6SlRFXLQA "jq – Try It Online") (more) |
— | about 3 years ago |
| Comment | Post #283989 |
No, all the outputs should be in the same format. (more) |
— | about 3 years ago |
| Comment | Post #284102 |
you can use `add` in place of join. (more) |
— | about 3 years ago |
| Edit | Post #284071 | Initial revision | — | about 3 years ago |
| Answer | — |
A: Digit Sum Integer Sequence (working title) [jq], 38 bytes while(1;.+("\(.)"|explode|max+min-96)) Try it online! prints the infinite sequence starting with \$n\$. (more) |
— | about 3 years ago |
| Edit | Post #284067 | Initial revision | — | about 3 years ago |
| Answer | — |
A: Stairs? Stairs! Stairs. Stax, 8 bytes Ç▐GcΦ≡◘¶ Run and debug it Uses spaces as the staircase fill. (more) |
— | about 3 years ago |
| Edit | Post #283858 |
Post edited: |
— | about 3 years ago |
| Suggested Edit | Post #283858 |
Suggested edit: (more) |
helpful | about 3 years ago |
| Edit | Post #284007 | Initial revision | — | about 3 years ago |
| Answer | — |
A: My house is destroyed! Can you make me one? [Charcoal], 7 bytes ＧＨ↑→↓Ｎ# Try it online! Link is to verbose version of code. `PolygonHollow` exactly fits this challenge. > Prints a polygon with sides in x, all with length y, and the z used for the sides, repeating from the origin. Polygon is not autoclosed or filled. (more) |
— | about 3 years ago |
| Comment | Post #283790 |
7 bytes: `#＊⌐⤢ｎ↔ｎ` (more) |
— | about 3 years ago |
| Comment | Post #283751 |
just a JSON array of quoted strings, or quoted strings on multiple lines (more) |
— | about 3 years ago |
| Comment | Post #283790 |
8 bytes: `#＊#╴»×＋│`
(more) |
— | about 3 years ago |
| Comment | Post #283751 |
Is a list of lines allowed as output?
(more) |
— | about 3 years ago |
| Comment | Post #283989 |
leading zeroes are not allowed in the output. (more) |
— | about 3 years ago |
| Edit | Post #283989 | Initial revision | — | about 3 years ago |
| Question | — |
When The Ternary Is Balance Inspired by this Rosetta Code article. Introduction Balanced Ternary is a method of representing integers using -1, 0 and 1 in base 3. Decimal 11 = (1 32) + (1 31) + (−1 30) = [1,1,-1] or "++-" Decimal 6 = (1 32) + (−1 31) + (0 30) = [1,-1,0] or "+-0" Task Given any integer, y... (more) |
— | about 3 years ago |
| Edit | Post #283874 |
Post edited: |
— | about 3 years ago |
| Edit | Post #283977 | Initial revision | — | about 3 years ago |
| Answer | — |
A: "Hello, {name}!" [jq], 14 bytes "Hello, \(.)!" Try it online! jq has expression interpolation, pretty epic! (more) |
— | about 3 years ago |
| Comment | Post #283973 |
-1 changing to `n*=i` (more) |
— | about 3 years ago |
| Edit | Post #283874 |
Post edited: |
— | about 3 years ago |
| Edit | Post #283874 |
Post edited: |
— | about 3 years ago |
| Edit | Post #283953 |
Post edited: |
— | about 3 years ago |
| Edit | Post #283953 | Initial revision | — | about 3 years ago |
| Answer | — |
A: Make my value binary [jq], 48 bytes [while(.>0;./2|floor)]|map(.%2)|reverse|join("") Try it online! jq is the Language of the month for September! if the output is not required as per the question, `join` can be omitted. (more) |
— | about 3 years ago |
| Comment | Post #283874 |
Sure, will add some. (more) |
— | about 3 years ago |
| Edit | Post #283874 | Initial revision | — | about 3 years ago |
| Article | — |
Balance my ternary[FINALIZED] Inspired by this Rosetta Code article. Introduction Balanced Ternary is a method of representing integers using -1, 0 and 1 in base 3. Decimal 11 = (1 32) + (1 31) + (−1 30) = [1,1,-1] or "++-" Decimal 6 = (1 32) + (−1 31) + (0 30) = [1,-1,0] or "+-0" Task Given any integer, y... (more) |
— | about 3 years ago |
| Edit | Post #283784 | Initial revision | — | about 3 years ago |
| Answer | — |
A: Make $2 + 2 = 5$ [Husk], 7 bytes +±Λ=2¹Σ Try it online! Input as a list. (more) |
— | about 3 years ago |
| Comment | Post #283305 |
just create a comment thread on the question named Trivial Builtins and post your answer under there. (more) |
— | over 3 years ago |
| Comment | Post #283305 |
hm, I guess you can post trivial answers in a separate thread. (more) |
— | over 3 years ago |
| Edit | Post #283343 | Initial revision | — | over 3 years ago |
| Answer | — |
A: Getting perfect squares, differently [Husk], 3 bytes ∫İ1 Try it online! Scan from left over all odd numbers with addition. Uses this formula: $$ n^2 = \sum{k=1}^n(2k-1) $$ (more) |
— | over 3 years ago |
| Edit | Post #283108 |
Post edited: |
— | over 3 years ago |
| Comment | Post #283312 |
they're correct by the definition of truthy and falsy values in husk. (more) |
— | over 3 years ago |
| Comment | Post #283312 |
You don't need signum (more) |
— | over 3 years ago |
| Edit | Post #283305 | Initial revision | — | over 3 years ago |
| Question | — |
Are All Elements Equal? Challenge Given a list of integers >= 0 , check if all of them are equal. Tests ``` [1,1,1,1,1] -> true [0,1,1,6,7] -> false [1] -> true [] -> undefined(you do not need to handle this) ``` You may take the integers in any form(strings, list, codepoints, etc.) Yo... (more) |
— | over 3 years ago |
| Edit | Post #283303 |
Post edited: |
— | over 3 years ago |
| Edit | Post #283303 |
Post edited: |
— | over 3 years ago |