// archives

Prime Numbers

This tag is associated with 31 posts

Project Euler 49 Solution

Find arithmetic sequences, made of prime terms, whose four digits are permutations of each other.

Project Euler 50 Solution

Find the prime number, below one-million, that can be written as the sum of the most consecutive primes.

Project Euler 51 Solution

Find the smallest prime which, by replacing part of the number with the same digit, is part of an eight prime value set.

Project Euler 58 Solution

Counting primes that lie on the diagonals of the spiral grid.

Project Euler 60 Solution

Find a set of five primes for which any two primes concatenate to produce another prime.

Project Euler 66 Solution

Investigate the Diophantine equation x2 − Dy2 = 1.

Project Euler 69 Solution

Find the value of n ≤ 1,000,000 for which n/φ(n) is a maximum.

Project Euler 77 Solution

Find the first value which can be written as the sum of primes in over five thousand different ways.

Project Euler 87 Solution

Investigating numbers that can be expressed as the sum of a prime square, cube, and fourth power.

Project Euler 97 Solution

Find the last ten digits of the non-Mersenne prime: 28433 × 27830457 + 1.