// archives

Large Integers

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 455 Solution

Powers With Trailing Digits

Project Euler 249 Solution

Prime Subset Sums

Project Euler 250 Solution

Find the number of non-empty subsets of {11, 22, 33,…, 250250250250}, the sum of whose elements is divisible by 250.

Project Euler 137 Solution

Determining the value of infinite polynomial series for which the coefficients are Fibonacci numbers.

Project Euler 80 Solution

Calculating the sum of the decimal digits of irrational square roots.

Project Euler 66 Solution

Investigate the Diophantine equation x2 − Dy2 = 1.

Project Euler 133 Solution

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

Project Euler 99 Solution

Find the base/exponent pair in the file has the greatest numerical value