-1
Background
Rayo's function is a googological (extremely fast growing) function. It grows faster than the busy beaver function and runs on first order set theory. I want to be able to calculate Rayo's function, which is defined as "Rayo(n) is the smallest positive integer bigger than any finite p...
Shift the digits. code-golf integer arithmetic restricted-time
Given a single positive integer (say x), output the first positive integer that puts its last digit to its first digit after being multiplied by x.
Here is an example of putting something's last digit to its first digit, as that may...
CodeDrawing one-liner
Teaser
Behold this formidable drawing:
Can you draw this in a single stroke? Give it a try.
Can you do this one, now:
Give it a try.
How it works
These "make this drawing with one pen stroke" problems are graph-theory problems with a rather simple solution. For ea...
Pipe a short stream to the following Java program run with accompanying command line options.
class Code implements java.io.Serializable {
private static final long serialVersionUID = 0L;
private static long count;
@Override public int hashCode() {
++count;
return s...
Rules
You have a list (L) that contains integers and strings. Your task is to move all strings to the end of the list and all integers to the
beginning of the list.
It is a code-golf so the lowerest score wins.
Make a program that calculates SKIO calculus output of a given string.
Instructions:
Take a binary string as input.
Output the result.
Write it in as short as you can. Shortest code wins.
More at https://googology.wikia.com/wiki/Xi_function.
Merge list2 into list1, between a and b
+----------------------------------------+
| a b |
| l1 = (1)->(2)->(3)->(4) |
| |
| l2 = (5)->(6)->(7)->(8)->(9) |
| ...
code-bowlingn't
code-golfstring
If you place the suffix n't on any given word, it instantly means the opposite of the intended usage of the word.
If you place the word not before any given word, it instantly negates the next word.
Therefore, today's challenge is about turning words in the for...
Finding Radical Ideals
Finding radicals of arbitrary ideals in rings is hard! However, it's a doable task in polynomial rings, since they are Noetherian (all ideals are finitely generated)
Background
A ring is a set, paired with two binary operations + and * such that 0 is a additive identity,...
