Given an integer n, return the number of ways that n can be written as a list of prime numbers. For example, 2323 can be written as (2,3,23), (23,23) or (2,3,2,3) or (23,2,3), so you would output 4. If it can not be written in this way, you should output 0. A prime number such as 019 or 00000037...

Let's write a Minifier code-golf Background Minifiers are used, commonly, when serving JavaScript to your Web Browser. It is commonly used to reduce the number of bytes that have to be sent. Saving bandwidth is useful for obvious reasons. Some people use obfuscaters (that intentionally ma...

I know most equations can be easily solved by Newton's method, and that is how most calculators work. But how do they know the derivative of the given equation? Is there a built-in library or some other alternatives?

Requirements: Must make an HTTP GET request to icanhazip.com Must dump the response body to STDOUT Must not display any extraneous output, except whitespace Can use any npm module The length of the one-liner will include everything from node to the end of the command line.

Can a letter fit inside the other? code-golf (Help needed to find more tags.) Do you remember my mat properly grouped by colors? Yesterday I was looking at it and realized that some letters fit inside others. Example: a letter P fits in the place where the letter R goes. So here's a simple c...

I LOVE todays XKCD! https://xkcd.com/1930/ You can probably already tell what the puzzle is. Write some code to work out all of the possible routes through this data structure, move left-to-right, follow the line back. make a decision at each split. Don't repeat any complete calendar fac...

Inspiration. Posted with permission. Print one of the possible XKCD calendar "facts": You can get the raw text and structure from my APL reference implementation or from Explain XKCD's transcript (including the title text just under the illustration). Rules At every decision node, there mus...

A superabundant number is an integer n that sets a new upper bound for its ratio with the divisor sum function σ. In other words, n is superabundant if and only if, for all natural numbers x that are less than n: For a few of the values: n σ(n) σ(n)/n superabundant 1 1 1.0000 y...

In C, to sum up some numbers, can do: *X;f(x,n){X=x;x=0;while(n--)x+=*X++;} // not sure if return the answer, assuming it does input a pointer x and the length n But can also be done by n;f(x){n+=x;} #define g(d)d=n,n=0 // 4 bytes shorter input by repeatedly call f, once a value, then ca...

Primes ’n’ digits (working title) code-golf primes This has no practical purpose but it could be fun to golf. Challenge Given a number n, Count the amount of each digit in n and add 1 to each count Take the prime factorization of n Count the amount of each digit in the prime factorization...