Input
no input for this challenge
The Challenge
Write a code that outputs:
The first 10 prime numbers whose sum of their digits equal the number of bytes of your code
Examples
Let's say your code is Co&%423@k"oo" which is 13 bytes
your code must output [67, 139, 157, 193, 229, 283, 337, ...
Neim, 10 bytes
98𝐋Λ𝐬10𝔼)Q
Try it online!
Outputs:
[19 37 73 109 127 163 181 271 307 433]
Explanation
98𝐋Λ𝐬10𝔼)Q
98𝐋 push a list of the first 98 primes
Λ for every element in the list above...
𝐬 sum the digits and...
10𝔼 check whether the sum i...
> Linux kernel coding style > First off, I’d suggest printing out a copy of the GNU coding standards, and NOT read it. Burn them, it’s a great symbolic gesture.
> strips which are variants of the infamous "pudding pops" strip may be submitted, but are placed in a special ultra-low-priority queue. There are nearly 100 unpublished strips in this queue, dating back to 2010. They will be trickled out extremely slowly, if at all
Related
Goats are great. Everybody loves goats.
And they also, for some reason, are an excellent complex ascii art for many languages to have built-ins for. Because of this, I personally feel a catalogue to document just how easily a language can print goats is greatly needed.
The Challenge
G...
@totallyhuman The problem with reduce is a known issue with the way functions are processed using automatic partial functions. It will be fixed fairly soon after I get home
COBOL is a very old language, at the time of writing it is 58 years old.
It is so old, in fact, that it has a very interesting quirk: the first six characters of each line are comments.
Why is this, you ask? Well, those 6 characters were intended to be used as line numbers, back in the day where...
Determine if a Graph is Toroidal
A simple graph is toroidal if it can be drawn on the surface of a Torus without any edges intersecting. Your task is to take a simple undirected graph via any reasonable method (adjacency matrix, edge vertex sets, etc.) and decide whether or not it is a toroidal...
Alright, when I said yesterday that I was going to try to write Cantor's unspeakable numbers in Parenthetic, I completely forgot that Parenthetic has nothing in the way of string processing to find "7"in`n`
Which mieans I have to write integer-to-string and back on my own
Input: a number n.
Output: A list or print to output which values are separated by a char different from new-line of all positions of diagonals of n^2.
Examples:
1
X
1
2
\/
/\
1 2 3 4
3
\#/
#X#
/#\
1 3 5 7 9
4
\##/
#\/#
#/\#
/##\
1 4 6 7 10 11 13 16
5
\###/
#\#/#
##X##
#/#\#
/###\
1 5 7 ...
prime_helper(_, 1).
prime_helper(N, Test) :-
Mod is mod(N, Test),
M is Test - 1,
dif(0, Mod),
prime_helper(N, M).
prime(N) :-
M is N - 1,
prime_helper(N, M).
code-golf ...?
Fork for n times
TL;DR: fork up to n times, than hang forever
Relevant chat discussion
Your challenge is to make a program / function that calls itself twice or uses some other method of creating copies of itself that create copies of itself, etc.
However, to avoid crashing...
You didn't correctly parenthesize the sub https://tio.run/##hZFLEsIgEET3OcUs6QU30MOgTEqqErQ0Cz19ZPikAkl0ARRveugGHubJfrrx5K7zrDoipUAKCiDLvfNcUCAJj3crLIwiBg1mvFiTUJzXTaB3y8IAfSLFtisbuV6HYF7z8OJSzusizAanc11oPI7yYP/Y5qqtZlFFB73llcevTPiTGodvKRV0kB@rIstWVOkNd5A0fQE