The vanilla factorial challenge code-golf math arithmetic factorial We already have the old factorial challenge, but it has some restrictions on the domain, performance, and banning built-ins. As the consensus here was to create a separate challenge without those restrictions so that more esolang...

Find the nth number m for which tan(m) > m code-golf math Task Write a program/function to output the \$n\$th number \$m\$ for which \$tan(m) \gt m\$. Note: \$m\$ is in radians Scoring This is code-golf so shortest bytes wins. Sample Testcases 1 -> 1 2 -> 260515 3 -> 37362253 5 -> 534483448 9 -

Solve the Halting Problem for Oneplis code-golf halting-problem Oneplis is a "very simple esolang" (I don't want to count this one toward my esolangs) made by me which only have three commands. As you can probably see from the name, it is a subset of 1+, along the lines of Befinge. The three comm...

The showcase is intended to, and was, a place to show and see new languages. In fact, it motivated me to learn ><>. But now, it's pretty much dead AFAIK. New languages keep coming in, but they usually get only 3 or 4 upvotes, which indicates not many people are actually viewing it; Good, hard-wor...

Sort Until Overflow The challenge: Assuming you have \$ X \$ collections, each collection \$ C_i \$ has a name \$ N_i \$ and a capacity \$ N_i \$ of elements - Determine which collection will be overflowed first while sorting a cyclic list of elements by their names to the relevant collections. ...

Noncommutative Quineoid Triple This is the hard mode of Quineoid Triple Write three different programs such that all of the following properties hold: \$ A(B) = C \$ \$ B(C) = A \$ \$ C(A) = B \$ \$ A(C) = -B \$ \$ B(A) = -C \$ \$ C(B) = -A \$ \$ A(A) = \epsilon \$ \$ B(B) = \epsilon \$ \$ C(C) ...

Quineoid Triple Uniqueness Optimization code-challenge source-layout This is a variant of Quineoid Triple with the same requirements but different scoring. Write three different programs such that when any one program is provided as input to one of the other two, you get the source of the remain...

Meta-golfing Numbers The Esolangs Wiki has a page here cataloging the shortest known programs in Brainf*** to generate a given number. A similar catalog could exist for any language: it would simply be a list of the shortest known programs in that language outputting a given constant. By extensio...

De-interleave log lines: HARD MODE code-golf string parsing In the face of some regrettable rules that turned the original into a glorified sorting task, I am posing a more challenging variant. Shout out to Luis Mendo for the suggestion of how to improve the original challenge. You've inherited ...

Make a quine that uses every function in your programming language. quine Task You are to make a quine where the interpreter executes every function your programming language supports (without importing modules) Example Example in brainf*** ->++>+++>+>+>+++>>>>>>>>>>>>>>>>>>>>+>+>++>+++>++>>+++>+>>>

Input A bound m <= 4294967295. Output Consider values sampled uniformly at random from integers in the range 0 to m, inclusive. Your output should be the expected (average) number of trailing series in the binary representation of the sampled value. Your answer should be exact, for example given ...