$><<'0.'
(0..$_.to_i).each{|i|$><<i}
n-Primes code-golf prime
For the purpose of this problem, an n-prime is a number that has exactly n/2 divisors (duplicate divisors are counted twice). Real primes (and 1) are 1-primes, semi-primes are 2-primes, and so on.
Your Task:
Write a program or function that takes an integer p as inp...
-1
Comparing Strings: Easy Mode
code-golf string
Given two non-empty strings containing printable ASCII, output their value if they are exactly the same, and output a non-empty third string of printable ASCII if they are different. Trailing newlines allowed. The output inherently can't always be t...
I'm looking at OEIS:A000236, whose definition states:
Maximum m such that there are no two adjacent elements belonging to the same n-th power residue class modulo some prime p in the sequence 1,2,...,m (equivalently, there is no n-th power residue modulo p in the sequence 1/2,2/3,...,(m-1)/m)...
This challenge comes from the game Pokemon GO. Do you have an elegant way to solve this using JavaScript?
You are given a list of 3-tuples. The values each tuple represent Pokemon traits:
[Attack, Defense, Stamina]
Each value in the tuple can range from 0 to 15 inclusive. An example might loo...
4
