number stringlengths 1 3 | description stringlengths 89 6.69k | answer stringlengths 32 32 ⌀ |
|---|---|---|
1 | If we list all the natural numbers below 10 that are multiples of 3 or 5,
we get 3, 5, 6 and 9. The sum of these multiples is 23.
Find the sum of all the multiples of 3 or 5 below 1000. | e1edf9d1967ca96767dcc2b2d6df69f4 |
2 | Each new term in the Fibonacci sequence is generated by adding the
previous two terms. By starting with 1 and 2, the first 10 terms will be:
1, 2, 3, 5, 8, 13, 21, 34, 55, 89, ...
By considering the terms in the Fibonacci sequence whose values do not
exceed four million, find the sum of ... | 4194eb91842c8e7e6df099ca73c38f28 |
3 | The prime factors of 13195 are 5, 7, 13 and 29.
What is the largest prime factor of the number 600851475143 ? | 94c4dd41f9dddce696557d3717d98d82 |
4 | A palindromic number reads the same both ways. The largest palindrome made
from the product of two 2-digit numbers is 9009 = 91 × 99.
Find the largest palindrome made from the product of two 3-digit numbers. | d4cfc27d16ea72a96b83d9bdef6ce2ec |
5 | 2520 is the smallest number that can be divided by each of the numbers
from 1 to 10 without any remainder.
What is the smallest positive number that is evenly divisible by all of
the numbers from 1 to 20? | bc0d0a22a7a46212135ed0ba77d22f3a |
6 | The sum of the squares of the first ten natural numbers is,
1^2 + 2^2 + ... + 10^2 = 385
The square of the sum of the first ten natural numbers is,
(1 + 2 + ... + 10)^2 = 55^2 = 3025
Hence the difference between the sum of the squares of the first ten
natura... | 867380888952c39a131fe1d832246ecc |
7 | By listing the first six prime numbers: 2, 3, 5, 7, 11, and 13, we can see
that the 6th prime is 13.
What is the 10 001st prime number? | 8c32ab09ec0210af60d392e9b2009560 |
8 | The four adjacent digits in the 1000-digit number that have the greatest
product are 9 × 9 × 8 × 9 = 5832.
73167176531330624919225119674426574742355349194934
96983520312774506326239578318016984801869478851843
85861560789112949495459501737958331952853208805511
... | 0f53ea7949d32ef24f9186207600403c |
9 | A Pythagorean triplet is a set of three natural numbers, a < b < c, for
which,
a^2 + b^2 = c^2
For example, 3^2 + 4^2 = 9 + 16 = 25 = 5^2.
There exists exactly one Pythagorean triplet for which a + b + c = 1000.
Find the product abc. | 24eaa9820350012ff678de47cb85b639 |
10 | The sum of the primes below 10 is 2 + 3 + 5 + 7 = 17.
Find the sum of all the primes below two million. | d915b2a9ac8749a6b837404815f1ae25 |
11 | In the 20×20 grid below, four numbers along a diagonal line have been
marked in red.
08 02 22 97 38 15 00 40 00 75 04 05 07 78 52 12 50 77 91 08
49 49 99 40 17 81 18 57 60 87 17 40 98 43 69 48 04 56 62 00
81 49 31 73 55 79 14 29 93 71 40 67 53 88 30 03 49 13 36 65
52 70 95 23... | 678f5d2e1eaa42f04fa53411b4f441ac |
12 | The sequence of triangle numbers is generated by adding the natural
numbers. So the 7^th triangle number would be 1 + 2 + 3 + 4 + 5 + 6 + 7 =
28. The first ten terms would be:
1, 3, 6, 10, 15, 21, 28, 36, 45, 55, ...
Let us list the factors of the first seven triangle numbers:
1: 1... | 8091de7d285989bbfa9a2f9f3bdcc7c0 |
13 | Work out the first ten digits of the sum of the following one-hundred
50-digit numbers.
37107287533902102798797998220837590246510135740250
46376937677490009712648124896970078050417018260538
74324986199524741059474233309513058123726617309629
919422133635741... | 361113f19fd302adc31268f8283a4f2d |
14 | The following iterative sequence is defined for the set of positive
integers:
n → n/2 (n is even)
n → 3n + 1 (n is odd)
Using the rule above and starting with 13, we generate the following
sequence:
13 → 40 → 20 → 10 → 5 → 16 → 8 → 4 → 2 → 1
It can be seen that this sequence (st... | 5052c3765262bb2c6be537abd60b305e |
15 | Starting in the top left corner of a 2×2 grid, and only being able to move
to the right and down, there are exactly 6 routes to the bottom right
corner.
How many such routes are there through a 20×20 grid?
p_015.gif | 928f3957168ac592c4215dcd04e0b678 |
16 | 2^15 = 32768 and the sum of its digits is 3 + 2 + 7 + 6 + 8 = 26.
What is the sum of the digits of the number 2^1000? | 6a5889bb0190d0211a991f47bb19a777 |
17 | If the numbers 1 to 5 are written out in words: one, two, three, four,
five, then there are 3 + 3 + 5 + 4 + 4 = 19 letters used in total.
If all the numbers from 1 to 1000 (one thousand) inclusive were written
out in words, how many letters would be used?
NOTE: Do not count spaces or hyphens. For example,... | 6a979d4a9cf85135408529edc8a133d0 |
18 | By starting at the top of the triangle below and moving to adjacent
numbers on the row below, the maximum total from top to bottom is 23.
3
7 4
2 4 6
8 5 9 3
That... | 708f3cf8100d5e71834b1db77dfa15d6 |
19 | You are given the following information, but you may prefer to do some
research for yourself.
• 1 Jan 1900 was a Monday.
• Thirty days has September,
April, June and November.
All the rest have thirty-one,
Saving February alone,
Which has twenty-eight, rain or shine.
And... | a4a042cf4fd6bfb47701cbc8a1653ada |
20 | n! means n × (n − 1) × ... × 3 × 2 × 1
For example, 10! = 10 × 9 × ... × 3 × 2 × 1 = 3628800,
and the sum of the digits in the number 10! is 3 + 6 + 2 + 8 + 8 + 0 + 0 =
27.
Find the sum of the digits in the number 100! | 443cb001c138b2561a0d90720d6ce111 |
21 | Let d(n) be defined as the sum of proper divisors of n (numbers less than
n which divide evenly into n).
If d(a) = b and d(b) = a, where a ≠ b, then a and b are an amicable pair
and each of a and b are called amicable numbers.
For example, the proper divisors of 220 are 1, 2, 4, 5, 10, 11, 20, 22,
44, 5... | 51e04cd4e55e7e415bf24de9e1b0f3ff |
22 | Using [1]names.txt, a 46K text file containing over five-thousand first
names, begin by sorting it into alphabetical order. Then working out the
alphabetical value for each name, multiply this value by its alphabetical
position in the list to obtain a name score.
For example, when the list is sorted into a... | f2c9c91cb025746f781fa4db8be3983f |
23 | A perfect number is a number for which the sum of its proper divisors is
exactly equal to the number. For example, the sum of the proper divisors
of 28 would be 1 + 2 + 4 + 7 + 14 = 28, which means that 28 is a perfect
number.
A number n is called deficient if the sum of its proper divisors is less
than... | 2c8258c0604152962f7787571511cf28 |
24 | A permutation is an ordered arrangement of objects. For example, 3124 is
one possible permutation of the digits 1, 2, 3 and 4. If all of the
permutations are listed numerically or alphabetically, we call it
lexicographic order. The lexicographic permutations of 0, 1 and 2 are:
012 021... | 7f155b45cb3f0a6e518d59ec348bff84 |
25 | The Fibonacci sequence is defined by the recurrence relation:
F[n] = F[n−1] + F[n−2], where F[1] = 1 and F[2] = 1.
Hence the first 12 terms will be:
F[1] = 1
F[2] = 1
F[3] = 2
F[4] = 3
F[5] = 5
F[6] = 8
F[7] = 13
F[8] = 21
F[9] = 34
F[10] = 55
F[11] = 89... | a376802c0811f1b9088828288eb0d3f0 |
26 | A unit fraction contains 1 in the numerator. The decimal representation of
the unit fractions with denominators 2 to 10 are given:
1/2 = 0.5
1/3 = 0.(3)
1/4 = 0.25
1/5 = 0.2
1/6 = 0.1(6)
1/7 = 0.(142857)
1/8 = 0.125
1/9 = 0.(1)
1/10 = 0.1
Where 0.1(6... | 6aab1270668d8cac7cef2566a1c5f569 |
27 | Euler discovered the remarkable quadratic formula:
n² + n + 41
It turns out that the formula will produce 40 primes for the consecutive
values n = 0 to 39. However, when n = 40, 40^2 + 40 + 41 = 40(40 + 1) + 41
is divisible by 41, and certainly when n = 41, 41² + 41 + 41 is ... | 69d9e3218fd7abb6ff453ea96505183d |
28 | Starting with the number 1 and moving to the right in a clockwise
direction a 5 by 5 spiral is formed as follows:
21 22 23 24 25
20 7 8 9 10
19 6 1 2 11
18 5 4 3 12
... | 0d53425bd7c5bf9919df3718c8e49fa6 |
29 | Consider all integer combinations of a^b for 2 ≤ a ≤ 5 and 2 ≤ b ≤ 5:
2^2=4, 2^3=8, 2^4=16, 2^5=32
3^2=9, 3^3=27, 3^4=81, 3^5=243
4^2=16, 4^3=64, 4^4=256, 4^5=1024
5^2=25, 5^3=125, 5^4=625, 5^5=3125
If they are then placed in numerical order, with any repeats removed, we
get the following se... | 6f0ca67289d79eb35d19decbc0a08453 |
30 | Surprisingly there are only three numbers that can be written as the sum
of fourth powers of their digits:
1634 = 1^4 + 6^4 + 3^4 + 4^4
8208 = 8^4 + 2^4 + 0^4 + 8^4
9474 = 9^4 + 4^4 + 7^4 + 4^4
As 1 = 1^4 is not a sum it is not included.
The sum of these numbers is 1634 + 8208 + 9474 = 19316.... | 27a1779a8a8c323a307ac8a70bc4489d |
31 | In England the currency is made up of pound, £, and pence, p, and there
are eight coins in general circulation:
1p, 2p, 5p, 10p, 20p, 50p, £1 (100p) and £2 (200p).
It is possible to make £2 in the following way:
1×£1 + 1×50p + 2×20p + 1×5p + 1×2p + 3×1p
How many different ways can £2 be made usin... | 142dfe4a33d624d2b830a9257e96726d |
32 | We shall say that an n-digit number is pandigital if it makes use of all
the digits 1 to n exactly once; for example, the 5-digit number, 15234, is
1 through 5 pandigital.
The product 7254 is unusual, as the identity, 39 × 186 = 7254, containing
multiplicand, multiplier, and product is 1 through 9 pandigit... | 100f6e37d0b0564490a2ee27eff0660d |
33 | The fraction 49/98 is a curious fraction, as an inexperienced
mathematician in attempting to simplify it may incorrectly believe that
49/98 = 4/8, which is correct, is obtained by cancelling the 9s.
We shall consider fractions like, 30/50 = 3/5, to be trivial
examples.
There are exactly four non-trivia... | f899139df5e1059396431415e770c6dd |
34 | 145 is a curious number, as 1! + 4! + 5! = 1 + 24 + 120 = 145.
Find the sum of all numbers which are equal to the sum of the factorial of
their digits.
Note: as 1! = 1 and 2! = 2 are not sums they are not included. | 60803ea798a0c0dfb7f36397d8d4d772 |
35 | The number, 197, is called a circular prime because all rotations of the
digits: 197, 971, and 719, are themselves prime.
There are thirteen such primes below 100: 2, 3, 5, 7, 11, 13, 17, 31, 37,
71, 73, 79, and 97.
How many circular primes are there below one million? | b53b3a3d6ab90ce0268229151c9bde11 |
36 | The decimal number, 585 = 1001001001[2] (binary), is palindromic in both
bases.
Find the sum of all numbers, less than one million, which are palindromic
in base 10 and base 2.
(Please note that the palindromic number, in either base, may not include
leading zeros.) | 0e175dc2f28833885f62e7345addff03 |
37 | The number 3797 has an interesting property. Being prime itself, it is
possible to continuously remove digits from left to right, and remain
prime at each stage: 3797, 797, 97, and 7. Similarly we can work from
right to left: 3797, 379, 37, and 3.
Find the sum of the only eleven primes that are both trunca... | cace46c61b00de1b60874936a093981d |
38 | Take the number 192 and multiply it by each of 1, 2, and 3:
192 × 1 = 192
192 × 2 = 384
192 × 3 = 576
By concatenating each product we get the 1 to 9 pandigital, 192384576. We
will call 192384576 the concatenated product of 192 and (1,2,3)
The same can be achieved by starting with 9 and multi... | f2a29ede8dc9fae7926dc7a4357ac25e |
39 | If p is the perimeter of a right angle triangle with integral length
sides, {a,b,c}, there are exactly three solutions for p = 120.
{20,48,52}, {24,45,51}, {30,40,50}
For which value of p ≤ 1000, is the number of solutions maximised? | fa83a11a198d5a7f0bf77a1987bcd006 |
40 | An irrational decimal fraction is created by concatenating the positive
integers:
0.123456789101112131415161718192021...
It can be seen that the 12^th digit of the fractional part is 1.
If d[n] represents the n^th digit of the fractional part, find the value
of the following expressi... | 6f3ef77ac0e3619e98159e9b6febf557 |
41 | We shall say that an n-digit number is pandigital if it makes use of all
the digits 1 to n exactly once. For example, 2143 is a 4-digit pandigital
and is also prime.
What is the largest n-digit pandigital prime that exists? | d0a1bd6ab4229b2d0754be8923431404 |
42 | The n^th term of the sequence of triangle numbers is given by, t[n] =
½n(n+1); so the first ten triangle numbers are:
1, 3, 6, 10, 15, 21, 28, 36, 45, 55, ...
By converting each letter in a word to a number corresponding to its
alphabetical position and adding these values we form a word ... | 82aa4b0af34c2313a562076992e50aa3 |
43 | The number, 1406357289, is a 0 to 9 pandigital number because it is made
up of each of the digits 0 to 9 in some order, but it also has a rather
interesting sub-string divisibility property.
Let d[1] be the 1^st digit, d[2] be the 2^nd digit, and so on. In this
way, we note the following:
• d[2]d[3]d... | 115253b7721af0fdff25cd391dfc70cf |
44 | Pentagonal numbers are generated by the formula, P[n]=n(3n−1)/2. The first
ten pentagonal numbers are:
1, 5, 12, 22, 35, 51, 70, 92, 117, 145, ...
It can be seen that P[4] + P[7] = 22 + 70 = 92 = P[8]. However, their
difference, 70 − 22 = 48, is not pentagonal.
Find the pair of pentagon... | 2c2556cb85621309ca647465ffa62370 |
45 | Triangle, pentagonal, and hexagonal numbers are generated by the following
formulae:
Triangle T[n]=n(n+1)/2 1, 3, 6, 10, 15, ...
Pentagonal P[n]=n(3n−1)/2 1, 5, 12, 22, 35, ...
Hexagonal H[n]=n(2n−1) 1, 6, 15, 28, 45, ...
It can be verified that T[285] = P[165] = H[143] = 40755.
F... | 30dfe3e3b286add9d12e493ca7be63fc |
46 | It was proposed by Christian Goldbach that every odd composite number can
be written as the sum of a prime and twice a square.
9 = 7 + 2×1^2
15 = 7 + 2×2^2
21 = 3 + 2×3^2
25 = 7 + 2×3^2
27 = 19 + 2×2^2
33 = 31 + 2×1^2
It turns out that the conjecture was false.
What is the smallest odd com... | 89abe98de6071178edb1b28901a8f459 |
47 | The first two consecutive numbers to have two distinct prime factors are:
14 = 2 × 7
15 = 3 × 5
The first three consecutive numbers to have three distinct prime factors
are:
644 = 2² × 7 × 23
645 = 3 × 5 × 43
646 = 2 × 17 × 19.
Find the first four consecutive integers to have four distinct p... | 748f517ecdc29106e2738f88aa7530f4 |
48 | The series, 1^1 + 2^2 + 3^3 + ... + 10^10 = 10405071317.
Find the last ten digits of the series, 1^1 + 2^2 + 3^3 + ... + 1000^1000. | 0829124724747ae1c65da8cae5263346 |
49 | The arithmetic sequence, 1487, 4817, 8147, in which each of the terms
increases by 3330, is unusual in two ways: (i) each of the three terms are
prime, and, (ii) each of the 4-digit numbers are permutations of one
another.
There are no arithmetic sequences made up of three 1-, 2-, or 3-digit
primes, exh... | 0b99933d3e2a9addccbb663d46cbb592 |
50 | The prime 41, can be written as the sum of six consecutive primes:
41 = 2 + 3 + 5 + 7 + 11 + 13
This is the longest sum of consecutive primes that adds to a prime below
one-hundred.
The longest sum of consecutive primes below one-thousand that adds to a
prime, contains 21 terms,... | 73229bab6c5dc1c7cf7a4fa123caf6bc |
51 | By replacing the 1^st digit of the 2-digit number *3, it turns out that
six of the nine possible values: 13, 23, 43, 53, 73, and 83, are all
prime.
By replacing the 3^rd and 4^th digits of 56**3 with the same digit, this
5-digit number is the first example having seven primes among the ten
generated num... | e2a8daa5eb919905dadd795593084c22 |
52 | It can be seen that the number, 125874, and its double, 251748, contain
exactly the same digits, but in a different order.
Find the smallest positive integer, x, such that 2x, 3x, 4x, 5x, and 6x,
contain the same digits. | a420384997c8a1a93d5a84046117c2aa |
53 | There are exactly ten ways of selecting three from five, 12345:
123, 124, 125, 134, 135, 145, 234, 235, 245, and 345
In combinatorics, we use the notation, ^5C[3] = 10.
In general,
^nC[r] = n! ,where r ≤ n, n! = n×(n−1)×...×3×2×1, and 0! = 1.
r!(n−r)!
It is not unt... | e3b21256183cf7c2c7a66be163579d37 |
54 | In the card game poker, a hand consists of five cards and are ranked, from
lowest to highest, in the following way:
• High Card: Highest value card.
• One Pair: Two cards of the same value.
• Two Pairs: Two different pairs.
• Three of a Kind: Three cards of the same value.
• Straight: All c... | 142949df56ea8ae0be8b5306971900a4 |
55 | If we take 47, reverse and add, 47 + 74 = 121, which is palindromic.
Not all numbers produce palindromes so quickly. For example,
349 + 943 = 1292,
1292 + 2921 = 4213
4213 + 3124 = 7337
That is, 349 took three iterations to arrive at a palindrome.
Although no one has proved it yet, it is thought t... | 077e29b11be80ab57e1a2ecabb7da330 |
56 | A googol (10^100) is a massive number: one followed by one-hundred zeros;
100^100 is almost unimaginably large: one followed by two-hundred zeros.
Despite their size, the sum of the digits in each number is only 1.
Considering natural numbers of the form, a^b, where a, b < 100, what is
the maximum digital ... | c22abfa379f38b5b0411bc11fa9bf92f |
57 | It is possible to show that the square root of two can be expressed as an
infinite continued fraction.
√ 2 = 1 + 1/(2 + 1/(2 + 1/(2 + ... ))) = 1.414213...
By expanding this for the first four iterations, we get:
1 + 1/2 = 3/2 = 1.5
1 + 1/(2 + 1/2) = 7/5 = 1.4
1 + 1/(2 + 1/(2 + 1/2)) = 1... | b3e3e393c77e35a4a3f3cbd1e429b5dc |
58 | Starting with 1 and spiralling anticlockwise in the following way, a
square spiral with side length 7 is formed.
37 36 35 34 33 32 31
38 17 16 15 14 13 30
39 18 5 4 3 12 29
40 19 6 1 2 11 28... | b62fc92a2561538525c89be63f36bf7b |
59 | Each character on a computer is assigned a unique code and the preferred
standard is ASCII (American Standard Code for Information Interchange).
For example, uppercase A = 65, asterisk (*) = 42, and lowercase k = 107.
A modern encryption method is to take a text file, convert the bytes to
ASCII, then XOR e... | 68f891fe214e2bfa07c998ad5d0a390f |
60 | The primes 3, 7, 109, and 673, are quite remarkable. By taking any two
primes and concatenating them in any order the result will always be
prime. For example, taking 7 and 109, both 7109 and 1097 are prime. The
sum of these four primes, 792, represents the lowest sum for a set of four
primes with this prop... | a4b5a70ca8cf24d0eb4330748d1e72e5 |
61 | Triangle, square, pentagonal, hexagonal, heptagonal, and octagonal numbers
are all figurate (polygonal) numbers and are generated by the following
formulae:
Triangle P[3,n]=n(n+1)/2 1, 3, 6, 10, 15, ...
Square P[4,n]=n^2 1, 4, 9, 16, 25, ...
Pentagonal P[5,n]=n(3n−1)/2 1, 5, 12,... | caec17d84884addeec35c3610645ab63 |
62 | The cube, 41063625 (345^3), can be permuted to produce two other cubes:
56623104 (384^3) and 66430125 (405^3). In fact, 41063625 is the smallest
cube which has exactly three permutations of its digits which are also
cube.
Find the smallest cube for which exactly five permutations of its digits
are cube. | 8f46b522b5401b8b6df99a7410eea44b |
63 | The 5-digit number, 16807=7^5, is also a fifth power. Similarly, the
9-digit number, 134217728=8^9, is a ninth power.
How many n-digit positive integers exist which are also an nth power? | f457c545a9ded88f18ecee47145a72c0 |
64 | All square roots are periodic when written as continued fractions and can
be written in the form:
√N = a[0] + 1
a[1] + 1
a[2] + 1
a[3] + ...
For example, let us consider √23:
√23 = 4 + √23 — 4 = 4 + 1 = 4 + ... | dc960c46c38bd16e953d97cdeefdbc68 |
65 | The square root of 2 can be written as an infinite continued fraction.
√2 = 1 + 1
2 + 1
2 + 1
2 + 1
2 + ...
The infinite continued fraction can be written, √2 = [1;(2)], (2)
indicates that 2 repeats ad infinitum. ... | 7a614fd06c325499f1680b9896beedeb |
66 | Consider quadratic Diophantine equations of the form:
x^2 – Dy^2 = 1
For example, when D=13, the minimal solution in x is 649^2 – 13×180^2 = 1.
It can be assumed that there are no solutions in positive integers when D
is square.
By finding minimal solutions in x for D = ... | 3a066bda8c96b9478bb0512f0a43028c |
67 | By starting at the top of the triangle below and moving to adjacent
numbers on the row below, the maximum total from top to bottom is 23.
3
7 4
2 4 6
8 5 9 3
That... | 9d702ffd99ad9c70ac37e506facc8c38 |
68 | Consider the following "magic" 3-gon ring, filled with the numbers 1 to 6,
and each line adding to nine.
Working clockwise, and starting from the group of three with the
numerically lowest external node (4,3,2 in this example), each solution
can be described uniquely. For example, the above solution can be... | 26227442c6fed0292a528ac3790175be |
69 | Euler's Totient function, φ(n) [sometimes called the phi function], is
used to determine the number of numbers less than n which are relatively
prime to n. For example, as 1, 2, 4, 5, 7, and 8, are all less than nine
and relatively prime to nine, φ(9)=6.
┌────┬──────────────────┬──────┬───────────┐
│ n ... | bf08b01ead83cbd62a9839ca1cf35ada |
70 | Euler's Totient function, φ(n) [sometimes called the phi function], is
used to determine the number of positive numbers less than or equal to n
which are relatively prime to n. For example, as 1, 2, 4, 5, 7, and 8, are
all less than nine and relatively prime to nine, φ(9)=6.
The number 1 is considered to be... | 1884dde67ced589082c8b7043abce181 |
71 | Consider the fraction, n/d, where n and d are positive integers. If n<d
and HCF(n,d)=1, it is called a reduced proper fraction.
If we list the set of reduced proper fractions for d ≤ 8 in ascending
order of size, we get:
1/8, 1/7, 1/6, 1/5, 1/4, 2/7, 1/3, 3/8, 2/5, 3/7, 1/2, 4/7, 3/5, 5/8, 2/3,
... | 71f38fa2f04db30be52f883d583bfd6f |
72 | Consider the fraction, n/d, where n and d are positive integers. If n<d
and HCF(n,d)=1, it is called a reduced proper fraction.
If we list the set of reduced proper fractions for d ≤ 8 in ascending
order of size, we get:
1/8, 1/7, 1/6, 1/5, 1/4, 2/7, 1/3, 3/8, 2/5, 3/7, 1/2, 4/7, 3/5, 5/8, 2/3,
... | 0384fb529dc651fe0f460acff3e9ac5d |
73 | Consider the fraction, n/d, where n and d are positive integers. If n<d
and HCF(n,d)=1, it is called a reduced proper fraction.
If we list the set of reduced proper fractions for d ≤ 8 in ascending
order of size, we get:
1/8, 1/7, 1/6, 1/5, 1/4, 2/7, 1/3, 3/8, 2/5, 3/7, 1/2, 4/7, 3/5, 5/8, 2/3,
... | 990a49eb474672444137fff1e5528a1b |
74 | The number 145 is well known for the property that the sum of the
factorial of its digits is equal to 145:
1! + 4! + 5! = 1 + 24 + 120 = 145
Perhaps less well known is 169, in that it produces the longest chain of
numbers that link back to 169; it turns out that there are only three such
loops that exi... | 69cb3ea317a32c4e6143e665fdb20b14 |
75 | It turns out that 12 cm is the smallest length of wire that can be bent to
form an integer sided right angle triangle in exactly one way, but there
are many more examples.
12 cm: (3,4,5)
24 cm: (6,8,10)
30 cm: (5,12,13)
36 cm: (9,12,15)
40 cm: (8,15,17)
48 cm: (12,16,20)
In contrast, some l... | 583e391a7bd87f785412f72f486433cb |
76 | It is possible to write five as a sum in exactly six different ways:
4 + 1
3 + 2
3 + 1 + 1
2 + 2 + 1
2 + 1 + 1 + 1
1 + 1 + 1 + 1 + 1
How many different ways can one hundred be written as a sum of at least
two positive integers? | 18ed0f01e082beffe0049ae1272689d2 |
77 | It is possible to write ten as the sum of primes in exactly five different
ways:
7 + 3
5 + 5
5 + 3 + 2
3 + 3 + 2 + 2
2 + 2 + 2 + 2 + 2
What is the first value which can be written as the sum of primes in over
five thousand different ways? | e2c420d928d4bf8ce0ff2ec19b371514 |
78 | Let p(n) represent the number of different ways in which n coins can be
separated into piles. For example, five coins can separated into piles in
exactly seven different ways, so p(5)=7.
OOOOO
OOOO O
OOO OO
... | ef2a8695e428116131cc94c651d0e566 |
79 | A common security method used for online banking is to ask the user for
three random characters from a passcode. For example, if the passcode was
531278, they may ask for the 2nd, 3rd, and 5th characters; the expected
reply would be: 317.
The text file, [1]keylog.txt, contains fifty successful login attemp... | 3ccc6e16d99b21d42948f6d49b90fa30 |
80 | It is well known that if the square root of a natural number is not an
integer, then it is irrational. The decimal expansion of such square roots
is infinite without any repeating pattern at all.
The square root of two is 1.41421356237309504880..., and the digital sum
of the first one hundred decimal digit... | 6cc501a25298e4051886ef1a126e9484 |
81 | In the 5 by 5 matrix below, the minimal path sum from the top left to the
bottom right, by only moving to the right and down, is indicated in bold
red and is equal to 2427.
131 673 234 103 18
201 96 342 965 150
630 803 746... | f9ffec84499832add77e6a8bb00246ec |
82 | NOTE: This problem is a more challenging version of [1]Problem 81.
The minimal path sum in the 5 by 5 matrix below, by starting in any cell
in the left column and finishing in any cell in the right column, and only
moving up, down, and right, is indicated in red and bold; the sum is equal
to 994.
... | e6b3b1cd89b018d4754cf63863f6690a |
83 | NOTE: This problem is a significantly more challenging version of
[1]Problem 81.
In the 5 by 5 matrix below, the minimal path sum from the top left to the
bottom right, by moving left, right, up, and down, is indicated in bold
red and is equal to 2297.
131 673 234 103 18
... | 61b28c4fbe8560003ee50fa5619d7a1e |
84 | In the game, Monopoly, the standard board is set up in the following way:
GO A1 CC1 A2 T1 R1 B1 CH1 B2 B3 JAIL
H2 C1
T2 U1
H1 ... | ead3264438ef83a8c2da2e98067b4445 |
85 | By counting carefully it can be seen that a rectangular grid measuring 3
by 2 contains eighteen rectangles:
Although there exists no rectangular grid that contains exactly two
million rectangles, find the area of the grid with the nearest solution.
p_085.gif | 92bf5e6240737e0326ea59846a83e076 |
86 | A spider, S, sits in one corner of a cuboid room, measuring 6 by 5 by 3,
and a fly, F, sits in the opposite corner. By travelling on the surfaces
of the room the shortest "straight line" distance from S to F is 10 and
the path is shown on the diagram.
However, there are up to three "shortest" path candidat... | f5c3dd7514bf620a1b85450d2ae374b1 |
87 | The smallest number expressible as the sum of a prime square, prime cube,
and prime fourth power is 28. In fact, there are exactly four numbers
below fifty that can be expressed in such a way:
28 = 2^2 + 2^3 + 2^4
33 = 3^2 + 2^3 + 2^4
49 = 5^2 + 2^3 + 2^4
47 = 2^2 + 3^3 + 2^4
How many numbers bel... | e7fb7907f1af626cc42e787e367ec602 |
88 | A natural number, N, that can be written as the sum and product of a given
set of at least two natural numbers, {a[1], a[2], ... , a[k]} is called a
product-sum number: N = a[1] + a[2] + ... + a[k] = a[1] × a[2] × ... ×
a[k].
For example, 6 = 1 + 2 + 3 = 1 × 2 × 3.
For a given set of size, k, we shall ... | ffde7251f43906d31534ae69fa555757 |
89 | The rules for writing Roman numerals allow for many ways of writing each
number (see [1]About Roman Numerals...). However, there is always a "best"
way of writing a particular number.
For example, the following represent all of the legitimate ways of writing
the number sixteen:
IIIIIIIIIIIIIIII
VIII... | 5c572eca050594c7bc3c36e7e8ab9550 |
90 | Each of the six faces on a cube has a different digit (0 to 9) written on
it; the same is done to a second cube. By placing the two cubes
side-by-side in different positions we can form a variety of 2-digit
numbers.
For example, the square number 64 could be formed:
In fact, by carefully choosing the d... | 6a61d423d02a1c56250dc23ae7ff12f3 |
91 | The points P (x[1], y[1]) and Q (x[2], y[2]) are plotted at integer
co-ordinates and are joined to the origin, O(0,0), to form ΔOPQ.
There are exactly fourteen triangles containing a right angle that can be
formed when each co-ordinate lies between 0 and 2 inclusive; that is,
0 ≤ x[1], y[1], x[2], y[2] ≤ 2... | e8dc153260a59d4f236cfd7439d5dfd3 |
92 | A number chain is created by continuously adding the square of the digits
in a number to form a new number until it has been seen before.
For example,
44 → 32 → 13 → 10 → 1 → 1
85 → 89 → 145 → 42 → 20 → 4 → 16 → 37 → 58 → 89
Therefore any chain that arrives at 1 or 89 will become stuck in an
endles... | 6cee918c0612bccc2dac03d05e07035f |
93 | By using each of the digits from the set, {1, 2, 3, 4}, exactly once, and
making use of the four arithmetic operations (+, −, *, /) and
brackets/parentheses, it is possible to form different positive integer
targets.
For example,
8 = (4 * (1 + 3)) / 2
14 = 4 * (3 + 1 / 2)
19 = 4 * (2 + 3) − 1
... | 26588e932c7ccfa1df309280702fe1b5 |
94 | It is easily proved that no equilateral triangle exists with integral
length sides and integral area. However, the almost equilateral triangle
5-5-6 has an area of 12 square units.
We shall define an almost equilateral triangle to be a triangle for which
two sides are equal and the third differs by no more... | 3218c6bb59f2539ec39ad4bf37c10913 |
95 | The proper divisors of a number are all the divisors excluding the number
itself. For example, the proper divisors of 28 are 1, 2, 4, 7, and 14. As
the sum of these divisors is equal to 28, we call it a perfect number.
Interestingly the sum of the proper divisors of 220 is 284 and the sum of
the proper div... | cd2018beeece5fb0a71a96308e567bde |
96 | Su Doku (Japanese meaning number place) is the name given to a popular
puzzle concept. Its origin is unclear, but credit must be attributed to
Leonhard Euler who invented a similar, and much more difficult, puzzle
idea called Latin Squares. The objective of Su Doku puzzles, however, is
to replace the blanks... | 26f6abfa0d7725fef678e371897d5df0 |
97 | The first known prime found to exceed one million digits was discovered in
1999, and is a Mersenne prime of the form 2^6972593−1; it contains exactly
2,098,960 digits. Subsequently other Mersenne primes, of the form 2^p−1,
have been found which contain more digits.
However, in 2004 there was found a massiv... | 68c8c919526039022b923a72d5cc12b1 |
98 | By replacing each of the letters in the word CARE with 1, 2, 9, and 6
respectively, we form a square number: 1296 = 36^2. What is remarkable is
that, by using the same digital substitutions, the anagram, RACE, also
forms a square number: 9216 = 96^2. We shall call CARE (and RACE) a square
anagram word pair ... | 36b3b5f54143786b7ab2ebb6bcd06e75 |
99 | Comparing two numbers written in index form like 2^11 and 3^7 is not
difficult, as any calculator would confirm that 2^11 = 2048 < 3^7 = 2187.
However, confirming that 632382^518061 > 519432^525806 would be much more
difficult, as both numbers contain over three million digits.
Using [1]base_exp.txt, a 22... | 1ecfb463472ec9115b10c292ef8bc986 |
100 | If a box contains twenty-one coloured discs, composed of fifteen blue
discs and six red discs, and two discs were taken at random, it can be
seen that the probability of taking two blue discs, P(BB) =
(15/21)×(14/20) = 1/2.
The next such arrangement, for which there is exactly 50% chance of taking
two b... | 21156e3acc4ca35b7a318c541a0648d5 |
End of preview. Expand in Data Studio
Project Euler problems and hashed solutions.
Based on https://github.com/davidcorbin/euler-offline
Original data from https://projecteuler.net/copyright
- Downloads last month
- 4