New answers tagged

1 vote

Magic OEIS formulae (Cops' thread)

A160155, 125 bytes Offset: 1 (that is, \$f(1) = 1, f(2) = 1, f(3)=6, ...\$) The decimal expansion of the single real root of \$x^5 - x-1\$, \$1.1673...\$. Using ...
Command Master's user avatar
1 vote

Generate Matching Regexes

Python3, Score: 762/50 = 15.24 in ~30.51 seconds ...
Ajax1234's user avatar
  • 6,373
0 votes

The Versatile Integer Printer

not so much 6 "languages" as peculiarities between 6 ways of using awk ...
RARE Kpop Manifesto's user avatar
2 votes

Fewest (distinct) characters for Turing Completeness

Vyxal, 3 characters `/¢ This answer has been several months in the making. I've spent a lot of time trying to find a 3-character Turing-Complete subset of Vyxal, ...
emanresu A's user avatar
  • 34.5k
0 votes

List Sophie Germain primes

Ruby -rprime, 34 bytes, score 58 Prints infinitely and should be able to exceed 2**32 due to native support for large numbers, ...
Value Ink's user avatar
  • 12.4k
0 votes

Avoid repeating letters between five simple programs

Ruby -rprime, 398 bytes I don't know why I decided to try this. -rprime flag loads the Prime ...
Value Ink's user avatar
  • 12.4k
2 votes

Avoid repeating letters between five simple programs

Itr, 83 bytes, no characters repeated between programs The five programs separated by newlines: ...
bsoelch's user avatar
  • 4,781
3 votes

Repeat your program to print Fibonacci numbers

Lambda calculus (Ben Lynn's Nat), 46 bytes (\n.n(\px.Sp(BxSB))K(KI)I)\f.(\l.SB(lf)f)\g.KI Try it online! (Instructions: delete all the code there, copy the body n ...
Bubbler's user avatar
  • 73.2k
4 votes

Repeat your program to print Fibonacci numbers

Labyrinth, 14 bytes # -( : =+{!@ Try it online! Try it online! (6x) The "repeat the source" requirement is extremely hard in Labyrinth (maybe easier ...
Bubbler's user avatar
  • 73.2k
0 votes

Largest Number Printable

Vyxal D, at least \$42781\underbrace{!!!!!…}_{42781\underbrace{!!!…}_{42781}\$ ...
The Empty String Photographer's user avatar
2 votes

Remove vowels without using too many different characters

Itr, 4 distinct characters, 5197 bytes newlines for readability ...
bsoelch's user avatar
  • 4,781
0 votes

Remove vowels without using too many different characters

Pascal, 35 distinct characters This complete program requires a processor supporting features of Extended Pascal (as defined by ISO standard 10206), in particular ...
Kai Burghardt's user avatar
1 vote

Remove vowels without using too many different characters

Vyxal, 18 bitsv2, 2.25 bytes, 2 distinct characters 011110011111001000 Try it Online! (link is to bitstring) Vyncode FTW! The actual program is encoded as a ...
Pacmanboss256's user avatar
1 vote

Remove vowels without using too many different characters

Lexurgy, 17 distinct, 28 bytes a: {a,e,i,o,u,A,E,I,O,U}=>* If we didn't have to support uppercase letters, 12 distinct, 18 bytes: ...
bigyihsuan's user avatar
  • 8,258
0 votes

Remove vowels without using too many different characters

Befunge-98 (PyFunge), 11 distinct characters, 263 bytes ...
yeah ok nice's user avatar
1 vote

Remove vowels without using too many different characters

Ruby, 8 distinct, 557 bytes ...
Value Ink's user avatar
  • 12.4k
1 vote

Remove vowels without using too many different characters

Lua, 12 distinct characters, 3245 2924 bytes ...
bluswimmer's user avatar
4 votes

Repeat your program to print Fibonacci numbers

Python 3.8 (pre-release), 41 bytes, not unary solution for i in(1,a:=0): i,a=i+a,i or+print(a)# Try it online!
Jakque's user avatar
  • 2,608

Top 50 recent answers are included