Your function takes a natural number and returns the smallest natural number that has exactly that amount of divisors, including itself. Exemples: f(1) = 1  f(2) = 2 [1, 2] f(3) = 4 [1, 2, 4] ...
The challenge is rather simple: Take a positive whole number n as input. Output the nth Fibonacci prime number. Input can be as an parameter to a function (and the output will be the return ...
Definition A square-free semiprime is a natural number that is the product of two distinct prime numbers. The task Given a natural number n, count all square-free semiprimes less than or equal ...
Write the shortest code to print sexy primes till n Sexy Primes are pairs of numbers (n, m) such as n and m both are prime, and m = n + 6. EDIT Modifying the question a little bit after reading ...
Rules are simple: First n primes (not primes below n), should be printed to standard output separated by newlines (primes should be generated within the code) primes cannot be generated by an ...
This is my first code golf question, and a very simple one at that, so I apologise in advance if I may have broken any community guidelines. The task is to print out, in ascending order, all of the ...
Terence Tao recently proved a weak form of Goldbach's conjecture! Let's exploit it! Given an odd integer n > 1, write n as a sum of up to 5 primes. Take the input however you like, and give ...
With a twist; your algorithm has to be less complex than O(X2) where X is the Nth prime. Your solution post should include the character count and the theoretical complexity in terms of X (or N, which ...
Similar to this but in this one you need to write spiral starting from the center where: space means composite number .(dot) means prime number. Size of the spiral can be given as parameter or on ...
I had fun solving this, so i offer this golf challenge. The objective of this golf is to find the largest prime number that can be constructed using the given instructions. You should accept 3x3 ...
In this task, you have to write a program, that computes the prime factors of a number. The input is a natural number 1 < n < 2^32. The output is a list of the prime factors of the number in the ...
What is the average of n, the closest prime to n, the square of n and the closest fibbonacci number to n?
This is a math problem which takes quite many things into question, making it rather challenging, and as you might have guessed, it's a code golf, so it should be as short as possible as well. The ...
A whole program to find the prime factors of a given number. The number will be given on standard input.
Write the shortest code for finding the sum of primes between a and b (inclusive). Input a and b can be taken from command line or stdin (space seperated) Assume 1 <= a <= b <= 108 ...