Background An \$n\$-bit Gray code is an ordering of \$2^n\$ binary sequences so that adjacent sequences always differ by exactly one bit. A Beckett-Gray code is a special kind of Gray code. In addition to being a Gray code, it has the following characteristics: It is cyclic: the last bit pattern...

Interpret the next answer This is an answer-chaining challenge where the aim is to write an interpreter for a specific language ("language X") in another language ("language Y"). Languages X and Y must be completely distinct, that is they must not be different versions of the same language, nor t...

Random Roman Numerals Printing a random number is easy, but what about roman numerals? Your task is to output a random roman numeral from 1 to 1000, both inclusive. Requirements: Each number has to have the same chance of appearing The program should use the language's random module or other ran...

Olympic vine-swingers perform their routines in standard trees. In particular, Standard Tree n has vertices for 0 up through n-1 and edges linking each nonzero vertex a to the vertex n % a below it. So, for example, Standard Tree 5 looks like this: 3 | 2 4 \ / 1 | 0 because the rema...

Definition \$a(1) = 1\$ \$a(2) = 2\$ \$a(n)\$ is smallest number \$k>a(n-1)\$ which avoids any 3-term arithmetic progression in \$a(1), a(2), ..., a(n-1), k\$. In other words, \$a(n)\$ is the smallest number \$k>a(n-1)\$ such that there does not exist \$x, y\$ where \$0<x<y<n\$ and \$a(y)-a(x) =...

The Recursively Prime Primes is are sequence of primes such that p(1) = 2 p(n) = the p(n-1)th prime Here is an example of how one might calculate the 4th Recursively Prime Prime. p(4) = the p(3)th prime p(3) = the p(2)th prime p(2) = the p(1)th prime p(1) = 2 p(2) = the 2nd prime p(2) = 3 p(3) =...

A friend of mine was learning python, and came across a problem: Loop through and print out all even numbers from the numbers list in the same order they are received. Don't print any numbers that come after 237 in the sequence. numbers = [ 951, 402, 984, 651, 360, 69, 408, 319, 601, 485, 980, 50...

Hello, Permutations! For this challenge, you will be required to write 3 programs: The first program should be a quine, i.e, it should print it's own source code. The second program should read the input and print all of it. The third program should simply print the string "Hello, World!". In a...

Liars and Guessers Github You have probably played, and may even have written a program to play, a simple number guessing game. If so, this probably looks familiar: Try to guess my number (1 to 100)! Please enter a guess: 50 Too small, guess again! Please enter a guess: 75 Too big, guess again! P...