01:00 - 16:0016:00 - 23:00
Recently, I ran a script of code in R
that took an unknown, but lengthy, amount of time to run. I became somewhat impatient looking back and forth for the magical > to appear signifying that the code was done. Instead I ran the following code into the queue:
47 bytes
install.packages("beepr")
...
0
Fermat's polygonal number theorem
Fermata's polygonal number theorem states that every positive integer can be expressed as the sum of at most \$n\$ \$n\$-gonal numbers. This means that every positive integer can be expressed as the sum of up to 3 triangle numbers, 4 square numbers, 5 pentagonal...
Add two numbers with Rule 110
Background
It is known that Rule 110 is Turing complete, but in general, I have seen a lack of actual programs that utilize this property of Rule 110, so I propose that we do something about it ;)
The Challenge
I want you to add two numbers, unsigned, eight bits ...
Infinite output programs that wouldn't give all output given infinite resources
Example, loophole-violating code to output all integers:
bigint i = 0;
for(;;) bigint_print(i++);
This would never output negative numbers, even given unlimited resources, so it does not fulfil the challenge's req...
2
Given an input string of length 2 or longer consisting solely of alphabetical characters [A-Z] or [a-z] (your choice if they're all uppercase or all lowercase), output a continuous string of characters forming a double diamond pattern.
The input string starts on the center line and extends down-...
Anonymous
01:00 - 16:0016:00 - 23:00
