// archives

Python

This tag is associated with 112 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 52 Solution

Find the smallest positive integer, x, such that 2x, 3x, 4x, 5x, and 6x, contain the same digits in some order.

Project Euler 53 Solution

Count the values of C(n,r), for 1 ≤ n ≤ 100, that exceed one-million.

Project Euler 80 Solution

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

Project Euler 81 Solution

Find the minimal path sum from the top left to the bottom right by moving right and down.

Project Euler 82 Solution

Find the minimal path sum from the left column to the right column.

Project Euler 83 Solution

Find a minimum path sum in a matrix from the top left to the bottom right corners by moving up, down, left or right.

Project Euler 85 Solution

Investigating the number of rectangles in a rectangular grid.