popularity-contest
You are to create a program that creates exact clones of itself infinitely until stopped. Whatever is in the original program must be in the clones. In other words, the clones and original program are the same in every way except for that the clones are text files.
Rules:
...
What can I spell?
My mother-in-law has a set of wooden blocks that together spell out fRoSty The Snowman. Specifically, f, R, o, S, t, and y are all painted on separate blocks (note that R and S are capitalized). And then there's one longer block that says The Snowman.
However, each block al...
Anonymous
Anonymous
Anonymous
Anonymous
Anonymous
Anonymous
Anonymous
-1
Inspired by this article.
The goal is to output the largest natural number possible using a program with fewer than 100 bytes. Your program must terminate.
The number must be output to standard output, as a decimal number. (No interpreting the number in a different base or using e+100.)
You a...
Introduction
Let's observe the following array:
[1, 1, 1, 2, 2, 1, 1, 1, 1, 2, 2, 2, 1, 1, 1]
A group consists of the same digits next to each other. In the above array, there are 5 different groups:
[1, 1, 1, 2, 2, 1, 1, 1, 1, 2, 2, 2, 1, 1, 1]
1, 1, 1
2, 2
1, 1...
Anonymous
Given a positive number n, output all distinct multiplicative partitions of n in any convenient format.
A multiplicative partition of n is a set of integers, all greater than one, such that their product is n. For example, 20 has the following distinct multiplicative partitions:
2 * 2 * 5
2 * 1...
