Write a program or function that prints or outputs this exact text (consisting of 142 characters):
()()()()()()
|\3.1415926|
|:\53589793|
\::\2384626|
\::\433832|
\::\79502|
\::\8841|
\::\971|
\::\69|
\::\3|
\__\|
Your program must take no input (except in languages...
Anonymous
Anonymous
Anonymous
Anonymous
In number theory, the divisor summatory function is a function that is a sum over the divisor function. It frequently occurs in the study of the asymptotic behaviour of the Riemann zeta function. The various studies of the behaviour of the divisor function are sometimes called divisor problems.
== Definition ==
The divisor summatory function is defined as
D
(
x
)
=
∑
n
≤
x
d
(
n
)
=
∑
...
Prison Architect, ASCII version
code-golf ascii-art
Here is a diagram of a prison using ASCII characters:
+------------------------------+
| |
| X X |
| |
| D
D ...
Number Chaining Predicate
Your task is to decide if in a sequence of numbers, every number contains at least one of the digits of the number that preceded it.
For example, the following should return truthy:
[1, 12, 203, 0, 30]
^ ^ Contains a 0
^ Contains a 2
^ Con...
3
It has been my goal for a while to make a Brain-Flak answer on this question. As of post we are 30 characters away from achieving this (15 are allowed per post). I have developed an answer that will put us at 15 away, but because of the rules on the challenge no one may post twice in a row, so ...
