Background When I was in elementary school, we used to play a game in math class that goes as follows. All kids sit in a big circle and take turns counting, starting from 1. However, the following numbers must be skipped while counting: Numbers that are multiples of 3. Numbers that have a 3...

inspired by Count down from infinity Given a non-negative integer N, output the number of repetitions of the following steps it takes to reach 0: Convert N to binary (4812390 -> 10010010110111001100110) Flip each bit (10010010110111001100110 -> 01101101001000110011001) Trim leading zeroes (011...

Note: this is heavily inspired by this question. Task: Your task is to generate the nth prime, when each character of your program is repeated n times in place. Let's say your program is: Derp Every character in there is repeated once, so it should output 2. When every character is duplica...

Given a string, first square it as follows: First, write the string. abcde Next, write the string rotated one left. abcde bcdea Keep doing this until you have written len(string) lines. abcde bcdea cdeab deabc eabcd Now, read from the string like this: ----+ +--+| |+>|| |+-+| +---+ W...

Consider the string abcbabcba. The unpalindromized string is abcba, which is also a palindrome. But if you unpalindromize it once more, you get abc, which is not a palindrome. So, call abcbabcba is an palindrome of degree 2, since there were two palindromes. Your task is to determine the palindr...