// archives

Prime Numbers

This tag is associated with 19 posts

Project Euler Problem 133 Solution

Investigating which primes will never divide a repunit containing 10**n digits.

Project Euler Problem 132 Solution

Determining the first forty prime factors of a very large repunit.

Project Euler Problem 130 Solution

Finding composite values, n, for which n−1 is divisible by the length of the smallest repunits that divide it.

Project Euler Problem 129 Solution

Investigating minimal repunits that divide by n.

Project Euler Problem 77 Solution

What is the first value which can be written as the sum of primes in over five thousand different ways?

Project Euler Problem 49 Solution

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

Project Euler Problem 46 Solution

What is the smallest odd composite that cannot be written as the sum of a prime and twice a square?

Project Euler Problem 51 Solution

Find the smallest prime which, by changing the same part of the number, can form eight different primes.

Project Euler Problem 12 Solution

What is the value of the first triangle number to have over five hundred divisors?

Project Euler Problem 3 Solution

Find the largest prime factor of a composite number.