// archives

Prime Numbers

This tag is associated with 31 posts

Project Euler 128 Solution

Find the 2000th hexagonal tile in which the differences between it and its 6 neighbors yield 3 primes.

Project Euler 231 Solution

The prime factorisation of binomial coefficients

Project Euler 203 Solution

Find the sum of the distinct square-free numbers in the first 51 rows of Pascal’s triangle.

Project Euler 243 Solution

Find fractions that cannot be cancelled down (resilient fraction).

Project Euler 249 Solution

Prime Subset Sums

Project Euler 288 Solution

Find the number of factors in an enormous factorial.

Project Euler 129 Solution

Investigating minimal repunits that divide by n.

Project Euler 130 Solution

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

Project Euler 132 Solution

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

Project Euler 133 Solution

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