Project Euler is protected under

Attribution-Non-Commercial-Share Alike 2.0 UK: England & Wales

^sup and [sub] are frequently use for subscripts/superscripts.
Many symbols are utf8, my apologies if you are on a 7-bit TTY.
Solutions are hashed with md5sum
echo -n 'myanswer' | md5sum

generated on 2014-6-29 at 15:46

Problem 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.
Answer: e1edf9d1967ca96767dcc2b2d6df69f4
Problem 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 the even-valued terms.
Answer: 4194eb91842c8e7e6df099ca73c38f28
Problem 3
=========
The prime factors of 13195 are 5, 7, 13 and 29.
What is the largest prime factor of the number 600851475143 ?
Answer: 94c4dd41f9dddce696557d3717d98d82
Problem 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.
Answer: d4cfc27d16ea72a96b83d9bdef6ce2ec
Problem 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?
Answer: bc0d0a22a7a46212135ed0ba77d22f3a
Problem 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
natural numbers and the square of the sum is 3025 385 = 2640.
Find the difference between the sum of the squares of the first one
hundred natural numbers and the square of the sum.
Answer: 867380888952c39a131fe1d832246ecc
Problem 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?
Answer: 8c32ab09ec0210af60d392e9b2009560
Problem 8

=========
The four adjacent digits in the 1000 digit number that have the greatest
product are 9 9 8 9 = 5832.
73167176531330624919225119674426574742355349194934
96983520312774506326239578318016984801869478851843
85861560789112949495459501737958331952853208805511
12540698747158523863050715693290963295227443043557
66896648950445244523161731856403098711121722383113
62229893423380308135336276614282806444486645238749
30358907296290491560440772390713810515859307960866
70172427121883998797908792274921901699720888093776
65727333001053367881220235421809751254540594752243
52584907711670556013604839586446706324415722155397
53697817977846174064955149290862569321978468622482
83972241375657056057490261407972968652414535100474
82166370484403199890008895243450658541227588666881
16427171479924442928230863465674813919123162824586
17866458359124566529476545682848912883142607690042
24219022671055626321111109370544217506941658960408
07198403850962455444362981230987879927244284909188
84580156166097919133875499200524063689912560717606
05886116467109405077541002256983155200055935729725
71636269561882670428252483600823257530420752963450
Find the thirteen adjacent digits in the 1000 digit number that have the
greatest product. What is the value of this product?
Answer: 0f53ea7949d32ef24f9186207600403c
Problem 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.
Answer: 24eaa9820350012ff678de47cb85b639
Problem 10
==========
The sum of the primes below 10 is 2 + 3 + 5 + 7 = 17.
Find the sum of all the primes below two million.

Answer: d915b2a9ac8749a6b837404815f1ae25
Problem 11
==========
In the 2020 grid below, four numbers along a diagonal line have been
marked in red.
08
49
81
52
22
24
32
67
24
21
78
16
86
19
04
88
04
20
20
01

02
49
49
70
31
47
98
26
55
36
17
39
56
80
52
36
42
69
73
70

22
99
31
95
16
32
81
20
58
23
53
05
00
81
08
68
16
36
35
54

97
40
73
23
71
60
28
68
05
09
28
42
48
68
83
87
73
41
29
71

38
17
55
04
51
99
64
02
66
75
22
96
35
05
97
57
38
72
78
83

15
81
79
60
67
03
23
62
73
00
75
35
71
94
35
62
25
30
31
51

00
18
14
11
63
45
67
12
99
76
31
31
89
47
99
20
39
23
90
54

40
57
29
42
89
02
10
20
26
44
67
47
07
69
16
72
11
88
01
69

00
60
93
69
41
44
26
95
97
20
15
55
05
28
07
03
24
34
74
16

75
87
71
24
92
75
38
63
17
45
94
58
44
73
97
46
94
62
31
92

04
17
40
68
36
33
40
94
78
35
03
88
44
92
57
33
72
99
49
33

05
40
67
56
54
53
67
39
78
14
80
24
37
13
32
67
18
69
71
48

07
98
53
01
22
78
59
63
96
00
04
00
44
86
16
46
08
82
48
61

78
43
88
32
40
36
54
08
83
61
62
17
60
52
26
55
46
67
86
43

52
69
30
56
40
84
70
40
14
33
16
54
21
17
26
12
29
59
81
52

12
48
03
71
28
20
66
91
88
97
14
24
58
77
79
32
32
85
16
01

50
04
49
37
66
35
18
66
34
34
09
36
51
04
33
63
40
74
23
89

77
56
13
02
33
17
38
49
89
31
53
29
54
89
27
93
62
04
57
19

91
62
36
36
13
12
64
94
63
33
56
85
17
55
98
53
76
36
05
67

08
00
65
91
80
50
70
21
72
95
92
57
58
40
66
69
36
16
54
48

The product of these numbers is 26 63 78 14 = 1788696.

What is the greatest product of four adjacent numbers in the same
direction (up, down, left, right, or diagonally) in the 2020 grid?
Answer: 678f5d2e1eaa42f04fa53411b4f441ac
Problem 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:
3:
6:
10:
15:
21:
28:

1
1,3
1,2,3,6
1,2,5,10
1,3,5,15
1,3,7,21
1,2,4,7,14,28

We can see that 28 is the first triangle number to have over five
divisors.
What is the value of the first triangle number to have over five hundred
divisors?
Answer: 8091de7d285989bbfa9a2f9f3bdcc7c0
Problem 13
==========
Work out the first ten digits of the sum of the following one hundred
50 digit numbers.
37107287533902102798797998220837590246510135740250
46376937677490009712648124896970078050417018260538
74324986199524741059474233309513058123726617309629
91942213363574161572522430563301811072406154908250
23067588207539346171171980310421047513778063246676
89261670696623633820136378418383684178734361726757
28112879812849979408065481931592621691275889832738
44274228917432520321923589422876796487670272189318
47451445736001306439091167216856844588711603153276
70386486105843025439939619828917593665686757934951
62176457141856560629502157223196586755079324193331
64906352462741904929101432445813822663347944758178
92575867718337217661963751590579239728245598838407
58203565325359399008402633568948830189458628227828
80181199384826282014278194139940567587151170094390
35398664372827112653829987240784473053190104293586
86515506006295864861532075273371959191420517255829
71693888707715466499115593487603532921714970056938
54370070576826684624621495650076471787294438377604
53282654108756828443191190634694037855217779295145
36123272525000296071075082563815656710885258350721
45876576172410976447339110607218265236877223636045
17423706905851860660448207621209813287860733969412
81142660418086830619328460811191061556940512689692
51934325451728388641918047049293215058642563049483
62467221648435076201727918039944693004732956340691
15732444386908125794514089057706229429197107928209
55037687525678773091862540744969844508330393682126
18336384825330154686196124348767681297534375946515
80386287592878490201521685554828717201219257766954
78182833757993103614740356856449095527097864797581
16726320100436897842553539920931837441497806860984
48403098129077791799088218795327364475675590848030
87086987551392711854517078544161852424320693150332
59959406895756536782107074926966537676326235447210
69793950679652694742597709739166693763042633987085
41052684708299085211399427365734116182760315001271
65378607361501080857009149939512557028198746004375
35829035317434717326932123578154982629742552737307
94953759765105305946966067683156574377167401875275
88902802571733229619176668713819931811048770190271
25267680276078003013678680992525463401061632866526

36270218540497705585629946580636237993140746255962
24074486908231174977792365466257246923322810917141
91430288197103288597806669760892938638285025333403
34413065578016127815921815005561868836468420090470
23053081172816430487623791969842487255036638784583
11487696932154902810424020138335124462181441773470
63783299490636259666498587618221225225512486764533
67720186971698544312419572409913959008952310058822
95548255300263520781532296796249481641953868218774
76085327132285723110424803456124867697064507995236
37774242535411291684276865538926205024910326572967
23701913275725675285653248258265463092207058596522
29798860272258331913126375147341994889534765745501
18495701454879288984856827726077713721403798879715
38298203783031473527721580348144513491373226651381
34829543829199918180278916522431027392251122869539
40957953066405232632538044100059654939159879593635
29746152185502371307642255121183693803580388584903
41698116222072977186158236678424689157993532961922
62467957194401269043877107275048102390895523597457
23189706772547915061505504953922979530901129967519
86188088225875314529584099251203829009407770775672
11306739708304724483816533873502340845647058077308
82959174767140363198008187129011875491310547126581
97623331044818386269515456334926366572897563400500
42846280183517070527831839425882145521227251250327
55121603546981200581762165212827652751691296897789
32238195734329339946437501907836945765883352399886
75506164965184775180738168837861091527357929701337
62177842752192623401942399639168044983993173312731
32924185707147349566916674687634660915035914677504
99518671430235219628894890102423325116913619626622
73267460800591547471830798392868535206946944540724
76841822524674417161514036427982273348055556214818
97142617910342598647204516893989422179826088076852
87783646182799346313767754307809363333018982642090
10848802521674670883215120185883543223812876952786
71329612474782464538636993009049310363619763878039
62184073572399794223406235393808339651327408011116
66627891981488087797941876876144230030984490851411
60661826293682836764744779239180335110989069790714
85786944089552990653640447425576083659976645795096
66024396409905389607120198219976047599490197230297
64913982680032973156037120041377903785566085089252
16730939319872750275468906903707539413042652315011
94809377245048795150954100921645863754710598436791
78639167021187492431995700641917969777599028300699
15368713711936614952811305876380278410754449733078
40789923115535562561142322423255033685442488917353
44889911501440648020369068063960672322193204149535
41503128880339536053299340368006977710650566631954
81234880673210146739058568557934581403627822703280
82616570773948327592232845941706525094512325230608
22918802058777319719839450180888072429661980811197
77158542502016545090413245809786882778948721859617
72107838435069186155435662884062257473692284509516
20849603980134001723930671666823555245252804609722
53503534226472524250874054075591789781264330331690
Answer: 361113f19fd302adc31268f8283a4f2d

Problem 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 (starting at 13 and finishing at 1)
contains 10 terms. Although it has not been proved yet (Collatz Problem),
it is thought that all starting numbers finish at 1.
Which starting number, under one million, produces the longest chain?
NOTE: Once the chain starts the terms are allowed to go above one million.
Answer: 5052c3765262bb2c6be537abd60b305e
Problem 15
==========
Starting in the top left corner of a 22 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 2020 grid?
p_015.gif
Answer: 928f3957168ac592c4215dcd04e0b678
Problem 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?
Answer: 6a5889bb0190d0211a991f47bb19a777
Problem 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, 342 (three hundred and
forty two) contains 23 letters and 115 (one hundred and fifteen) contains
20 letters. The use of "and" when writing out numbers is in compliance
with British usage.
Answer: 6a979d4a9cf85135408529edc8a133d0
Problem 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 is, 3 + 7 + 4 + 9 = 23.
Find the maximum total from top to bottom of the triangle below:
75
95 64
17 47 82
18 35 87 10
20 04 82 47 65
19 01 23 75 03 34
88 02 77 73 07 63 67
99 65 04 28 06 16 70 92
41 41 26 56 83 40 80 70 33
41 48 72 33 47 32 37 16 94 29
53 71 44 65 25 43 91 52 97 51 14
70 11 33 28 77 73 17 78 39 68 17 57
91 71 52 38 17 14 91 43 58 50 27 29 48
63 66 04 68 89 53 67 30 73 16 69 87 40 31
04 62 98 27 23 09 70 98 73 93 38 53 60 04 23
NOTE: As there are only 16384 routes, it is possible to solve this problem
by trying every route. However, [1]Problem 67, is the same challenge with
a triangle containing one hundred rows; it cannot be solved by brute
force, and requires a clever method! ;o)
Visible links
1. problem=67
Answer: 708f3cf8100d5e71834b1db77dfa15d6
Problem 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 on leap years, twenty nine.
A leap year occurs on any year evenly divisible by 4, but not on a
century unless it is divisible by 400.
How many Sundays fell on the first of the month during the twentieth
century (1 Jan 1901 to 31 Dec 2000)?
Answer: a4a042cf4fd6bfb47701cbc8a1653ada
Problem 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!
Answer: 443cb001c138b2561a0d90720d6ce111
Problem 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, 55 and 110; therefore d(220) = 284. The proper divisors of 284 are 1,
2, 4, 71 and 142; so d(284) = 220.
Evaluate the sum of all the amicable numbers under 10000.
Answer: 51e04cd4e55e7e415bf24de9e1b0f3ff
Problem 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 alphabetical order, COLIN, which
is worth 3 + 15 + 12 + 9 + 14 = 53, is the 938th name in the list. So,
COLIN would obtain a score of 938 53 = 49714.
What is the total of all the name scores in the file?
Visible links
1. names.txt
Answer: f2c9c91cb025746f781fa4db8be3983f
Problem 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 n and it is called abundant if this sum exceeds n.
As 12 is the smallest abundant number, 1 + 2 + 3 + 4 + 6 = 16, the
smallest number that can be written as the sum of two abundant numbers is
24. By mathematical analysis, it can be shown that all integers greater
than 28123 can be written as the sum of two abundant numbers. However,
this upper limit cannot be reduced any further by analysis even though it
is known that the greatest number that cannot be expressed as the sum of
two abundant numbers is less than this limit.
Find the sum of all the positive integers which cannot be written as the
sum of two abundant numbers.
Answer: 2c8258c0604152962f7787571511cf28
Problem 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 102 120 201 210
What is the millionth lexicographic permutation of the digits 0, 1, 2, 3,
4, 5, 6, 7, 8 and 9?

Answer: 7f155b45cb3f0a6e518d59ec348bff84
Problem 25
==========
The Fibonacci sequence is defined by the recurrence relation:
F[n] = F[n1] + F[n2], 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
F[12] = 144
The 12th term, F[12], is the first term to contain three digits.
What is the first term in the Fibonacci sequence to contain 1000 digits?
Answer: a376802c0811f1b9088828288eb0d3f0
Problem 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
1/3
1/4
1/5
1/6
1/7
1/8
1/9
1/10

=
=
=
=
=
=
=
=
=

0.5
0.(3)
0.25
0.2
0.1(6)
0.(142857)
0.125
0.(1)
0.1

Where 0.1(6) means 0.166666..., and has a 1 digit recurring cycle. It can
be seen that 1/7 has a 6 digit recurring cycle.
Find the value of d < 1000 for which ^1/[d] contains the longest recurring
cycle in its decimal fraction part.
Answer: 6aab1270668d8cac7cef2566a1c5f569

Problem 27
==========
Euler discovered the remarkable quadratic formula:
n + n + 41
It turns out
values n = 0
is divisible
divisible by

that the formula will produce 40 primes for the consecutive

to 39. However, when n = 40, 40^2 + 40 + 41 = 40(40 + 1) + 41
by 41, and certainly when n = 41, 41 + 41 + 41 is clearly
41.

The incredible formula n 79n + 1601 was discovered, which produces 80

primes for the consecutive values n = 0 to 79. The product of the
coefficients, 79 and 1601, is 126479.
Considering quadratics of the form:
n + an + b, where |a| < 1000 and |b| < 1000
where |n| is the modulus/absolute value of n
e.g. |11| = 11 and |4| = 4
Find the product of the coefficients, a and b, for the quadratic
expression that produces the maximum number of primes for consecutive
values of n, starting with n = 0.
Answer: 69d9e3218fd7abb6ff453ea96505183d
Problem 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
20
19
18
17

22
7
6
5
16

23
8
1
4
15

24
9
2
3
14

25
10
11
12
13

It can be verified that the sum of the numbers on the diagonals is 101.
What is the sum of the numbers on the diagonals in a 1001 by 1001 spiral
formed in the same way?
Answer: 0d53425bd7c5bf9919df3718c8e49fa6
Problem 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 sequence of 15 distinct terms:
4, 8, 9, 16, 25, 27, 32, 64, 81, 125, 243, 256, 625, 1024, 3125
How many distinct terms are in the sequence generated by a^b for 2 a
100 and 2 b 100?
Answer: 6f0ca67289d79eb35d19decbc0a08453
Problem 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.
Find the sum of all the numbers that can be written as the sum of fifth
powers of their digits.
Answer: 27a1779a8a8c323a307ac8a70bc4489d
Problem 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 + 150p + 220p + 15p + 12p + 31p
How many different ways can
2 be made using any number of coins?
Answer: 142dfe4a33d624d2b830a9257e96726d
Problem 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 pandigital.
Find the sum of all products whose multiplicand/multiplier/product
identity can be written as a 1 through 9 pandigital.
HINT: Some products can be obtained in more than one way so be sure to
only include it once in your sum.
Answer: 100f6e37d0b0564490a2ee27eff0660d
Problem 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 trivial examples of this type of fraction, less
than one in value, and containing two digits in the numerator and
denominator.
If the product of these four fractions is given in its lowest common
terms, find the value of the denominator.
Answer: f899139df5e1059396431415e770c6dd
Problem 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.
Answer: 60803ea798a0c0dfb7f36397d8d4d772
Problem 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?
Answer: b53b3a3d6ab90ce0268229151c9bde11
Problem 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.)
Answer: 0e175dc2f28833885f62e7345addff03
Problem 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 truncatable from left
to right and right to left.
NOTE: 2, 3, 5, and 7 are not considered to be truncatable primes.
Answer: cace46c61b00de1b60874936a093981d
Problem 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 multiplying by 1, 2, 3, 4,

and 5, giving the pandigital, 918273645, which is the concatenated product
of 9 and (1,2,3,4,5).
What is the largest 1 to 9 pandigital 9 digit number that can be formed as
the concatenated product of an integer with (1,2, ... , n) where n > 1?
Answer: f2a29ede8dc9fae7926dc7a4357ac25e
Problem 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?
Answer: fa83a11a198d5a7f0bf77a1987bcd006
Problem 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 expression.
d[1] d[10] d[100] d[1000] d[10000] d[100000] d[1000000]
Answer: 6f3ef77ac0e3619e98159e9b6febf557
Problem 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?
Answer: d0a1bd6ab4229b2d0754be8923431404

Problem 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 value. For
example, the word value for SKY is 19 + 11 + 25 = 55 = t[10]. If the word
value is a triangle number then we shall call the word a triangle word.
Using [1]words.txt, a 16K text file containing nearly two thousand common
English words, how many are triangle words?
Visible links
1. words.txt
Answer: 82aa4b0af34c2313a562076992e50aa3
Problem 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[4]=406 is divisible by 2
d[3]d[4]d[5]=063 is divisible by 3
d[4]d[5]d[6]=635 is divisible by 5
d[5]d[6]d[7]=357 is divisible by 7
d[6]d[7]d[8]=572 is divisible by 11
d[7]d[8]d[9]=728 is divisible by 13
d[8]d[9]d[10]=289 is divisible by 17
Find the sum of all 0 to 9 pandigital numbers with this property.
Answer: 115253b7721af0fdff25cd391dfc70cf
Problem 44
==========
Pentagonal numbers are generated by the formula, P[n]=n(3n1)/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 pentagonal numbers, P[j] and P[k], for which their sum
and difference are pentagonal and D = |P[k] P[j]| is minimised; what is
the value of D?
Answer: 2c2556cb85621309ca647465ffa62370
Problem 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(3n1)/2 1, 5, 12, 22, 35, ...
Hexagonal H[n]=n(2n1) 1, 6, 15, 28, 45, ...
It can be verified that T[285] = P[165] = H[143] = 40755.
Find the next triangle number that is also pentagonal and hexagonal.
Answer: 30dfe3e3b286add9d12e493ca7be63fc
Problem 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 + 21^2
15 = 7 + 22^2
21 = 3 + 23^2
25 = 7 + 23^2
27 = 19 + 22^2
33 = 31 + 21^2
It turns out that the conjecture was false.
What is the smallest odd composite that cannot be written as the sum of a
prime and twice a square?
Answer: 89abe98de6071178edb1b28901a8f459
Problem 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 prime
factors. What is the first of these numbers?
Answer: 748f517ecdc29106e2738f88aa7530f4
Problem 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.
Answer: 0829124724747ae1c65da8cae5263346
Problem 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, exhibiting this property, but there is one other 4 digit
increasing sequence.
What 12 digit number do you form by concatenating the three terms in this
sequence?
Answer: 0b99933d3e2a9addccbb663d46cbb592
Problem 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, and is equal to 953.
Which prime, below one million, can be written as the sum of the most

consecutive primes?
Answer: 73229bab6c5dc1c7cf7a4fa123caf6bc
Problem 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 numbers, yielding the family: 56003, 56113, 56333, 56443, 56663,
56773, and 56993. Consequently 56003, being the first member of this
family, is the smallest prime with this property.
Find the smallest prime which, by replacing part of the number (not
necessarily adjacent digits) with the same digit, is part of an eight
prime value family.
Answer: e2a8daa5eb919905dadd795593084c22
Problem 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.
Answer: a420384997c8a1a93d5a84046117c2aa
Problem 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(n1)...321, and 0! = 1.
r!(nr)!

It is not until n = 23, that a value exceeds one million: ^23C[10] =

1144066.

How many, not necessarily distinct, values of ^nC[r], for 1 n 100,

are greater than one million?
Answer: e3b21256183cf7c2c7a66be163579d37
Problem 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 cards are consecutive values.
Flush: All cards of the same suit.
Full House: Three of a kind and a pair.
Four of a Kind: Four cards of the same value.
Straight Flush: All cards are consecutive values of same suit.
Royal Flush: Ten, Jack, Queen, King, Ace, in same suit.
The cards are valued in the order:
2, 3, 4, 5, 6, 7, 8, 9, 10, Jack, Queen, King, Ace.
If two players have the same ranked hands then the rank made up of the
highest value wins; for example, a pair of eights beats a pair of fives
(see example 1 below). But if two ranks tie, for example, both players
have a pair of queens, then highest cards in each hand are compared (see
example 4 below); if the highest cards tie then the next highest cards are
compared, and so on.
Consider the following five hands dealt to two players:
Hand Player 1
1
5H 5C 6S 7S KD
Pair of Fives
2
5D 8C 9S JS AC
Highest card Ace
3
2D 9C AS AH AC
Three Aces
4D 6S 9H QH QC
4
Pair of Queens
Highest card Nine
2H 2D 4C 4D 4S
5
Full House
With Three Fours

Player 2
2C 3S 8S 8D TD
Pair of Eights
2C 5C 7D 8S QH
Highest card Queen
3D 6D 7D TD QD
Flush with Diamonds
3D 6D 7H QD QS
Pair of Queens
Highest card Seven
3C 3D 3S 9S 9D
Full House
with Three Threes

Winner
Player 2
Player 1
Player 2
Player 1
Player 1

The file, [1]poker.txt, contains one thousand random hands dealt to two
players. Each line of the file contains ten cards (separated by a single
space): the first five are Player 1's cards and the last five are Player
2's cards. You can assume that all hands are valid (no invalid characters
or repeated cards), each player's hand is in no specific order, and in
each hand there is a clear winner.
How many hands does Player 1 win?

Visible links
1. poker.txt
Answer: 142949df56ea8ae0be8b5306971900a4
Problem 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 that some numbers, like
196, never produce a palindrome. A number that never forms a palindrome
through the reverse and add process is called a Lychrel number. Due to the
theoretical nature of these numbers, and for the purpose of this problem,
we shall assume that a number is Lychrel until proven otherwise. In
addition you are given that for every number below ten thousand, it will
either (i) become a palindrome in less than fifty iterations, or, (ii) no
one, with all the computing power that exists, has managed so far to map
it to a palindrome. In fact, 10677 is the first number to be shown to
require over fifty iterations before producing a palindrome:
4668731596684224866951378664 (53 iterations, 28 digits).
Surprisingly, there are palindromic numbers that are themselves Lychrel
numbers; the first example is 4994.
How many Lychrel numbers are there below ten thousand?
NOTE: Wording was modified slightly on 24 April 2007 to emphasise the
theoretical nature of Lychrel numbers.
Answer: 077e29b11be80ab57e1a2ecabb7da330
Problem 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 sum?
Answer: c22abfa379f38b5b0411bc11fa9bf92f
Problem 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
1
1

+
+
+
+

1/2 = 3/2 =
1/(2 + 1/2)
1/(2 + 1/(2
1/(2 + 1/(2

1.5
= 7/5 = 1.4
+ 1/2)) = 17/12 = 1.41666...
+ 1/(2 + 1/2))) = 41/29 = 1.41379...

The next three expansions are 99/70, 239/169, and 577/408, but the eighth
expansion, 1393/985, is the first example where the number of digits in
the numerator exceeds the number of digits in the denominator.
In the first one thousand expansions, how many fractions contain a
numerator with more digits than denominator?
Answer: b3e3e393c77e35a4a3f3cbd1e429b5dc
Problem 58
==========
Starting with 1 and spiralling anticlockwise in the following way, a
square spiral with side length 7 is formed.
37
38
39
40
41
42
43

36
17
18
19
20
21
44

35
16
5
6
7
22
45

34
15
4
1
8
23
46

33
14
3
2
9
24
47

32
13
12
11
10
25
48

31
30
29
28
27
26
49

It is interesting to note that the odd squares lie along the bottom right
diagonal, but what is more interesting is that 8 out of the 13 numbers
lying along both diagonals are prime; that is, a ratio of 8/13 62%.
If one complete new layer is wrapped around the spiral above, a square
spiral with side length 9 will be formed. If this process is continued,
what is the side length of the square spiral for which the ratio of primes
along both diagonals first falls below 10%?
Answer: b62fc92a2561538525c89be63f36bf7b
Problem 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 each byte with a given value, taken from a secret key. The
advantage with the XOR function is that using the same encryption key on
the cipher text, restores the plain text; for example, 65 XOR 42 = 107,
then 107 XOR 42 = 65.
For unbreakable encryption, the key is the same length as the plain text
message, and the key is made up of random bytes. The user would keep the
encrypted message and the encryption key in different locations, and
without both "halves", it is impossible to decrypt the message.
Unfortunately, this method is impractical for most users, so the modified
method is to use a password as a key. If the password is shorter than the
message, which is likely, the key is repeated cyclically throughout the
message. The balance for this method is using a sufficiently long password
key for security, but short enough to be memorable.
Your task has been made easy, as the encryption key consists of three
lower case characters. Using [1]cipher1.txt, a file containing the
encrypted ASCII codes, and the knowledge that the plain text must contain
common English words, decrypt the message and find the sum of the ASCII
values in the original text.
Visible links
1. cipher1.txt
Answer: 68f891fe214e2bfa07c998ad5d0a390f
Problem 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 property.
Find the lowest sum for a set of five primes for which any two primes
concatenate to produce another prime.
Answer: a4b5a70ca8cf24d0eb4330748d1e72e5
Problem 61
==========
Triangle, square, pentagonal, hexagonal, heptagonal, and octagonal numbers
are all figurate (polygonal) numbers and are generated by the following
formulae:
Triangle
Square
Pentagonal
Hexagonal

P[3,n]=n(n+1)/2
P[4,n]=n^2
P[5,n]=n(3n1)/2
P[6,n]=n(2n1)

1,
1,
1,
1,

3,
4,
5,
6,

6, 10, 15, ...

9, 16, 25, ...
12, 22, 35, ...
15, 28, 45, ...

Heptagonal P[7,n]=n(5n3)/2 1, 7, 18, 34, 55, ...

Octagonal P[8,n]=n(3n2) 1, 8, 21, 40, 65, ...
The ordered set of three 4 digit numbers: 8128, 2882, 8281, has three
interesting properties.
1.The set is cyclic, in that the last two digits of each number is the
first two digits of the next number (including the last number with
the first).
2.Each polygonal type: triangle (P[3,127]=8128), square (P[4,91]=8281),
and pentagonal (P[5,44]=2882), is represented by a different number in
the set.
3.This is the only set of 4 digit numbers with this property.
Find the sum of the only ordered set of six cyclic 4 digit numbers for
which each polygonal type: triangle, square, pentagonal, hexagonal,
heptagonal, and octagonal, is represented by a different number in the
set.
Answer: caec17d84884addeec35c3610645ab63
Problem 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.
Answer: 8f46b522b5401b8b6df99a7410eea44b
Problem 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?
Answer: f457c545a9ded88f18ecee47145a72c0
Problem 64
==========
All square roots are periodic when written as continued fractions and can
be written in the form:
N = a[0] +

a[1] +
1

a[2] +
1

a[3] + ...

For example, let us consider 23:

23 = 4 + 23 4 = 4 +

1 = 4 +
1
1
1 + 23 3
234
7

If we continue we would get the following expansion:

23 = 4 +
1

1 +
1

3 +
1

1 +
1

8 + ...
The process can be summarised as follows:
a[0] = 4,
a[1] = 1,
a[2] = 3,
a[3] = 1,
a[4] = 8,
a[5] = 1,
a[6] = 3,
a[7] = 1,

1
234
7
233
2
233
7
234
1
234
7
233
2
233
7
234

= 23+4
7
= 7(23+3)
14
= 2(23+3)
14
= 7(23+4)
7
= 23+4
7
= 7(23+3)
14
= 2(23+3)
14
= 7(23+4)
7

=1 + 233
7
=3 + 233
2
=1 + 234
7
=8 + 234
=1 + 233
7
=3 + 233
2
=1 + 234
7
=8 + 234

It can be seen that the sequence is repeating. For conciseness, we use the
notation 23 = [4;(1,3,1,8)], to indicate that the block (1,3,1,8) repeats
indefinitely.
The first ten continued fraction representations of (irrational) square
roots are:
2=[1;(2)], period=1
3=[1;(1,2)], period=2
5=[2;(4)], period=1
6=[2;(2,4)], period=2
7=[2;(1,1,1,4)], period=4
8=[2;(1,4)], period=2
10=[3;(6)], period=1
11=[3;(3,6)], period=2
12= [3;(2,6)], period=2
13=[3;(1,1,1,1,6)], period=5
Exactly four continued fractions, for N 13, have an odd period.
How many continued fractions for N 10000 have an odd period?

Answer: dc960c46c38bd16e953d97cdeefdbc68
Problem 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. In a similar way, 23 =
[4;(1,3,1,8)].
It turns out that the sequence of partial values of continued fractions
for square roots provide the best rational approximations. Let us consider
the convergents for 2.
1 + 1 = 3/2
2
1 + 1 = 7/5
2 + 1
2
1 +
1
= 17/12
2 + 1
2 + 1
2
1 +
1
= 41/29
2 +
1
2 + 1
2 + 1
2
Hence the sequence of the first ten convergents for 2 are:
1, 3/2, 7/5, 17/12, 41/29, 99/70, 239/169, 577/408, 1393/985, 3363/2378,
...
What is most surprising is that the important mathematical constant,
e = [2; 1,2,1, 1,4,1, 1,6,1 , ... , 1,2k,1, ...].
The first ten terms in the sequence of convergents for e are:
2, 3, 8/3, 11/4, 19/7, 87/32, 106/39, 193/71, 1264/465, 1457/536, ...
The sum of digits in the numerator of the 10^th convergent is 1+4+5+7=17.
Find the sum of digits in the numerator of the 100^th convergent of the
continued fraction for e.
Answer: 7a614fd06c325499f1680b9896beedeb

Problem 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 13180^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 = {2, 3, 5, 6, 7}, we obtain the
following:
3^2
2^2
9^2
5^2
8^2

22^2
31^2
54^2
62^2
73^2

=
=
=
=
=

1
1
1
1
1

Hence, by considering minimal solutions in x for D 7, the largest x is

obtained when D=5.
Find the value of D 1000 in minimal solutions of x for which the largest
value of x is obtained.
Answer: 3a066bda8c96b9478bb0512f0a43028c
Problem 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 is, 3 + 7 + 4 + 9 = 23.
Find the maximum total from top to bottom in [1]triangle.txt, a 15K text
file containing a triangle with one hundred rows.
NOTE: This is a much more difficult version of [2]Problem 18. It is not
possible to try every route to solve this problem, as there are 2^99
altogether! If you could check one trillion (10^12) routes every second it
would take over twenty billion years to check them all. There is an
efficient algorithm to solve it. ;o)
Visible links
1. triangle.txt

2. problem=18
Answer: 9d702ffd99ad9c70ac37e506facc8c38
Problem 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
described by the set: 4,3,2; 6,2,1; 5,1,3.
It is possible to complete the ring with four different totals: 9, 10, 11,
and 12. There are eight solutions in total.
Total
9
9
10
10
11
11
12
12

Solution Set
4,2,3; 5,3,1;
4,3,2; 6,2,1;
2,3,5; 4,5,1;
2,5,3; 6,3,1;
1,4,6; 3,6,2;
1,6,4; 5,4,2;
1,5,6; 2,6,4;
1,6,5; 3,5,4;

6,1,2
5,1,3
6,1,3
4,1,5
5,2,4
3,2,6
3,4,5
2,4,6

By concatenating each group it is possible to form 9 digit strings; the

maximum string for a 3 gon ring is 432621513.
Using the numbers 1 to 10, and depending on arrangements, it is possible
to form 16 and 17 digit strings. What is the maximum 16 digit string for
a "magic" 5 gon ring?
p_068_1.gif
p_068_2.gif
Answer: 26227442c6fed0292a528ac3790175be
Problem 69
==========
Euler's Totient function, (n) [sometimes called the phi unction], is
used to determine the number o 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 Relatively Prime (n) n/(n)

2 1
1
2

3 1,2
2
1.5

4 1,3
2
2

 5 1,2,3,4
4
1.25

6 1,5
2
3

7 1,2,3,4,5,6
6
1.1666...

8 1,3,5,7
4
2

9 1,2,4,5,7,8
6
1.5

10 1,3,7,9
4
2.5

It can be seen that n=6 produces a maximum n/(n) or n 10.

Find the value o n 1,000,000 or which n/(n) is a maximum.
Answer: b08b01ead83cbd62a9839ca1c35ada
Problem 70
==========
Euler's Totient unction, (n) [sometimes called the phi unction], is
used to determine the number o 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 relatively prime to every positive
number, so (1)=1.
Interestingly, (87109)=79180, and it can be seen that 87109 is a
permutation o 79180.
Find the value o n, 1 < n < 10^7, or which (n) is a permutation o n
and the ratio n/(n) produces a minimum.
Answer: 1884dde67ced589082c8b7043abce181
Problem 71
==========
Consider the raction, n/d, where n and d are positive integers. I n<d
and HCF(n,d)=1, it is called a reduced proper raction.
I we list the set o reduced proper ractions or d 8 in ascending
order o 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,
5/7, 3/4, 4/5, 5/6, 6/7, 7/8
It can be seen that 2/5 is the raction immediately to the let o 3/7.
By listing the set o reduced proper ractions or d 1,000,000 in
ascending order o size, ind the numerator o the raction immediately to
the let o 3/7.

Answer: 7138a204db30be52883d583bd6
Problem 72
==========
Consider the raction, n/d, where n and d are positive integers. I n<d
and HCF(n,d)=1, it is called a reduced proper raction.
I we list the set o reduced proper ractions or d 8 in ascending
order o 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,
5/7, 3/4, 4/5, 5/6, 6/7, 7/8
It can be seen that there are 21 elements in this set.
How many elements would be contained in the set o reduced proper
ractions or d 1,000,000?
Answer: 0384b529dc651e0460ac3e9ac5d
Problem 73
==========
Consider the raction, n/d, where n and d are positive integers. I n<d
and HCF(n,d)=1, it is called a reduced proper raction.
I we list the set o reduced proper ractions or d 8 in ascending
order o 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,
5/7, 3/4, 4/5, 5/6, 6/7, 7/8
It can be seen that there are 3 ractions between 1/3 and 1/2.
How many ractions lie between 1/3 and 1/2 in the sorted set o reduced
proper ractions or d 12,000?
Answer: 990a49eb4746724441371e5528a1b
Problem 74
==========
The number 145 is well known or the property that the sum o the
actorial o 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 o
numbers that link back to 169; it turns out that there are only three such

loops that exist:

169 363601 1454 169
871 45361 871
872 45362 872
It is not diicult to prove that EVERY starting number will eventually
get stuck in a loop. For example,
69 363600 1454 169 363601 ( 1454)
78 45360 871 45361 ( 871)
540 145 ( 145)
Starting with 69 produces a chain o ive non-repeating terms, but the
longest non-repeating chain with a starting number below one million is
sixty terms.
How many chains, with a starting number below one million, contain exactly
sixty non-repeating terms?
Answer: 69cb3ea317a32c4e6143e665db20b14
Problem 75
==========
It turns out that 12 cm is the smallest length o wire that can be bent to
orm an integer sided right angle triangle in exactly one way, but there
are many more examples.
12
24
30
36
40
48

cm:
cm:
cm:
cm:
cm:
cm:

(3,4,5)
(6,8,10)
(5,12,13)
(9,12,15)
(8,15,17)
(12,16,20)

In contrast, some lengths o wire, like 20 cm, cannot be bent to orm an

integer sided right angle triangle, and other lengths allow more than one
solution to be ound; or example, using 120 cm it is possible to orm
exactly three dierent integer sided right angle triangles.
120 cm: (30,40,50), (20,48,52), (24,45,51)
Given that L is the length o the wire, or how many values o L
1,500,000 can exactly one integer sided right angle triangle be ormed?
Answer: 583e391a7bd8778541272486433cb
Problem 76
==========
It is possible to write ive as a sum in exactly six dierent ways:
4 + 1

3
3
2
2
1

+
+
+
+
+

2
1
2
1
1

+
+
+
+

1
1
1 + 1
1 + 1 + 1

How many dierent ways can one hundred be written as a sum o at least
two positive integers?
Answer: 18ed001e082bee0049ae1272689d2
Problem 77
==========
It is possible to write ten as the sum o primes in exactly ive dierent
ways:
7
5
5
3
2

+
+
+
+
+

3
5
3 + 2
3 + 2 + 2
2 + 2 + 2 + 2

What is the irst value which can be written as the sum o primes in over
ive thousand dierent ways?
Answer: e2c420d928d4b8ce02ec19b371514
Problem 78
==========
Let p(n) represent the number o dierent ways in which n coins can be
separated into piles. For example, ive coins can separated into piles in
exactly seven dierent ways, so p(5)=7.
OOOOO
OOOO O
OOO OO
OOO O O
OO OO O
OO O O O
O O O O O
Find the least value o n or which p(n) is divisible by one million.
Answer: e2a8695e428116131cc94c651d0e566

Problem 79
==========
A common security method used or online banking is to ask the user or
three random characters rom a passcode. For example, i the passcode was
531278, they may ask or the 2nd, 3rd, and 5th characters; the expected
reply would be: 317.
The text ile, [1]keylog.txt, contains ity successul login attempts.
Given that the three characters are always asked or in order, analyse the
ile so as to determine the shortest possible secret passcode o unknown
length.
Visible links
1. keylog.txt
Answer: 3ccc6e16d99b21d429486d49b90a30
Problem 80
==========
It is well known that i the square root o a natural number is not an
integer, then it is irrational. The decimal expansion o such square roots
is ininite without any repeating pattern at all.
The square root o two is 1.41421356237309504880..., and the digital sum
o the irst one hundred decimal digits is 475.
For the irst one hundred natural numbers, ind the total o the digital
sums o the irst one hundred decimal digits or all the irrational square
roots.
Answer: 6cc501a25298e4051886e1a126e9484
Problem 81
==========
In the 5 by 5 matrix below, the minimal path sum rom the top let to the
bottom right, by only moving to the right and down, is indicated in bold
red and is equal to 2427.
131
201
630
537
805

673
96
803
699
732

234
342
746
497
524

103
965
422
121
37

18
150
111
956
331

Find the minimal path sum, in [1]matrix.txt, a 31K text ile containing a
80 by 80 matrix, rom the top let to the bottom right by only moving
right and down.

Visible links
1. matrix.txt
Answer: 9ec84499832add77e6a8bb00246ec
Problem 82
==========
NOTE: This problem is a more challenging version o [1]Problem 81.
The minimal path sum in the 5 by 5 matrix below, by starting in any cell
in the let column and inishing 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.
131
201
630
537
805

673
96
803
699
732

234
342
746
497
524

103
965
422
121
37

18
150
111
956
331

Find the minimal path sum, in [2]matrix.txt, a 31K text ile containing a
80 by 80 matrix, rom the let column to the right column.
Visible links
1. problem=81
2. matrix.txt
Answer: e6b3b1cd89b018d4754c638636690a
Problem 83
==========
NOTE: This problem is a signiicantly more challenging version o
[1]Problem 81.
In the 5 by 5 matrix below, the minimal path sum rom the top let to the
bottom right, by moving let, right, up, and down, is indicated in bold
red and is equal to 2297.
131
201
630
537
805

673
96
803
699
732

234
342
746
497
524

103
965
422
121
37

18
150
111
956
331

Find the minimal path sum, in [2]matrix.txt, a 31K text ile containing a
80 by 80 matrix, rom the top let to the bottom right by moving let,
right, up, and down.
Visible links
1. problem=81
2. matrix.txt
Answer: 61b28c4be8560003ee50a5619d7a1e

Problem 84
==========
In the game, Monopoly, the standard board is set up in the ollowing way:
GO
H2
T2
H1
CH3
R4
G3
CC3
G2
G1
G2J

A1 CC1 A2 T1 R1 B1 CH1 B2 B3 JAIL

C1

U1

C2

C3

R2

D1

CC2

D2

D3
F3 U2 F2 F1 R3 E3 E2 CH2 E1 FP

A player starts on the GO square and adds the scores on two 6-sided dice
to determine the number o squares they advance in a clockwise direction.
Without any urther rules we would expect to visit each square with equal
probability: 2.5%. However, landing on G2J (Go To Jail), CC (community
chest), and CH (chance) changes this distribution.
In addition to G2J, and one card rom each o CC and CH, that orders the
player to go directly to jail, i a player rolls three consecutive
doubles, they do not advance the result o their 3rd roll. Instead they
proceed directly to jail.
At the beginning o the game, the CC and CH cards are shuled. When a
player lands on CC or CH they take a card rom the top o the respective
pile and, ater ollowing the instructions, it is returned to the bottom
o the pile. There are sixteen cards in each pile, but or the purpose o
this problem we are only concerned with cards that order a movement; any
instruction not concerned with movement will be ignored and the player
will remain on the CC/CH square.
Community Chest (2/16 cards):
1.Advance to GO
2.Go to JAIL
Chance (10/16 cards):
1.Advance to GO
2.Go to JAIL
3.Go to C1
4.Go to E3
5.Go to H2
6.Go to R1
7.Go to next R (railway company)
8.Go to next R
9.Go to next U (utility company)
10.Go back 3 squares.
The heart o this problem concerns the likelihood o visiting a particular
square. That is, the probability o inishing at that square ater a roll.
For this reason it should be clear that, with the exception o G2J or
which the probability o inishing on it is zero, the CH squares will have
the lowest probabilities, as 5/8 request a movement to another square, and

it is the inal square that the player inishes at on each roll that we
are interested in. We shall make no distinction between "Just Visiting"
and being sent to JAIL, and we shall also ignore the rule about requiring
a double to "get out o jail", assuming that they pay to get out on their
next turn.
By starting at GO and numbering the squares sequentially rom 00 to 39 we
can concatenate these two-digit numbers to produce strings that correspond
with sets o squares.
Statistically it can be shown that the three most popular squares, in
order, are JAIL (6.24%) = Square 10, E3 (3.18%) = Square 24, and GO
(3.09%) = Square 00. So these three most popular squares can be listed
with the six-digit modal string: 102400.
I, instead o using two 6-sided dice, two 4-sided dice are used, ind the
six-digit modal string.
Answer: ead3264438e83a8c2da2e98067b4445
Problem 85
==========
By counting careully 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, ind the area o the grid with the nearest solution.
p_085.gi
Answer: 92b5e6240737e0326ea59846a83e076
Problem 86
==========
A spider, S, sits in one corner o a cuboid room, measuring 6 by 5 by 3,
and a ly, F, sits in the opposite corner. By travelling on the suraces
o the room the shortest "straight line" distance rom S to F is 10 and
the path is shown on the diagram.
However, there are up to three "shortest" path candidates or any given
cuboid and the shortest route doesn't always have integer length.
By considering all cuboid rooms with integer dimensions, up to a maximum
size o M by M by M, there are exactly 2060 cuboids or which the shortest
route has integer length when M=100, and this is the least value o M or
which the number o solutions irst exceeds two thousand; the number o
solutions is 1975 when M=99.
Find the least value o M such that the number o solutions irst exceeds
one million.
p_086.gi

Answer: 5c3dd7514b620a1b85450d2ae374b1
Problem 87
==========
The smallest number expressible as the sum o a prime square, prime cube,
and prime ourth power is 28. In act, there are exactly our numbers
below ity that can be expressed in such a way:
28
33
49
47

=
=
=
=

2^2
3^2
5^2
2^2

+
+
+
+

2^3
2^3
2^3
3^3

+
+
+
+

2^4
2^4
2^4
2^4

How many numbers below ity million can be expressed as the sum o a
prime square, prime cube, and prime ourth power?
Answer: e7b79071a626cc42e787e367ec602
Problem 88
==========
A natural number, N, that can be written as the sum and product o a given
set o 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 o size, k, we shall call the smallest N with this
property a minimal product-sum number. The minimal product-sum numbers or
sets o size, k = 2, 3, 4, 5, and 6 are as ollows.
k=2:
k=3:
k=4:
k=5:
k=6:

4 = 2 2 = 2 + 2
6 = 1 2 3 = 1 + 2 + 3
8 = 1 1 2 4 = 1 + 1 + 2 + 4
8 = 1 1 2 2 2 = 1 + 1 + 2 + 2 + 2
12 = 1 1 1 1 2 6 = 1 + 1 + 1 + 1 + 2 + 6

Hence or 2k6, the sum o all the minimal product-sum numbers is
4+6+8+12 = 30; note that 8 is only counted once in the sum.
In act, as the complete set o minimal product-sum numbers or 2k12 is
{4, 6, 8, 12, 15, 16}, the sum is 61.
What is the sum o all the minimal product-sum numbers or 2k12000?
Answer: de725143906d31534ae69a555757
Problem 89
==========

The rules or writing Roman numerals allow or many ways o writing each
number (see [1]About Roman Numerals...). However, there is always a "best"
way o writing a particular number.
For example, the ollowing represent all o the legitimate ways o writing
the number sixteen:
IIIIIIIIIIIIIIII
VIIIIIIIIIII
VVIIIIII
XIIIIII
VVVI
XVI
The last example being considered the most eicient, as it uses the least
number o numerals.
The 11K text ile, [2]roman.txt, contains one thousand numbers written in
valid, but not necessarily minimal, Roman numerals; that is, they are
arranged in descending units and obey the subtractive pair rule (see
[3]About Roman Numerals... or the deinitive rules or this problem).
Find the number o characters saved by writing each o these in their
minimal orm.
Note: You can assume that all the Roman numerals in the ile contain no
more than our consecutive identical units.
Visible links
1. about=roman_numerals
2. roman.txt
3. about=roman_numerals
Answer: 5c572eca050594c7bc3c36e7e8ab9550
Problem 90
==========
Each o the six aces on a cube has a dierent digit (0 to 9) written on
it; the same is done to a second cube. By placing the two cubes
side-by-side in dierent positions we can orm a variety o 2-digit
numbers.
For example, the square number 64 could be ormed:
In act, by careully choosing the digits on both cubes it is possible to
display all o the square numbers below one-hundred: 01, 04, 09, 16, 25,
36, 49, 64, and 81.
For example, one way this can be achieved is by placing {0, 5, 6, 7, 8, 9}
on one cube and {1, 2, 3, 4, 8, 9} on the other cube.
However, or this problem we shall allow the 6 or 9 to be turned
upside-down so that an arrangement like {0, 5, 6, 7, 8, 9} and {1, 2, 3,
4, 6, 7} allows or all nine square numbers to be displayed; otherwise it
would be impossible to obtain 09.
In determining a distinct arrangement we are interested in the digits on

each cube, not the order.

{1, 2, 3, 4, 5, 6} is equivalent to {3, 6, 4, 1, 2, 5}
{1, 2, 3, 4, 5, 6} is distinct rom {1, 2, 3, 4, 5, 9}
But because we are allowing 6 and 9 to be reversed, the two distinct sets
in the last example both represent the extended set {1, 2, 3, 4, 5, 6, 9}
or the purpose o orming 2-digit numbers.
How many distinct arrangements o the two cubes allow or all o the
square numbers to be displayed?
p_090.gi
Answer: 6a61d423d02a1c56250dc23ae7123
Problem 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 orm OPQ.
There are exactly ourteen triangles containing a right angle that can be
ormed when each co-ordinate lies between 0 and 2 inclusive; that is,
0 x[1], y[1], x[2], y[2] 2.
Given that 0 x[1], y[1], x[2], y[2] 50, how many right triangles can
be ormed?
p_091_1.gi
p_091_2.gi
Answer: e8dc153260a59d4236cd7439d5dd3
Problem 92
==========
A number chain is created by continuously adding the square o the digits
in a number to orm a new number until it has been seen beore.
For example,
44 32 13 10 1 1
85 89 145 42 20 4 16 37 58 89
Thereore any chain that arrives at 1 or 89 will become stuck in an
endless loop. What is most amazing is that EVERY starting number will
eventually arrive at 1 or 89.
How many starting numbers below ten million will arrive at 89?
Answer: 6cee918c0612bccc2dac03d05e07035
Problem 93

==========
By using each o the digits rom the set, {1, 2, 3, 4}, exactly once, and
making use o the our arithmetic operations (+, , *, /) and
brackets/parentheses, it is possible to form different positive integer
targets.
For example,
8 = (4
14 = 4
19 = 4
36 = 3

*
*
*
*

(1 + 3)) / 2
(3 + 1 / 2)
(2 + 3) 1
4 * (2 + 1)

Note that concatenations of the digits, like 12 + 34, are not allowed.
Using the set, {1, 2, 3, 4}, it is possible to obtain thirty one different
target numbers of which 36 is the maximum, and each of the numbers 1 to 28
can be obtained before encountering the first non expressible number.
Find the set of four distinct digits, a < b < c < d, for which the longest
set of consecutive positive integers, 1 to n, can be obtained, giving your
answer as a string: abcd.
Answer: 26588e932c7ccfa1df309280702fe1b5
Problem 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 than one unit.
Find the sum of the perimeters of all almost equilateral triangles with
integral side lengths and area and whose perimeters do not exceed one
billion (1,000,000,000).
Answer: 3218c6bb59f2539ec39ad4bf37c10913
Problem 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 divisors of 284 is 220, forming a chain of two numbers. For
this reason, 220 and 284 are called an amicable pair.

Perhaps less well known are longer chains. For example, starting with
12496, we form a chain of five numbers:
12496 14288 15472 14536 14264 ( 12496 ...)
Since this chain returns to its starting point, it is called an amicable
chain.
Find the smallest member of the longest amicable chain with no element
exceeding one million.
Answer: cd2018beeece5fb0a71a96308e567bde
Problem 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 (or zeros) in a 9 by 9 grid in such that each row,
column, and 3 by 3 box contains each of the digits 1 to 9. Below is an
example of a typical starting puzzle grid and its solution grid.

0 0 3 0 2 0 6 0 0
9 0 0 3 0 5 0 0 1
0 0 1 8 0 6 4 0 0

0 0 8 1 0 2 9 0 0
7 0 0 0 0 0 0 0 8
0 0 6 7 0 8 2 0 0

0 0 2 6 0 9 5 0 0
8 0 0 2 0 3 0 0 9
0 0 5 0 1 0 3 0 0

4 8 3 9 2 1 6 5 7
9 6 7 3 4 5 8 2 1
2 5 1 8 7 6 4 9 3

5 4 8 1 3 2 9 7 6
7 2 9 5 6 4 1 3 8
1 3 6 7 9 8 2 4 5

3 7 2 6 8 9 5 1 4
8 1 4 2 5 3 7 6 9
6 9 5 4 1 7 3 8 2

A well constructed Su Doku puzzle has a unique solution and can be solved
by logic, although it may be necessary to employ "guess and test" methods
in order to eliminate options (there is much contested opinion over this).
The complexity o the search determines the diiculty o the puzzle; the
example above is considered easy because it can be solved by straight
orward direct deduction.
The 6K text ile, [1]sudoku.txt, contains ity dierent Su Doku puzzles
ranging in diiculty, but all with unique solutions (the irst puzzle in
the ile is the example above).
By solving all ity puzzles ind the sum o the 3-digit numbers ound in
the top let corner o each solution grid; or example, 483 is the 3-digit
number ound in the top let corner o the solution grid above.
Visible links
1. sudoku.txt
Answer: 266aba0d7725e678e371897d5d0

Problem 97
==========
The irst
1999, and
2,098,960
have been

known prime ound to exceed one million digits was discovered in

is a Mersenne prime o the orm 2^69725931; it contains exactly
digits. Subsequently other Mersenne primes, of the form 2^p1,
found which contain more digits.

However, in 2004 there was found a massive non Mersenne prime which
contains 2,357,207 digits: 284332^7830457+1.
Find the last ten digits of this prime number.
Answer: 68c8c919526039022b923a72d5cc12b1
Problem 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 and specify further that leading zeroes are not
permitted, neither may a different letter have the same digital value as
another letter.
Using [1]words.txt, a 16K text file containing nearly two thousand common
English words, find all the square anagram word pairs (a palindromic word
is NOT considered to be an anagram of itself).
What is the largest square number formed by any member of such a pair?
NOTE: All anagrams formed must be contained in the given text file.
Visible links
1. words.txt
Answer: 36b3b5f54143786b7ab2ebb6bcd06e75
Problem 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 22K text file containing one thousand lines with
a base/exponent pair on each line, determine which line number has the
greatest numerical value.

NOTE: The first two lines in the file represent the numbers in the example
given above.
Visible links
1. base_exp.txt
Answer: 1ecfb463472ec9115b10c292ef8bc986
Problem 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 blue discs at random, is a box containing eighty five blue discs and
thirty five red discs.
By finding the first arrangement to contain over 10^12 = 1,000,000,000,000
discs in total, determine the number of blue discs that the box would
contain.
Answer: 21156e3acc4ca35b7a318c541a0648d5
Problem 101
===========
If we are presented with the first k terms of a sequence it is impossible
to say with certainty the value of the next term, as there are infinitely
many polynomial functions that can model the sequence.
As an example, let us consider the sequence of cube numbers. This is
defined by the generating function,
u[n] = n^3: 1, 8, 27, 64, 125, 216, ...
Suppose we were only given the first two terms of this sequence. Working
on the principle that "simple is best" we should assume a linear
relationship and predict the next term to be 15 (common difference 7).
Even if we were presented with the first three terms, by the same
principle of simplicity, a quadratic relationship should be assumed.
We shall define OP(k, n) to be the n^th term of the optimum polynomial
generating function for the first k terms of a sequence. It should be
clear that OP(k, n) will accurately generate the terms of the sequence for
n k, and potentially the first incorrect term (FIT) will be OP(k, k+1);
in which case we shall call it a bad OP (BOP).
As a basis, if we were only given the first term of sequence, it would be
most sensible to assume constancy; that is, for n 2, OP(1, n) = u[1].
Hence we obtain the following OPs for the cubic sequence:
OP(1, n) = 1

1, 1, 1, 1, ...

OP(2, n) = 7n6
1, 8, 15, ...
OP(3, n) = 6n^211n+6 1, 8, 27, 58, ...
OP(4, n) = n^3
1, 8, 27, 64, 125, ...
Clearly no BOPs exist for k 4.
By considering the sum of FITs generated by the BOPs (indicated in red
above), we obtain 1 + 15 + 58 = 74.
Consider the following tenth degree polynomial generating function:
u[n] = 1 n + n^2 n^3 + n^4 n^5 + n^6 n^7 + n^8 n^9 + n^10
Find the sum of FITs for the BOPs.
Answer: d382b0cc25e82446da83d3a792e1cd27
Problem 102
===========
Three distinct points are plotted at random on a Cartesian plane, for
which 1000 x, y 1000, such that a triangle is formed.
Consider the following two triangles:
A( 340,495), B( 153, 910), C(835, 947)
X( 175,41), Y( 421, 714), Z(574, 645)
It can be verified that triangle ABC contains the origin, whereas triangle
XYZ does not.
Using [1]triangles.txt, a 27K text file containing the co ordinates of one
thousand "random" triangles, find the number of triangles for which the
interior contains the origin.
NOTE: The first two examples in the file represent the triangles in the
example given above.
Visible links
1. triangles.txt
Answer: 74db120f0a8e5646ef5a30154e9f6deb
Problem 103
===========
Let S(A) represent the sum of elements in set A of size n. We shall call
it a special sum set if for any two non empty disjoint subsets, B and C,
the following properties are true:
i.S(B) S(C); that is, sums of subsets cannot be equal.
ii.If B contains more elements than C then S(B) > S(C).
If S(A) is minimised for a given n, we shall call it an optimum special

sum set. The first five optimum special sum sets are given below.
n
n
n
n
n

=
=
=
=
=

1:
2:
3:
4:
5:

{1}
{1,
{2,
{3,
{6,

2}
3, 4}
5, 6, 7}
9, 11, 12, 13}

It seems that for a given optimum set, A = {a[1], a[2], ... , a[n]}, the
next optimum set is of the form B = {b, a[1]+b, a[2]+b, ... ,a[n]+b},
where b is the "middle" element on the previous row.
By applying this "rule" we would expect the optimum set for n = 6 to be A
= {11, 17, 20, 22, 23, 24}, with S(A) = 117. However, this is not the
optimum set, as we have merely applied an algorithm to provide a near
optimum set. The optimum set for n = 6 is A = {11, 18, 19, 20, 22, 25},
with S(A) = 115 and corresponding set string: 111819202225.
Given that A is an optimum special sum set for n = 7, find its set string.
NOTE: This problem is related to [1]Problem 105 and [2]Problem 106.
Visible links
1. problem=105
2. problem=106
Answer: af8c238336c2a79bb81a24b3fef3330d
Problem 104
===========
The Fibonacci sequence is defined by the recurrence relation:
F[n] = F[n1] + F[n2], where F[1] = 1 and F[2] = 1.
It turns out that F[541], which contains 113 digits, is the first
Fibonacci number for which the last nine digits are 1 9 pandigital
(contain all the digits 1 to 9, but not necessarily in order). And
F[2749], which contains 575 digits, is the first Fibonacci number for
which the first nine digits are 1 9 pandigital.
Given that F[k] is the first Fibonacci number for which the first nine
digits AND the last nine digits are 1 9 pandigital, find k.
Answer: c8771ddd4df191098d70a8e94dd1cde7
Problem 105
===========
Let S(A) represent the sum of elements in set A of size n. We shall call
it a special sum set if for any two non empty disjoint subsets, B and C,
the following properties are true:
i.S(B) S(C); that is, sums of subsets cannot be equal.
ii.If B contains more elements than C then S(B) > S(C).

For example, {81, 88, 75, 42, 87, 84, 86, 65} is not a special sum set
because 65 + 87 + 88 = 75 + 81 + 84, whereas {157, 150, 164, 119, 79, 159,
161, 139, 158} satisfies both rules for all possible subset pair
combinations and S(A) = 1286.
Using [1]sets.txt (right click and "Save Link/Target As..."), a 4K text
file with one hundred sets containing seven to twelve elements (the two
examples given above are the first two sets in the file), identify all the
special sum sets, A[1], A[2], ..., A[k], and find the value of S(A[1]) +
S(A[2]) + ... + S(A[k]).
NOTE: This problem is related to [2]Problem 103 and [3]Problem 106.
Visible links
1. sets.txt
2. problem=103
3. problem=106
Answer: c87d30e494eff438fe37b4c810167da0
Problem 106
===========
Let S(A) represent the sum of elements in set A of size n. We shall call
it a special sum set if for any two non empty disjoint subsets, B and C,
the following properties are true:
i.S(B) S(C); that is, sums of subsets cannot be equal.
ii.If B contains more elements than C then S(B) > S(C).
For this problem we shall assume that a given set contains n strictly
increasing elements and it already satisfies the second rule.
Surprisingly, out of the 25 possible subset pairs that can be obtained
from a set for which n = 4, only 1 of these pairs need to be tested for
equality (first rule). Similarly, when n = 7, only 70 out of the 966
subset pairs need to be tested.
For n = 12, how many of the 261625 subset pairs that can be obtained need
to be tested for equality?
NOTE: This problem is related to [1]Problem 103 and [2]Problem 105.
Visible links
1. problem=103
2. problem=105
Answer: c8fd9e36fdeb06bcc93a0732c667b6d8
Problem 107
===========
The following undirected network consists of seven vertices and twelve
edges with a total weight of 243.

The same network can be represented by the matrix below.

A B C D E F G

A
- 16 12 21 - - -

B
16 - - 17 20 - -

C
12 - - 28 - 31 -

D
21 17 28 - 18 19 23

E
- 20 - 18 - - 11

F
- - 31 19 - - 27

G
- - - 23 11 27 -

However, it is possible to optimise the network by removing some edges and

still ensure that all points on the network remain connected. The network
which achieves the maximum saving is shown below. It has a weight o 93,
representing a saving o 243 93 = 150 from the original network.
Using [1]network.txt, a 6K text file containing a network with forty
vertices, and given in matrix form, find the maximum saving which can be
achieved by removing redundant edges whilst ensuring that the network
remains connected.
Visible links
1. network.txt
p_107_1.gif
p_107_2.gif
Answer: b0db1202ec966e7855ca23626eb285b8
Problem 108
===========
In the following equation x, y, and n are positive integers.
1 1 1
+ =
x y n
For n = 4 there are exactly three distinct solutions:
1 1
1
+ =
5 20 4
1 1
1
+ =
6 12 4
1 1
1
+ =
8 8
4

What is the least value o n or which the number o distinct solutions
exceeds one-thousand?
NOTE: This problem is an easier version o [1]Problem 110; it is strongly
advised that you solve this one irst.
Visible links
1. problem=110
Answer: 765ba18edd2844db2db95ba25d23e7
Problem 109
===========
In the game o darts a player throws three darts at a target board which
is split into twenty equal sized sections numbered one to twenty.
The score o a dart is determined by the number o the region that the
dart lands in. A dart landing outside the red/green outer ring scores
zero. The black and cream regions inside this ring represent single
scores. However, the red/green outer ring and middle ring score double and
treble scores respectively.
At the centre o the board are two concentric circles called the bull
region, or bulls-eye. The outer bull is worth 25 points and the inner bull
is a double, worth 50 points.
There are many variations o rules but in the most popular game the
players will begin with a score 301 or 501 and the irst player to reduce
their running total to zero is a winner. However, it is normal to play a
"doubles out" system, which means that the player must land a double
(including the double bulls-eye at the centre o the board) on their inal
dart to win; any other dart that would reduce their running total to one
or lower means the score or that set o three darts is "bust".
When a player is able to inish on their current score it is called a
"checkout" and the highest checkout is 170: T20 T20 D25 (two treble 20s
and double bull).
There are exactly eleven distinct ways to checkout on a score o 6:

D3

D1D2

S2D2

D2D1

S4D1

S1S1D2

S1T1D1

S1S3D1

D1D1D1

D1S2D1

S2S2D1

Note that D1 D2 is considered dierent to D2 D1 as they inish on

dierent doubles. However, the combination S1 T1 D1 is considered the
same as T1 S1 D1.
In addition we shall not include misses in considering combinations; or
example, D3 is the same as 0 D3 and 0 0 D3.
Incredibly there are 42336 distinct ways o checking out in total.
How many distinct ways can a player checkout with a score less than 100?
p_109.gi
Answer: e6aebd5be1ba81557dbcc5657bbe5c
Problem 110
===========
In the ollowing equation x, y, and n are positive integers.
1 1 1
+ =
x y n
It can be veriied that when n = 1260 there are 113 distinct solutions and
this is the least value o n or which the total number o distinct
solutions exceeds one hundred.
What is the least value o n or which the number o distinct solutions
exceeds our million?
NOTE: This problem is a much more diicult version o [1]Problem 108 and
as it is well beyond the limitations o a brute orce approach it requires
a clever implementation.
Visible links
1. problem=108
Answer: 591a7a9210322866e6a023b2386a1c
Problem 111
===========
Considering 4-digit primes containing repeated digits it is clear that
they cannot all be the same: 1111 is divisible by 11, 2222 is divisible by
22, and so on. But there are nine 4-digit primes containing three ones:
1117, 1151, 1171, 1181, 1511, 1811, 2111, 4111, 8111

We shall say that M(n, d) represents the maximum number o repeated digits
or an n-digit prime where d is the repeated digit, N(n, d) represents the
number o such primes, and S(n, d) represents the sum o these primes.
So M(4, 1) = 3 is the maximum number o repeated digits or a 4-digit
prime where one is the repeated digit, there are N(4, 1) = 9 such primes,
and the sum o these primes is S(4, 1) = 22275. It turns out that or d =
0, it is only possible to have M(4, 0) = 2 repeated digits, but there are
N(4, 0) = 13 such cases.
In the same way we obtain the ollowing results or 4-digit primes.

Digit, d M(4, d) N(4, d) S(4, d)

0
2
13
67061

1
3
9
22275

2
3
1
2221

3
3
12
46214

4
3
2
8888

5
3
1
5557

6
3
1
6661

7
3
9
57863

8
3
1
8887

9
3
7
48073

For d = 0 to 9, the sum o all S(4, d) is 273700.

Find the sum o all S(10, d).
Answer: cd4d134a3b0caa10a69e2771ac4d36
Problem 112
===========
Working rom let-to-right i no digit is exceeded by the digit to its
let it is called an increasing number; or example, 134468.
Similarly i no digit is exceeded by the digit to its right it is called a
decreasing number; or example, 66420.
We shall call a positive integer that is neither increasing nor decreasing
a "bouncy" number; or example, 155349.
Clearly there cannot be any bouncy numbers below one-hundred, but just
over hal o the numbers below one-thousand (525) are bouncy. In act, the
least number or which the proportion o bouncy numbers irst reaches 50%

is 538.
Surprisingly, bouncy numbers become more and more common and by the time
we reach 21780 the proportion o bouncy numbers is equal to 90%.
Find the least number or which the proportion o bouncy numbers is
exactly 99%.
Answer: e08c982713a1c2bd3637dd489199722e
Problem 113
===========
Working rom let-to-right i no digit is exceeded by the digit to its
let it is called an increasing number; or example, 134468.
Similarly i no digit is exceeded by the digit to its right it is called a
decreasing number; or example, 66420.
We shall call a positive integer that is neither increasing nor decreasing
a "bouncy" number; or example, 155349.
As n increases, the proportion o bouncy numbers below n increases such
that there are only 12951 numbers below one-million that are not bouncy
and only 277032 non-bouncy numbers below 10^10.
How many numbers below a googol (10^100) are not bouncy?
Answer: a9e504ee704c879bddad6d3e39532
Problem 114
===========
A row measuring seven units in length has red blocks with a minimum length
o three units placed on it, such that any two red blocks (which are
allowed to be dierent lengths) are separated by at least one black
square. There are exactly seventeen ways o doing this.

How many ways can a row measuring ity units in length be illed?
NOTE: Although the example above does not lend itsel to the possibility,

in general it is permitted to mix block sizes. For example, on a row

measuring eight units in length you could use red (3), black (1), and red
(4).
Answer: de48ca72b252a8be7e0aad762eadc8
Problem 115
===========
NOTE: This is a more diicult version o [1]Problem 114.
A row measuring n units in length has red blocks with a minimum length o
m units placed on it, such that any two red blocks (which are allowed to
be dierent lengths) are separated by at least one black square.
Let the ill-count unction, F(m, n), represent the number o ways that a
row can be illed.
For example, F(3, 29) = 673135 and F(3, 30) = 1089155.
That is, or m = 3, it can be seen that n = 30 is the smallest value or
which the ill-count unction irst exceeds one million.
In the same way, or m = 10, it can be veriied that F(10, 56) = 880711
and F(10, 57) = 1148904, so n = 57 is the least value or which the
ill-count unction irst exceeds one million.
For m = 50, ind the least value o n or which the ill-count unction
irst exceeds one million.
Visible links
1. problem=114
Answer: 00652e9102a8d3be2e561442ba989
Problem 116
===========
A row o ive black square tiles is to have a number o its tiles replaced
with coloured oblong tiles chosen rom red (length two), green (length
three), or blue (length our).
I red tiles are chosen there are exactly seven ways this can be done.




I green tiles are chosen there are three ways.

And i blue tiles are chosen there are two ways.

Assuming that colours cannot be mixed there are 7 + 3 + 2 = 12 ways o
replacing the black tiles in a row measuring ive units in length.
How many dierent ways can the black tiles in a row measuring ity units
in length be replaced i colours cannot be mixed and at least one coloured
tile must be used?
NOTE: This is related to [1]Problem 117.
Visible links
1. problem=117
Answer: c21ca0ec54e6d1646a953a48068eb4
Problem 117
===========
Using a combination o black square tiles and oblong tiles chosen rom:
red tiles measuring two units, green tiles measuring three units, and blue
tiles measuring our units, it is possible to tile a row measuring ive
units in length in exactly iteen dierent ways.








How many ways can a row measuring ity units in length be tiled?
NOTE: This is related to [1]Problem 116.
Visible links
1. problem=116
Answer: 542612809b3dd08c518b85450ce8d6
Problem 118
===========
Using all o the digits 1 through 9 and concatenating them reely to orm
decimal integers, dierent sets can be ormed. Interestingly with the set
{2,5,47,89,631}, all o the elements belonging to it are prime.
How many distinct sets containing each o the digits one through nine

exactly once contain only prime elements?

Answer: 080cc5a4ec71a747e260e274bdb13b64
Problem 119
===========
The number 512 is interesting because it is equal to the sum o its digits
raised to some power: 5 + 1 + 2 = 8, and 8^3 = 512. Another example o a
number with this property is 614656 = 28^4.
We shall deine a[n] to be the nth term o this sequence and insist that a
number must contain at least two digits to have a sum.
You are given that a[2] = 512 and a[10] = 614656.
Find a[30].
Answer: 72dda6c52a120892ade6283819da4
Problem 120
===========
Let r be the remainder when (a1)^n + (a+1)^n is divided by a^2.
For example, if a = 7 and n = 3, then r = 42: 6^3 + 8^3 = 728 42 mod 49.
And as n varies, so too will r, but for a = 7 it turns out that r[max] =
42.
For 3 a 1000, find r[max].
Answer: 0dd05ec40fe11279c2203b72e92a450a
Problem 121
===========
A bag contains one red disc and one blue disc. In a game of chance a
player takes a disc at random and its colour is noted. After each turn the
disc is returned to the bag, an extra red disc is added, and another disc
is taken at random.
The player pays
1 to play and wins if they have taken more blue discs
than red discs at the end of the game.
If the game is played for four turns, the probability of a player winning
is exactly 11/120, and so the maximum prize fund the banker should
allocate for winning in this game would be
10 before they would expect to
incur a loss. Note that any payout will be a whole number of pounds and
also includes the original
1 paid to play the game, so in the example
given the player actually wins
9.

Find the maximum prize fund that should be allocated to a single game in
which fifteen turns are played.
Answer: 51de85ddd068f0bc787691d356176df9
Problem 122
===========
The most naive way of computing n^15 requires fourteen multiplications:
n n ... n = n^15
But using a "binary" method you can compute it in six multiplications:
n n = n^2
n^2 n^2 = n^4
n^4 n^4 = n^8
n^8 n^4 = n^12
n^12 n^2 = n^14
n^14 n = n^15
However it is yet possible to compute it in only five multiplications:
n n = n^2
n^2 n = n^3
n^3 n^3 = n^6
n^6 n^6 = n^12
n^12 n^3 = n^15
We shall define m(k) to be the minimum number of multiplications to
compute n^k; for example m(15) = 5.
For 1 k 200, find m(k).
Answer: b710915795b9e9c02cf10d6d2bdb688c
Problem 123
===========
Let p[n] be the nth prime: 2, 3, 5, 7, 11, ..., and let r be the remainder
when (p[n]1)^n + (p[n]+1)^n is divided by p[n]^2.
For example, when n = 3, p[3] = 5, and 4^3 + 6^3 = 280 5 mod 25.
The least value of n for which the remainder first exceeds 10^9 is 7037.
Find the least value of n for which the remainder first exceeds 10^10.
Answer: 71497f728b86b55d965edbf1849cca8d
Problem 124
===========

The radical of n, rad(n), is the product of the distinct prime factors of

n. For example, 504 = 2^3 3^2 7, so rad(504) = 2 3 7 = 42.
If we calculate rad(n) for 1 n 10, then sort them on rad(n), and
sorting on n if the radical values are equal, we get:
Unsorted
n rad(n)
1
1
2
2
3
3
4
2
5
5
6
6
7
7
8
2
9
3
10 10

Sorted
n rad(n) k
1
1
1
2
2
2
4
2
3
8
2
4
3
3
5
9
3
6
5
5
7
6
6
8
7
7
9
10 10 10

Let E(k) be the kth element in the sorted n column; for example, E(4) = 8
and E(6) = 9.
If rad(n) is sorted for 1 n 100000, find E(10000).
Answer: f228d2e6f9099153388e9470180c8302
Problem 125
===========
The palindromic number 595 is interesting because it can be written as the
sum of consecutive squares: 6^2 + 7^2 + 8^2 + 9^2 + 10^2 + 11^2 + 12^2.
There are exactly eleven palindromes below one thousand that can be
written as consecutive square sums, and the sum of these palindromes is
4164. Note that 1 = 0^2 + 1^2 has not been included as this problem is
concerned with the squares of positive integers.
Find the sum of all the numbers less than 10^8 that are both palindromic
and can be written as the sum of consecutive squares.
Answer: 1b5635e8ab723e01570ca783129493dd
Problem 126
===========
The minimum number of cubes to cover every visible face on a cuboid
measuring 3x2x1 is twenty two.
If we then add a second layer to this solid it would require forty six
cubes to cover every visible face, the third layer would require
seventy eight cubes, and the fourth layer would require one hundred and
eighteen cubes to cover every visible face.

However, the first layer on a cuboid measuring 5x1x1 also requires

twenty two cubes; similarly the first layer on cuboids measuring
5x3x1, 7x2x1, and 11x1x1 all contain forty six cubes.
We shall define C(n) to represent the number of cuboids that contain n
cubes in one of its layers. So C(22) = 2, C(46) = 4, C(78) = 5, and C(118)
= 8.
It turns out that 154 is the least value of n for which C(n) = 10.
Find the least value of n for which C(n) = 1000.
p_126.gif
Answer: 387d6ae83cbc6fa0b9192b56bf095c49
Problem 127
===========
The radical of n, rad(n), is the product of distinct prime factors of n.
For example, 504 = 2^3 3^2 7, so rad(504) = 2 3 7 = 42.
We shall define the triplet of positive integers (a, b, c) to be an
abc hit if:
1.GCD(a, b) = GCD(a, c) = GCD(b, c) = 1
2.a < b
3.a + b = c
4.rad(abc) < c
For example, (5, 27, 32) is an abc hit, because:
1.GCD(5, 27) = GCD(5, 32) = GCD(27, 32) = 1
2.5 < 27
3.5 + 27 = 32
4.rad(4320) = 30 < 32
It turns out that abc hits are quite rare and there are only thirty one
abc hits for c < 1000, with c = 12523.
Find c for c < 120000.
Answer: c6b1ae935b33c90a2c320b5f6ef3e4ba
Problem 128
===========
A hexagonal tile with number 1 is surrounded by a ring of six hexagonal
tiles, starting at "12 o'clock" and numbering the tiles 2 to 7 in an
anti clockwise direction.
New rings are added in the same fashion, with the next rings being
numbered 8 to 19, 20 to 37, 38 to 61, and so on. The diagram below shows
the first three rings.

By finding the difference between tile n and each its six neighbours we
shall define PD(n) to be the number of those differences which are prime.
For example, working clockwise around tile 8 the differences are 12, 29,
11, 6, 1, and 13. So PD(8) = 3.
In the same way, the differences around tile 17 are 1, 17, 16, 1, 11, and
10, hence PD(17) = 2.
It can be shown that the maximum value of PD(n) is 3.
If all of the tiles for which PD(n) = 3 are listed in ascending order to
form a sequence, the 10th tile would be 271.
Find the 2000th tile in this sequence.
p_128.gif
Answer: 93a1925da4792b4fa5d2dbb6ebb7c4a2
Problem 129
===========
A number consisting entirely of ones is called a repunit. We shall define
R(k) to be a repunit of length k; for example, R(6) = 111111.
Given that n is a positive integer and GCD(n, 10) = 1, it can be shown
that there always exists a value, k, for which R(k) is divisible by n, and
let A(n) be the least such value of k; for example, A(7) = 6 and A(41) =
5.
The least value of n for which A(n) first exceeds ten is 17.
Find the least value of n for which A(n) first exceeds one million.
Answer: 82cd979a2b79600137aea54fa0bd944b
Problem 130
===========
A number consisting entirely of ones is called a repunit. We shall define
R(k) to be a repunit of length k; for example, R(6) = 111111.
Given that n is a positive integer and GCD(n, 10) = 1, it can be shown
that there always exists a value, k, for which R(k) is divisible by n, and
let A(n) be the least such value of k; for example, A(7) = 6 and A(41) =
5.
You are given that for all primes, p > 5, that p 1 is divisible by A(p).
For example, when p = 41, A(41) = 5, and 40 is divisible by 5.
However, there are rare composite values for which this is also true; the
first five examples being 91, 259, 451, 481, and 703.

Find the sum of the first twenty five composite values of n for which
GCD(n, 10) = 1 and n 1 is divisible by A(n).
Answer: 20594ea0ef7a2f4cf40d19a9b82a0beb
Problem 131
===========
There are some prime values, p, for which there exists a positive integer,
n, such that the expression n^3 + n^2p is a perfect cube.
For example, when p = 19, 8^3 + 8^219 = 12^3.
What is perhaps most surprising is that for each prime with this property
the value of n is unique, and there are only four such primes below
one hundred.
How many primes below one million have this remarkable property?
Answer: f7e6c85504ce6e82442c770f7c8606f0
Problem 132
===========
A number consisting entirely of ones is called a repunit. We shall define
R(k) to be a repunit of length k.
For example, R(10) = 1111111111 = 11412719091, and the sum of these
prime factors is 9414.
Find the sum of the first forty prime factors of R(10^9).
Answer: 5df3a36faa173a393a04a022b2d5d49d
Problem 133
===========
A number consisting entirely of ones is called a repunit. We shall define
R(k) to be a repunit of length k; for example, R(6) = 111111.
Let us consider repunits of the form R(10^n).
Although R(10), R(100), or R(1000) are not divisible by 17, R(10000) is
divisible by 17. Yet there is no value of n for which R(10^n) will divide
by 19. In fact, it is remarkable that 11, 17, 41, and 73 are the only four
primes below one hundred that can be a factor of R(10^n).
Find the sum of all the primes below one hundred thousand that will never
be a factor of R(10^n).

Answer: c1d33d79d08cde65eaa78e4583ea0594
Problem 134
===========
Consider the consecutive primes p[1] = 19 and p[2] = 23. It can be
verified that 1219 is the smallest number such that the last digits are
formed by p[1] whilst also being divisible by p[2].
In fact, with the exception of p[1] = 3 and p[2] = 5, for every pair of
consecutive primes, p[2] > p[1], there exist values of n for which the
last digits are formed by p[1] and n is divisible by p[2]. Let S be the
smallest of these values of n.
Find S for every pair of consecutive primes with 5 p[1] 1000000.
Answer: f12b07460d2586ea47b4d305ae0b0539
Problem 135
===========
Given the positive integers, x, y, and z, are consecutive terms of an
arithmetic progression, the least value of the positive integer, n, for
which the equation, x^2 y^2 z^2 = n, has exactly two solutions is n =
27:
34^2 27^2 20^2 = 12^2 9^2 6^2 = 27
It turns out that n = 1155 is the least value which has exactly ten
solutions.
How many values of n less than one million have exactly ten distinct
solutions?
Answer: c457d7ae48d08a6b84bc0b1b9bd7d474
Problem 136
===========
The positive integers, x, y, and z, are consecutive terms of an arithmetic
progression. Given that n is a positive integer, the equation, x^2 y^2
z^2 = n, has exactly one solution when n = 20:
13^2 10^2 7^2 = 20
In fact there are twenty five values of n below one hundred for which the
equation has a unique solution.
How many values of n less than fifty million have exactly one solution?
Answer: 91db9e8e6cb2dbf9c07a6e0429697336

Problem 137
===========
Consider the infinite polynomial series A[F](x) = xF[1] + x^2F[2] +
x^3F[3] + ..., where F[k] is the kth term in the Fibonacci sequence: 1, 1,
2, 3, 5, 8, ... ; that is, F[k] = F[k1] + F[k2], F[1] = 1 and F[2] = 1.
For this problem we shall be interested in values of x for which A[F](x)
is a positive integer.
Surprisingly A[F](1/2) = (1/2).1 + (1/2)^2.1 + (1/2)^3.2 + (1/2)^4.3 +
(1/2)^5.5 + ...

= 1/2 + 1/4 + 2/8 + 3/16 + 5/32 + ...

= 2
The corresponding values of x for the first five natural numbers are shown
below.

x
A[F](x)

21
1

1/2
2

(132)/33

(895)/84

(343)/55

We shall call A[F](x) a golden nugget i x is rational, because they

become increasingly rarer; or example, the 10th golden nugget is
74049690.
Find the 15th golden nugget.
Answer: 44845aa047ec925a3b43e6460a55e27
Problem 138
===========
Consider the isosceles triangle with base length, b = 16, and legs, L =
17.
By using the Pythagorean theorem it can be seen that the height o the
triangle, h = (17^2 8^2) = 15, which is one less than the base length.
With b = 272 and L = 305, we get h = 273, which is one more than the base
length, and this is the second smallest isosceles triangle with the
property that h = b  1.
Find L for the twelve smallest isosceles triangles for which h = b  1

and b, L are positive integers.

p_138.gif
Answer: f7524f4d0d6d042c0f92a0d6469aff85
Problem 139
===========
Let (a, b, c) represent the three sides of a right angle triangle with
integral length sides. It is possible to place four such triangles
together to form a square with length c.
For example, (3, 4, 5) triangles can be placed together to form a 5 by 5
square with a 1 by 1 hole in the middle and it can be seen that the 5 by 5
square can be tiled with twenty five 1 by 1 squares.
However, if (5, 12, 13) triangles were used then the hole would measure 7
by 7 and these could not be used to tile the 13 by 13 square.
Given that the perimeter of the right triangle is less than one hundred
million, how many Pythagorean triangles would allow such a tiling to take
place?
p_139.gif
Answer: 1c343ba00e6d17d7239bf45869ffed0c
Problem 140
===========
Consider the infinite polynomial series A[G](x) = xG[1] + x^2G[2] +
x^3G[3] + ..., where G[k] is the kth term of the second order recurrence
relation G[k] = G[k1] + G[k2], G[1] = 1 and G[2] = 4; that is, 1, 4, 5,
9, 14, 23, ... .
For this problem we shall be concerned with values of x for which A[G](x)
is a positive integer.
The corresponding values of x for the first five natural numbers are shown
below.

x
A[G](x)

(51)/4 1

2/5
2

(222)/6 3

(1375)/144

1/2
5

We shall call A[G](x) a golden nugget i x is rational, because they

become increasingly rarer; or example, the 20th golden nugget is
211345365.
Find the sum o the irst thirty golden nuggets.
Answer: e5d7596929ba250b2732aad523028c
Problem 141
===========
A positive integer, n, is divided by d and the quotient and remainder are
q and r respectively. In addition d, q, and r are consecutive positive
integer terms in a geometric sequence, but not necessarily in that order.
For example, 58 divided by 6 has quotient 9 and remainder 4. It can also
be seen that 4, 6, 9 are consecutive terms in a geometric sequence (common
ratio 3/2).
We will call such numbers, n, progressive.
Some progressive numbers, such as 9 and 10404 = 102^2, happen to also be
perect squares.
The sum o all progressive perect squares below one hundred thousand is
124657.
Find the sum o all progressive perect squares below one trillion
(10^12).
Answer: 2aaea1db80951be1401839e8c0194e
Problem 142
===========
Find the smallest x + y + z with integers x > y > z > 0 such that x + y, x
y, x + z, x z, y + z, y z are all perfect squares.
Answer: d3de282705508407532aa20ca8928e3b
Problem 143
===========
Let ABC be a triangle with all interior angles being less than 120
degrees. Let X be any point inside the triangle and let XA = p, XC = q,
and XB = r.
Fermat challenged Torricelli to find the position of X such that p + q + r
was minimised.
Torricelli was able to prove that if equilateral triangles AOB, BNC and
AMC are constructed on each side of triangle ABC, the circumscribed
circles of AOB, BNC, and AMC will intersect at a single point, T, inside

the triangle. Moreover he proved that T, called the Torricelli/Fermat

point, minimises p + q + r. Even more remarkable, it can be shown that
when the sum is minimised, AN = BM = CO = p + q + r and that AN, BM and CO
also intersect at T.
If the sum is minimised and a, b, c, p, q and r are all positive integers
we shall call triangle ABC a Torricelli triangle. For example, a = 399, b
= 455, c = 511 is an example of a Torricelli triangle, with p + q + r =
784.
Find the sum of all distinct values of p + q + r 120000 for Torricelli
triangles.
p_143_torricelli.gif
Answer: ec2d4c1a0c204d1f06ea5e2d189034f6
Problem 144
===========
In laser physics, a "white cell" is a mirror system that acts as a delay
line for the laser beam. The beam enters the cell, bounces around on the
mirrors, and eventually works its way back out.
The specific white cell we will be considering is an ellipse with the
equation 4x^2 + y^2 = 100
The section corresponding to 0.01 x +0.01 at the top is missing,
allowing the light to enter and exit through the hole.
The light beam in this problem starts at the point (0.0,10.1) just outside
the white cell, and the beam first impacts the mirror at (1.4, 9.6).
Each time the laser beam hits the surface of the ellipse, it follows the
usual law of reflection "angle of incidence equals angle of reflection."
That is, both the incident and reflected beams make the same angle with
the normal line at the point of incidence.
In the figure on the left, the red line shows the first two points of
contact between the laser beam and the wall of the white cell; the blue
line shows the line tangent to the ellipse at the point of incidence of
the first bounce.
The slope m of the tangent line at any point (x,y) of the given ellipse
is: m = 4x/y
The normal line is perpendicular to this tangent line at the point of
incidence.
The animation on the right shows the first 10 reflections of the beam.
How many times does the beam hit the internal surface of the white cell
before exiting?
p_144_1.gif
p_144_2.gif
Answer: 8dd48d6a2e2cad213179a3992c0be53c

Problem 145
===========
Some positive integers n have the property that the sum [ n + reverse(n) ]
consists entirely of odd (decimal) digits. For instance, 36 + 63 = 99 and
409 + 904 = 1313. We will call such numbers reversible; so 36, 63, 409,
and 904 are reversible. Leading zeroes are not allowed in either n or
reverse(n).
There are 120 reversible numbers below one thousand.
How many reversible numbers are there below one billion (10^9)?
Answer: 705e8444ad9c92e9a7589fb97515a9b6
Problem 146
===========
The smallest positive integer n for which the numbers n^2+1, n^2+3, n^2+7,
n^2+9, n^2+13, and n^2+27 are consecutive primes is 10. The sum of all
such integers n below one million is 1242490.
What is the sum of all such integers n below 150 million?
Answer: 525bd2bf0e31b0f19b38a1d21f2f6a16
Problem 147
===========
In a 3x2 cross hatched grid, a total of 37 different rectangles could be
situated within that grid as indicated in the sketch.
There are 5 grids smaller than 3x2, vertical and horizontal dimensions
being important, i.e. 1x1, 2x1, 3x1, 1x2 and 2x2. If each of them is
cross hatched, the following number of different rectangles could be
situated within those smaller grids:
1x1:
2x1:
3x1:
1x2:
2x2:

1
4
8
4
18

Adding those to the 37 of the 3x2 grid, a total of 72 different rectangles

could be situated within 3x2 and smaller grids.
How many different rectangles could be situated within 47x43 and smaller
grids?
p_147.gif

Answer: d0fca7d85d4a4df043a2ae5772ea472e
Problem 148
===========
We can easily verify that none of the entries in the first seven rows of
Pascal's triangle are divisible by 7:

15

10

20

10

15

1
1
5 1
6 1

However, if we check the first one hundred rows, we will find that only
2361 of the 5050 entries are not divisible by 7.
Find the number of entries which are not divisible by 7 in the first one
billion (10^9) rows of Pascal's triangle.
Answer: 8a631ab4e3d06baf88299bf4e501b837
Problem 149
===========
Looking at the table below, it is easy to verify that the maximum possible
sum of adjacent numbers in any direction (horizontal, vertical, diagonal
or anti diagonal) is 16 (= 8 + 7 + 1).

2 5 3 2

9 6 5 1

3 2 7 3

1 8 4 8

Now, let us repeat the search, but on a much larger scale:

First, generate our million pseudo-random numbers using a speciic orm
o what is known as a "Lagged Fibonacci Generator":
For 1 k 55, s[k] = [100003 200003k + 300007k^3] (modulo 1000000)
500000.
For 56 k 4000000, s[k] = [s[k24] + s[k55] + 1000000] (modulo
1000000) 500000.
Thus, s[10] = 393027 and s[100] = 86613.
The terms of s are then arranged in a 20002000 table, using the first
2000 numbers to fill the first row (sequentially), the next 2000 numbers

to fill the second row, and so on.

Finally, find the greatest sum of (any number of) adjacent entries in any
direction (horizontal, vertical, diagonal or anti diagonal).
Answer: 96affc386f4b786c2521a32944424982
Problem 150
===========
In a triangular array of positive and negative integers, we wish to find a
sub triangle such that the sum of the numbers it contains is the smallest
possible.
In the example below, it can be easily verified that the marked triangle
satisfies this condition having a sum of 42.
We wish to make such a triangular array with one thousand rows, so we
generate 500500 pseudo random numbers s[k] in the range 2^19, using a
type of random number generator (known as a Linear Congruential Generator)
as follows:
t := 0
for k = 1 up to k = 500500:
t := (615949*t + 797807) modulo 2^20
s[k] := t2^19
Thus: s[1] = 273519, s[2] = 153582, s[3] = 450905 etc
Our triangular array is then formed using the pseudo random numbers thus:
s[1]
s[2] s[3]
s[4] s[5] s[6]
s[7] s[8] s[9] s[10]
...
Sub triangles can start at any element of the array and extend down as far
as we like (taking in the two elements directly below it from the next
row, the three elements directly below from the row after that, and so
on).
The "sum of a sub triangle" is defined as the sum of all the elements it
contains.
Find the smallest possible sub triangle sum.
p_150.gif
Answer: 1802939e514020769701c59b422c0498
Problem 151
===========
A printing shop runs 16 batches (jobs) every week and each batch requires
a sheet of special colour proofing paper of size A5.

Every Monday morning, the foreman opens a new envelope, containing a large
sheet of the special paper with size A1.
He proceeds to cut it in half, thus getting two sheets of size A2. Then he
cuts one of them in half to get two sheets of size A3 and so on until he
obtains the A5 size sheet needed for the first batch of the week.
All the unused sheets are placed back in the envelope.
At the beginning of each subsequent batch, he takes from the envelope one
sheet of paper at random. If it is of size A5, he uses it. If it is
larger, he repeats the 'cut in half' procedure until he has what he needs
and any remaining sheets are always placed back in the envelope.
Excluding the first and last batch of the week, find the expected number
of times (during each week) that the foreman finds a single sheet of paper
in the envelope.
Give your answer rounded to six decimal places using the format x.xxxxxx.
p_151.gif
Answer: fb84a530fa9a8199edfadd618727fb70
Problem 152
===========
There are several ways to write the number 1/2 as a sum of inverse squares
using distinct integers.
For instance, the numbers {2,3,4,5,7,12,15,20,28,35} can be used:
In fact, only using integers between 2 and 45 inclusive, there are exactly
three ways to do it, the remaining two being:
{2,3,4,6,7,9,10,20,28,35,36,45} and {2,3,4,6,7,9,12,15,28,30,35,36,45}.
How many ways are there to write the number 1/2 as a sum of inverse
squares using distinct integers between 2 and 80 inclusive?
p_152_sum.gif
Answer: 34ed066df378efacc9b924ec161e7639
Problem 153
===========
As we all know the equation x^2= 1 has no solutions for real x.
If we however introduce the imaginary number i this equation has two
solutions: x=i and x= i.
If we go a step further the equation (x 3)^2= 4 has two complex solutions:
x=3+2i and x=3 2i.
x=3+2i and x=3 2i are called each others' complex conjugate.
Numbers of the form a+bi are called complex numbers.
In general a+bi and abi are each other's complex conjugate.
A Gaussian Integer is a complex number a+bi such that both a and b are

integers.
The regular integers are also Gaussian integers (with b=0).
To distinguish them from Gaussian integers with b 0 we call such
integers "rational integers."
A Gaussian integer is called a divisor of a rational integer n if the
result is also a Gaussian integer.
If for example we divide 5 by 1+2i we can simplify in the following
manner:
Multiply numerator and denominator by the complex conjugate of 1+2i: 12i.
The result is .
So 1+2i is a divisor of 5.
Note that 1+i is not a divisor of 5 because .
Note also that if the Gaussian Integer (a+bi) is a divisor of a rational
integer n, then its complex conjugate (abi) is also a divisor of n.
In fact, 5 has six divisors such that the real part is positive: {1, 1 +
2i, 1 2i, 2 + i, 2 i, 5}.
The following is a table of all of the divisors for the first five
positive rational integers:

n Gaussian integer divisors

Sum s(n) o

with positive real part

thesedivisors

1 1
1

2 1, 1+i, 1-i, 2
5

3 1, 3
4

4 1, 1+i, 1-i, 2, 2+2i, 2-2i,4 13

5 1, 1+2i, 1-2i, 2+i, 2-i, 5 12

For divisors with positive real parts, then, we have: .

For 1 n 10^5, s(n)=17924657155.
What is s(n) or 1 n 10^8?
p_153_ormule1.gi
p_153_ormule2.gi
p_153_ormule5.gi
p_153_ormule6.gi
Answer: 08ec9d6e6c2275d37e7a227b2d106
Problem 154
===========
A triangular pyramid is constructed using spherical balls so that each
ball rests on exactly three balls o the next lower level.
Then, we calculate the number o paths leading rom the apex to each
position:
A path starts at the apex and progresses downwards to any o the three

spheres directly below the current position.

Consequently, the number o paths to reach a certain position is the sum
o the numbers immediately above it (depending on the position, there are
up to three numbers above it).
The result is Pascal's pyramid and the numbers at each level n are the
coeicients o the trinomial expansion (x + y + z)^n.
How many coeicients in the expansion o (x + y + z)^200000 are multiples
o 10^12?
p_154_pyramid.gi
Answer: de866633a075beb3897cbbc8ab2400
Problem 155
===========
An electric circuit uses exclusively identical capacitors o the same
value C.
The capacitors can be connected in series or in parallel to orm
sub-units, which can then be connected in series or in parallel with other
capacitors or other sub-units to orm larger sub-units, and so on up to a
inal circuit.
Using this simple procedure and up to n identical capacitors, we can make
circuits having a range o dierent total capacitances. For example,
using up to n=3 capacitors o 60 F each, we can obtain the ollowing 7
distinct total capacitance values:
I we denote by D(n) the number o distinct total capacitance values we
can obtain when using up to n equal-valued capacitors and the simple
procedure described above, we have: D(1)=1, D(2)=3, D(3)=7 ...
Find D(18).
Reminder : When connecting capacitors C[1], C[2] etc in parallel, the
total capacitance is C[T]=C[1]+C[2]+...,
whereas when connecting them in series, the overall capacitance is given
by:
p_155_capsmu.gi
p_155_capacitors1.gi
p_155_capsorm.gi
Answer: da0a3c900cc8ae42d514e280524ee39
Problem 156
===========
Starting rom zero the natural numbers are written down in base 10 like
this:
0 1 2 3 4 5 6 7 8 9 10 11 12....
Consider the digit d=1. Ater we write down each number n, we will update

the number o ones that have occurred and call this number (n,1). The
irst values or (n,1), then, are as ollows:
n
0
1
2
3
4
5
6
7
8
9
10
11
12

(n,1)
0
1
1
1
1
1
1
1
1
1
2
4
5

Note that (n,1) never equals 3.

So the irst two solutions o the equation (n,1)=n are n=0 and n=1. The
next solution is n=199981.
In the same manner the unction (n,d) gives the total number o digits d
that have been written down ater the number n has been written.
In act, or every digit d 0, 0 is the irst solution o the equation
(n,d)=n.
Let s(d) be the sum o all the solutions or which (n,d)=n.
You are given that s(1)=22786974071.
Find s(d) or 1 d 9.
Note: i, or some n, (n,d)=n or more than one value o d this value o
n is counted again or every value o d or which (n,d)=n.
Answer: ac0c6b67ed28cebb02b802e7a204aaee
Problem 157
===========
Consider the diophantine equation ^1/[a]+^1/[b]= ^p/[10^n] with a, b, p, n
positive integers and a b.
For n=1 this equation has 20 solutions that are listed below:
1/1+1/1=20/10
1/2+1/5=7/10
1/4+1/20=3/10
1/11+1/110=1/10

1/1+1/2=15/10
1/2+1/10=6/10
1/5+1/5=4/10
1/12+1/60=1/10

1/1+1/5=12/10
1/3+1/6=5/10
1/5+1/10=3/10
1/14+1/35=1/10

1/1+1/10=11/10
1/3+1/15=4/10
1/6+1/30=2/10
1/15+1/30=1/10

How many solutions has this equation or 1 n 9?

Answer: c96c71d4e86420da7958957538c
Problem 158
===========

1/2+1/2=10/10
1/4+1/4=5/10
1/10+1/10=2/10
1/20+1/20=1/10

Taking three dierent letters rom the 26 letters o the alphabet,

character strings o length three can be ormed.
Examples are 'abc', 'hat' and 'zyx'.
When we study these three examples we see that or 'abc' two characters
come lexicographically ater its neighbour to the let.
For 'hat' there is exactly one character that comes lexicographically
ater its neighbour to the let. For 'zyx' there are zero characters that
come lexicographically ater its neighbour to the let.
In all there are 10400 strings o length 3 or which exactly one character
comes lexicographically ater its neighbour to the let.
We now consider strings o n 26 dierent characters rom the alphabet.
For every n, p(n) is the number o strings o length n or which exactly
one character comes lexicographically ater its neighbour to the let.
What is the maximum value o p(n)?
Answer: 6070a194890e52b2989a5b542aee90
Problem 159
===========
A composite number can be actored many dierent ways. For instance, not
including multiplication by one, 24 can be actored in 7 distinct ways:
24
24
24
24
24
24
24

=
=
=
=
=
=
=

2x2x2x3
2x3x4
2x2x6
4x6
3x8
2x12
24

Recall that the digital root o a number, in base 10, is ound by adding
together the digits o that number, and repeating that process until a
number is arrived at that is less than 10. Thus the digital root o 467 is
8.
We shall call a Digital Root Sum (DRS) the sum o the digital roots o the
individual actors o our number.
The chart below demonstrates all o the DRS values or 24.

FactorisationDigital Root Sum

2x2x2x3

2x3x4

2x2x6

10

4x6

10

3x8

11

2x12

24

The maximum Digital Root Sum o 24 is 11.

The unction mdrs(n) gives the maximum Digital Root Sum o n. So
mdrs(24)=11.
Find mdrs(n) or 1 < n < 1,000,000.
Answer: 2ab79d40adc1028d1a83a6333db907
Problem 160
===========
For any N, let (N) be the last ive digits beore the trailing zeroes in
N!.
For example,
9! = 362880 so (9)=36288
10! = 3628800 so (10)=36288
20! = 2432902008176640000 so (20)=17664
Find (1,000,000,000,000)
Answer: e51ada1e23810eb1b51a18bb682585
Problem 161
===========
A triomino is a shape consisting o three squares joined via the
edges.There are two basic orms:
I all possible orientations are taken into account there are six:
Any n by m grid or which nxm is divisible by 3 can be tiled with
triominoes.
I we consider tilings that can be obtained by relection or rotation rom
another tiling as dierent there are 41 ways a 2 by 9 grid can be tiled
with triominoes:
In how many ways can a 9 by 12 grid be tiled in this way by triominoes?
p_161_trio1.gi
p_161_trio3.gi
p_161_k9.gi
Answer: 975ccc38bb5402c5b4853de5928d919
Problem 162
===========

In the hexadecimal number system numbers are represented using 16

dierent digits:
0,1,2,3,4,5,6,7,8,9,A,B,C,D,E,F
The hexadecimal number AF when written in the decimal number system equals
10x16+15=175.
In the 3-digit hexadecimal numbers 10A, 1A0, A10, and A01 the digits 0,1
and A are all present.
Like numbers written in base ten we write hexadecimal numbers without
leading zeroes.
How many hexadecimal numbers containing at most sixteen hexadecimal digits
exist with all o the digits 0,1, and A present at least once?
Give your answer as a hexadecimal number.
(A,B,C,D,E and F in upper case, without any leading or trailing code that
marks the number as hexadecimal and without leading zeroes , e.g. 1A3F and
not: 1a3 and not 0x1a3 and not $1A3F and not #1A3F and not 0000001A3F)
Answer: 049419b9dad9a74d588862656a3
Problem 163
===========
Consider an equilateral triangle in which straight lines are drawn rom
each vertex to the middle o the opposite side, such as in the size 1
triangle in the sketch below.
Sixteen triangles o either dierent shape or size or orientation or
location can now be observed in that triangle. Using size 1 triangles as
building blocks, larger triangles can be ormed, such as the size 2
triangle in the above sketch. One-hundred and our triangles o either
dierent shape or size or orientation or location can now be observed in
that size 2 triangle.
It can be observed that the size 2 triangle contains 4 size 1 triangle
building blocks. A size 3 triangle would contain 9 size 1 triangle
building blocks and a size n triangle would thus contain n^2 size 1
triangle building blocks.
I we denote T(n) as the number o triangles present in a triangle o size
n, then
T(1) = 16
T(2) = 104
Find T(36).
p_163.gi
Answer: a466a42a5b5dc395d00463d77e0a0c6
Problem 164
===========

How many 20 digit numbers n (without any leading zero) exist such that no
three consecutive digits o n have a sum greater than 9?
Answer: 6e96deb3be7cc132401bae5a5d6d6
Problem 165
===========
A segment is uniquely deined by its two endpoints.
By considering two line segments in plane geometry there are three
possibilities:
the segments have zero points, one point, or ininitely many points in
common.
Moreover when two segments have exactly one point in common it might be
the case that that common point is an endpoint o either one o the
segments or o both. I a common point o two segments is not an endpoint
o either o the segments it is an interior point o both segments.
We will call a common point T o two segments L[1] and L[2] a true
intersection point o L[1] and L[2] i T is the only common point o L[1]
and L[2] and T is an interior point o both segments.
Consider the three segments L[1], L[2], and L[3]:
L[1]: (27, 44) to (12, 32)
L[2]: (46, 53) to (17, 62)
L[3]: (46, 70) to (22, 40)
It can be veriied that line segments L[2] and L[3] have a true
intersection point. We note that as the one o the end points o L[3]:
(22,40) lies on L[1] this is not considered to be a true point o
intersection. L[1] and L[2] have no common point. So among the three line
segments, we ind one true intersection point.
Now let us do the same or 5000 line segments. To this end, we generate
20000 numbers using the so-called "Blum Blum Shub" pseudo-random number
generator.
s[0] = 290797
s[n+1] = s[n]s[n] (modulo 50515093)
t[n] = s[n] (modulo 500)
To create each line segment, we use our consecutive numbers t[n]. That
is, the irst line segment is given by:
(t[1], t[2]) to (t[3], t[4])
The irst our numbers computed according to the above generator should
be: 27, 144, 12 and 232. The irst segment would thus be (27,144) to
(12,232).
How many distinct true intersection points are ound among the 5000 line
segments?

Answer: b87b096a5a545b47a45ced4e67c87
Problem 166
===========
A 4x4 grid is illed with digits d, 0 d 9.
It can be seen that in the grid
6
5
0
1

3
0
7
2

3
4
1
4

0
3
4
5

the sum o each row and each column has the value 12. Moreover the sum o
each diagonal is also 12.
In how many ways can you ill a 4x4 grid with the digits d, 0 d 9 so
that each row, each column, and both diagonals have the same sum?
Answer: e43961ee71be433a177c075512
Problem 167
===========
For two positive integers a and b, the Ulam sequence U(a,b) is deined by
U(a,b)[1] = a, U(a,b)[2] = b and or k > 2,U(a,b)[k] is the smallest
integer greater than U(a,b)[(k-1)] which can be written in exactly one way
as the sum o two distinct previous members o U(a,b).
For example, the sequence U(1,2) begins with
1, 2, 3 = 1 + 2, 4 = 1 + 3, 6 = 2 + 4, 8 = 2 + 6, 11 = 3 + 8;
5 does not belong to it because 5 = 1 + 4 = 2 + 3 has two representations
as the sum o two previous members, likewise 7 = 1 + 6 = 3 + 4.
Find U(2,2n+1)[k] or 2 n 10, where k = 10^11.
Answer: aa5b6164d96cbaeb5944b8cd64a3
Problem 168
===========
Consider the number 142857. We can right-rotate this number by moving the
last digit (7) to the ront o it, giving us 714285.
It can be veriied that 714285=5142857.
This demonstrates an unusual property o 142857: it is a divisor o its
right-rotation.
Find the last 5 digits o the sum o all integers n, 10 < n < 10^100, that
have this property.

Answer: 39e7aab76650b018578830bc6dba007a
Problem 169
===========
Deine (0)=1 and (n) to be the number o dierent ways n can be
expressed as a sum o integer powers o 2 using each power no more than
twice.
For example, (10)=5 since there are ive dierent ways to express 10:
1
1
1
2
2

+
+
+
+
+

1
1
1
4
8

+
+
+
+

8
4 + 4
2 + 2 + 4
4

What is (10^25)?
Answer: d149d4836703a8908becea56ddd3ed42
Problem 170
===========
Take the number 6 and multiply it by each o 1273 and 9854:
6 1273 = 7638
6 9854 = 59124
By concatenating these products we get the 1 to 9 pandigital 763859124. We
will call 763859124 the "concatenated product o 6 and (1273,9854)".
Notice too, that the concatenation o the input numbers, 612739854, is
also 1 to 9 pandigital.
The same can be done or 0 to 9 pandigital numbers.
What is the largest 0 to 9 pandigital 10-digit concatenated product o an
integer with two or more other integers, such that the concatenation o
the input numbers is also a 0 to 9 pandigital 10-digit number?
Answer: 6e65352717c1731666a107ace96c1
Problem 171
===========
For a positive integer n, let (n) be the sum o the squares o the digits
(in base 10) o n, e.g.

(3) = 3^2 = 9,
(25) = 2^2 + 5^2 = 4 + 25 = 29,

(442) = 4^2 + 4^2 + 2^2 = 16 + 16 + 4 = 36

Find the last nine digits o the sum o all n, 0 < n < 10^20, such that
(n) is a perect square.
Answer: 586db8c4a5699ec78c645cb27db7b
Problem 172
===========
How many 18-digit numbers n (without leading zeros) are there such that no
digit occurs more than three times in n?
Answer: 5260ee21ead7478403c2ccd18a1829
Problem 173
===========
We shall deine a square lamina to be a square outline with a square
"hole" so that the shape possesses vertical and horizontal symmetry. For
example, using exactly thirty-two square tiles we can orm two dierent
square laminae:
With one-hundred tiles, and not necessarily using all o the tiles at one
time, it is possible to orm orty-one dierent square laminae.
Using up to one million tiles how many dierent square laminae can be
ormed?
p_173_square_laminas.gi
Answer: 177825c89a68aeae37b8dec9bb8a9b
Problem 174
===========
We shall deine a square lamina to be a square outline with a square
"hole" so that the shape possesses vertical and horizontal symmetry.
Given eight tiles it is possible to orm a lamina in only one way: 3x3
square with a 1x1 hole in the middle. However, using thirty-two tiles it
is possible to orm two distinct laminae.
I t represents the number o tiles used, we shall say that t = 8 is type
L(1) and t = 32 is type L(2).
Let N(n) be the number o t 1000000 such that t is type L(n); or
example, N(15) = 832.
What is N(n) or 1 n 10?

p_173_square_laminas.gi
Answer: 73166006522ed751ed3e2ca66353b66
Problem 175
===========
Deine (0)=1 and (n) to be the number o ways to write n as a sum o
powers o 2 where no power occurs more than twice.
For example, (10)=5 since there are ive dierent ways to express 10:
10 = 8+2 = 8+1+1 = 4+4+2 = 4+2+2+1+1 = 4+4+1+1
It can be shown that or every raction p/q (p>0, q>0) there exists at
least one integer n such that
(n)/(n-1)=p/q.
For instance, the smallest n or which (n)/(n-1)=13/17 is 241.
The binary expansion o 241 is 11110001.
Reading this binary number rom the most signiicant bit to the least
signiicant bit there are 4 one's, 3 zeroes and 1 one. We shall call the
string 4,3,1 the Shortened Binary Expansion o 241.
Find the Shortened Binary Expansion o the smallest n or which
(n)/(n-1)=123456789/987654321.
Give your answer as comma separated integers, without any whitespaces.
Answer: 796dddd004c34652290580725b4583e
Problem 176
===========
The our right-angled triangles with sides (9,12,15), (12,16,20),
(5,12,13) and (12,35,37) all have one o the shorter sides (catheti) equal
to 12. It can be shown that no other integer sided right-angled triangle
exists with one o the catheti equal to 12.
Find the smallest integer that can be the length o a cathetus o exactly
47547 dierent integer sided right-angled triangles.
Answer: c47c782eba8cdbb60eeba86cd0003c
Problem 177
===========
Let ABCD be a convex quadrilateral, with diagonals AC and BD. At each
vertex the diagonal makes an angle with each o the two sides, creating
eight corner angles.
For example, at vertex A, the two angles are CAD, CAB.
We call such a quadrilateral or which all eight corner angles have
integer values when measured in degrees an "integer angled quadrilateral".
An example o an integer angled quadrilateral is a square, where all eight

corner angles are 45. Another example is given by DAC = 20, BAC = 60,
ABD = 50, CBD = 30, BCA = 40, DCA = 30, CDB = 80, ADB = 50.
What is the total number o non-similar integer angled quadrilaterals?
Note: In your calculations you may assume that a calculated angle is
integral i it is within a tolerance o 10^-9 o an integer value.
p_177_quad.gi
Answer: d7a85236a930db07e842de8ee7ac2
Problem 178
===========
Consider the number 45656.
It can be seen that each pair o consecutive digits o 45656 has a
dierence o one.
A number or which every pair o consecutive digits has a dierence o
one is called a step number.
A pandigital number contains every decimal digit rom 0 to 9 at least
once.
How many pandigital step numbers less than 10^40 are there?
Answer: 2dda898a5d6321aebea84d433
Problem 179
===========
Find the number o integers 1 < n < 10^7, or which n and n + 1 have the
same number o positive divisors. For example, 14 has the positive
divisors 1, 2, 7, 14 while 15 has 1, 3, 5, 15.
Answer: baa0132bc7c422a8d53bebb9d003c9
Problem 180
===========
For any integer n, consider the three unctions

[1,n](x,y,z) = x^n+1 + y^n+1 z^n+1

f[2,n](x,y,z) = (xy + yz + zx)*(x^n 1 + y^n 1 z^n 1)
f[3,n](x,y,z) = xyz*(x^n 2 + y^n 2 z^n 2)
and their combination
f[n](x,y,z) = f[1,n](x,y,z) + f[2,n](x,y,z) f[3,n](x,y,z)
We call (x,y,z) a golden triple of order k if x, y, and z are all rational
numbers of the form a / b with
0 < a < b k and there is (at least) one integer n, so that f[n](x,y,z) =
0.
Let s(x,y,z) = x + y + z.

Let t = u / v be the sum of all distinct s(x,y,z) for all golden triples
(x,y,z) of order 35.
All the s(x,y,z) and t must be in reduced form.
Find u + v.
Answer: 6459f69d151314c59df404868f45fa96
Problem 181
===========
Having three black objects B and one white object W they can be grouped in
7 ways like this:
(BBBW) (B,BBW) (B,B,BW) (B,B,B,W) (B,BB,W) (BBB,W) (BB,BW)
In how many ways can sixty black objects B and forty white objects W be
thus grouped?
Answer: 0e1233ecbc058dabf54a8602eac55d95
Problem 182
===========
The RSA encryption is based on the following procedure:
Generate two distinct primes p and q.
Compute n=pq and =(p-1)(q-1).
Find an integer e, 1<e<, such that gcd(e,)=1.
A message in this system is a number in the interval [0,n-1].
A text to be encrypted is then somehow converted to messages (numbers in
the interval [0,n-1]).
To encrypt the text, or each message, m, c=m^e mod n is calculated.
To decrypt the text, the ollowing procedure is needed: calculate d such
that ed=1 mod , then or each encrypted message, c, calculate m=c^d mod
n.
There exist values o e and m such that m^e mod n=m.
We call messages m or which m^e mod n=m unconcealed messages.
An issue when choosing e is that there should not be too many unconcealed
messages.
For instance, let p=19 and q=37.
Then n=19*37=703 and =18*36=648.
I we choose e=181, then, although gcd(181,648)=1 it turns out that all
possible messages
m (0mn-1) are unconcealed when calculating m^e mod n.
For any valid choice o e there exist some unconcealed messages.
It's important that the number o unconcealed messages is at a minimum.
Choose p=1009 and q=3643.
Find the sum o all values o e, 1<e<(1009,3643) and gcd(e,)=1, so that

the number o unconcealed messages or this value o e is at a minimum.

Answer: 088ad9a61e60b9309e91cc3ed27d729
Problem 183
===========
Let N be a positive integer and let N be split into k equal parts, r =
N/k, so that N = r + r + ... + r.
Let P be the product o these parts, P = r r ... r = r^k.
For example, i 11 is split into ive equal parts, 11 = 2.2 + 2.2 + 2.2 +
2.2 + 2.2, then P = 2.2^5 = 51.53632.
Let M(N) = P[max] or a given value o N.
It turns out that the maximum or N = 11 is ound by splitting eleven into
our equal parts which leads to P[max] = (11/4)^4; that is, M(11) =
14641/256 = 57.19140625, which is a terminating decimal.
However, or N = 8 the maximum is achieved by splitting it into three
equal parts, so M(8) = 512/27, which is a non-terminating decimal.
Let D(N) = N i M(N) is a non-terminating decimal and D(N) = -N i M(N) is
a terminating decimal.
For example, D(N) for 5 N 100 is 2438.
Find D(N) for 5 N 10000.
Answer: 438bc10af8f8eb366ec1371478ca3d3c
Problem 184
===========
Consider the set I[r] of points (x,y) with integer co-ordinates in the
interior of the circle with radius r, centered at the origin, i.e. x^2 +
y^2 < r^2.
For a radius of 2, I[2] contains the nine points (0,0), (1,0), (1,1),
(0,1), (-1,1), (-1,0), (-1,-1), (0,-1) and (1,-1). There are eight
triangles having all three vertices in I[2] which contain the origin in
the interior. Two of them are shown below, the others are obtained from
these by rotation.
For a radius of 3, there are 360 triangles containing the origin in the
interior and having all vertices in I[3] and for I[5] the number is 10600.
How many triangles are there containing the origin in the interior and
having all three vertices in I[105]?
p_184.gif
Answer: aa80f8619ed594e5d7852564457dbca6

Problem 185
===========
The game Number Mind is a variant of the well known game Master Mind.
Instead of coloured pegs, you have to guess a secret sequence of digits.
After each guess you're only told in how many places you've guessed the
correct digit. o, if the sequence was 1234 and you guessed 2036, you'd be
told that you have one correct digit; however, you would NOT be told that
you also have another digit in the wrong place.
For instance, given the following guesses for a 5-digit secret sequence,
90342
70794
39458
34109
51545
12531

;2
;0
;2
;1
;2
;1

correct
correct
correct
correct
correct
correct

The correct sequence 39542 is unique.

Based on the following guesses,
5616185650518293
3847439647293047
5855462940810587
9742855507068353
4296849643607543
3174248439465858
4513559094146117
7890971548908067
8157356344118483
2615250744386899
8690095851526254
6375711915077050
6913859173121360
6442889055042768
2321386104303845
2326509471271448
5251583379644322
1748270476758276
4895722652190306
3041631117224635
1841236454324589
2659862637316867

;2
;1
;3
;3
;3
;1
;2
;3
;1
;2
;3
;1
;1
;2
;0
;2
;2
;3
;1
;3
;3
;2

correct
correct
correct
correct
correct
correct
correct
correct
correct
correct
correct
correct
correct
correct
correct
correct
correct
correct
correct
correct
correct
correct

Find the unique 16-digit secret sequence.

Answer: 70f84864f21c4bf07ee53436580cd4bb
Problem 186
===========

Here are the records from a busy telephone system with one million users:

RecNr
Caller Called

1
200007 100053

2
600183 500439

3
600863 701497

...
... ...

The telephone number o the caller and the called number in record n are
Caller(n) = S[2n-1] and Called(n) = S[2n] where S[1,2,3,...] come rom the
"Lagged Fibonacci Generator":
For 1 k 55, S[k] = [100003 - 200003k + 300007k^3] (modulo 1000000)
For 56 k, S[k] = [S[k-24] + S[k-55]] (modulo 1000000)
I Caller(n) = Called(n) then the user is assumed to have misdialled and
the call ails; otherwise the call is successul.
From the start o the records, we say that any pair o users X and Y are
riends i X calls Y or vice-versa. Similarly, X is a riend o a riend
o Z i X is a riend o Y and Y is a riend o Z; and so on or longer
chains.
The Prime Minister's phone number is 524287. Ater how many successul
calls, not counting misdials, will 99% o the users (including the PM) be
a riend, or a riend o a riend etc., o the Prime Minister?
Answer: b21d681871ab1d5bbc1206b31643
Problem 187
===========
A composite is a number containing at least two prime actors. For
example, 15 = 3 5; 9 = 3 3; 12 = 2 2 3.
There are ten composites below thirty containing precisely two, not
necessarily distinct, prime actors:4, 6, 9, 10, 14, 15, 21, 22, 25, 26.
How many composite integers, n < 10^8, have precisely two, not necessarily
distinct, prime actors?
Answer: b3e6977523511d2cbbe8ccb1e394db
Problem 188
===========
The hyperexponentiation or tetration o a number a by a positive integer
b, denoted by ab or ^ba, is recursively deined by:

a1 = a,
a(k+1) = a^(ak).
Thus we have e.g. 32 = 3^3 = 27, hence 33 = 3^27 = 7625597484987 and
34 is roughly 10^3.6383346400240996*10^12.
Find the last 8 digits o 17771855.
Answer: 62746b4d40a2b87c3dd6caee5d33e6a1
Problem 189
===========
Consider the ollowing coniguration o 64 triangles:
We wish to colour the interior o each triangle with one o three colours:
red, green or blue, so that no two neighbouring triangles have the same
colour. Such a colouring shall be called valid. Here, two triangles are
said to be neighbouring i they share an edge.
Note: i they only share a vertex, then they are not neighbours.
For example, here is a valid colouring o the above grid:
A colouring C' which is obtained rom a colouring C by rotation or
relection is considered distinct rom C unless the two are identical.
How many distinct valid colourings are there or the above coniguration?
p_189_grid.gi
p_189_colours.gi
Answer: d3ddd37601678212b746c346991484
Problem 190
===========
Let S[m] = (x[1], x[2], ... , x[m]) be the m-tuple o positive real
numbers with x[1] + x[2] + ... + x[m] = m or which P[m] = x[1] * x[2]^2 *
... * x[m]^m is maximised.
For example, it can be veriied that [P[10]] = 4112 ([ ] is the integer
part unction).
Find [P[m]] for 2 m 15.
Answer: 40cfcabd9b30d79ec81151fc756e9946
Problem 191
===========
A particular school offers cash rewards to children with good attendance

and punctuality. If they are absent for three consecutive days or late on
more than one occasion then they forfeit their prize.
During an n-day period a trinary string is formed for each child
consisting of L's (late), O's (on time), and A's (absent).
Although there are eighty-one trinary strings for a 4-day period that can
be formed, exactly forty-three strings would lead to a prize:
OOOO
OAOL
AOOA
AALO
LAOO

OOOA
OAAO
AOOL
AALA
LAOA

OOOL
OAAL
AOAO
ALOO
LAAO

OOAO
OALO
AOAA
ALOA

OOAA
OALA
AOAL
ALAO

OOAL
OLOO
AOLO
ALAA

OOLO
OLOA
AOLA
LOOO

OOLA
OLAO
AAOO
LOOA

OAOO
OLAA
AAOA
LOAO

OAOA
AOOO
AAOL
LOAA

How many "prize" strings exist over a 30-day period?

Answer: e04dfa598b22a87570f63063f3ff595d
Problem 192
===========
Let x be a real number.
A best approximation to x for the denominator bound d is a rational number
r/s in reduced form, with s d, such that any rational number which is
closer to x than r/s has a denominator larger than d:
|p/q-x| < |r/s-x| q > d
For example, the best approximation to 13 for the denominator bound 20 is
18/5 and the best approximation to 13 for the denominator bound 30 is
101/28.
Find the sum of all denominators of the best approximations to n for the
denominator bound 10^12, where n is not a perfect square and 1 < n
100000.
Answer: e5ec7d4b094709b1fcebbd73b10e6264
Problem 193
===========
A positive integer n is called squarefree, if no square of a prime divides
n, thus 1, 2, 3, 5, 6, 7, 10, 11 are squarefree, but not 4, 8, 9, 12.
How many squarefree numbers are there below 2^50?
Answer: ea29fcf755b560777b0b6d8714234d18
Problem 194
===========

Consider graphs built with the units A: and B: , where the units are glued
alongthe vertical edges as in the graph .
A configuration of type (a,b,c) is a graph thus built of a units A and b
units B, where the graph's vertices are coloured using up to c colours, so
that no two adjacent vertices have the same colour.
The compound graph above is an example of a configuration of type (2,2,6),
in fact of type (2,2,c) for all c 4.
Let N(a,b,c) be the number of configurations of type (a,b,c).
For example, N(1,0,3) = 24, N(0,2,4) = 92928 and N(2,2,3) = 20736.
Find the last 8 digits of N(25,75,1984).
p_194_GraphA.png
p_194_GraphB.png
p_194_Fig.png
Answer: e070561d568a80a0e45d7835e3817ba4
Problem 195
===========
Let's call an integer sided triangle with exactly one angle of 60 degrees
a 60-degree triangle.
Let r be the radius of the inscribed circle of such a 60-degree triangle.
There are 1234 60-degree triangles for which r 100.
Let T(n) be the number of 60-degree triangles for which r n, so
T(100) = 1234, T(1000) = 22767, and T(10000) = 359912.
Find T(1053779).
Answer: 0fe232937a6d9f2a40825b86f568a38c
Problem 196
===========
Build a triangle from all positive integers in the following way:
1
2 3
456
789
11 12 13
16 17 18
22 23 24
29 30 31
37 38 39
46 47 48
56 57 58
. . .

10
14
19
25
32
40
49
59

15
20
26
33
41
50
60

21
27
34
42
51
61

28
35
43
52
62

36
44 45
53 54 55
63 64 65 66

Each positive integer has up to eight neighbours in the triangle.

A set of three primes is called a prime triplet if one of the three primes
has the other two as neighbours in the triangle.
For example, in the second row, the prime numbers 2 and 3 are elements of
some prime triplet.
If row 8 is considered, it contains two primes which are elements of some
prime triplet, i.e. 29 and 31.
If row 9 is considered, it contains only one prime which is an element of
some prime triplet: 37.
Define (n) as the sum of the primes in row n which are elements of any
prime triplet.
Then (8)=60 and (9)=37.
You are given that (10000)=950007619.
Find (5678027) + (7208785).
Answer: fb6b6b0a4b7b31ba429152bc0b6bd037
Problem 197
===========
Given is the function f(x) = 2^30.403243784-x^2 10^-9 ( is the
floor-function),
the sequence u[n] is defined by u[0] = -1 and u[n+1] = f(u[n]).
Find u[n] + u[n+1] for n = 10^12.
Give your answer with 9 digits after the decimal point.
Answer: c98cbf87636906f2465d481be815e454
Problem 198
===========
A best approximation to a real number x for the denominator bound d is a
rational number r/s (in reduced form) with s d, so that any rational
number p/q which is closer to x than r/s has q > d.
Usually the best approximation to a real number is uniquely determined for
all denominator bounds. However, there are some exceptions, e.g. 9/40 has
the two best approximations 1/4 and 1/5 for the denominator bound 6.We
shall call a real number x ambiguous, if there is at least one denominator
bound for which x possesses two best approximations. Clearly, an ambiguous
number is necessarily rational.
How many ambiguous numbers x = p/q,0 < x < 1/100, are there whose
denominator q does not exceed 10^8?
Answer: e59816f440fec9368c681314a127f3ee

Problem 199
===========
Three circles of equal radius are placed inside a larger circle such that
each pair of circles is tangent to one another and the inner circles do
not overlap. There are four uncovered "gaps" which are to be filled
iteratively with more tangent circles.
At each iteration, a maximally sized circle is placed in each gap, which
creates more gaps for the next iteration. After 3 iterations (pictured),
there are 108 gaps and the fraction of the area which is not covered by
circles is 0.06790342, rounded to eight decimal places.
What fraction of the area is not covered by circles after 10 iterations?
Give your answer rounded to eight decimal places using the format
x.xxxxxxxx .
p_199_circles_in_circles.gif
Answer: 0f8fd87159c28ae5fea6ac91a95d48dd
Problem 200
===========
We shall define a sqube to be a number of the form, p^2q^3, where p and q
are distinct primes.
For example, 200 = 5^22^3 or 120072949 = 23^261^3.
The first five squbes are 72, 108, 200, 392, and 500.
Interestingly, 200 is also the first number for which you cannot change
any single digit to make a prime; we shall call such numbers, prime-proof.
The next prime-proof sqube which contains the contiguous sub-string "200"
is 1992008.
Find the 200th prime-proof sqube containing the contiguous sub-string
"200".
Answer: c911c8e346aa813da5f5ed4f8e9128d8
Problem 201
===========
For any set A of numbers, let sum(A) be the sum of the elements of A.
Consider the set B = {1,3,6,8,10,11}.
There are 20 subsets of B containing three elements, and their sums are:
sum({1,3,6}) = 10,
sum({1,3,8}) = 12,
sum({1,3,10}) = 14,
sum({1,3,11}) = 15,
sum({1,6,8}) = 15,
sum({1,6,10}) = 17,

sum({1,6,11}) = 18,
sum({1,8,10}) = 19,
sum({1,8,11}) = 20,
sum({1,10,11}) = 22,
sum({3,6,8}) = 17,
sum({3,6,10}) = 19,
sum({3,6,11}) = 20,
sum({3,8,10}) = 21,
sum({3,8,11}) = 22,
sum({3,10,11}) = 24,
sum({6,8,10}) = 24,
sum({6,8,11}) = 25,
sum({6,10,11}) = 27,
sum({8,10,11}) = 29.

ome of these sums occur more than once, others are unique.
For a set A, let U(A,k) be the set of unique sums of k-element subsets of
A, in our example we find U(B,3) = {10,12,14,18,21,25,27,29} and
sum(U(B,3)) = 156.
Now consider the 100-element set  = {1^2, 2^2, ... , 100^2}.
 has 100891344545564193334812497256 50-element subsets.
Determine the sum of all integers which are the sum of exactly one of the
50-element subsets of , i.e. find sum(U(,50)).
Answer: b7ad07c58c81a940b8ff067a13b2760d
Problem 202
===========
Three mirrors are arranged in the shape of an equilateral triangle, with
their reflective surfaces pointing inwards. There is an infinitesimal gap
at each vertex of the triangle through which a laser beam may pass.
Label the vertices A, B and C. There are 2 ways in which a laser beam may
enter vertex C, bounce off 11 surfaces, then exit through the same vertex:
one way is shown below; the other is the reverse of that.
There are 80840 ways in which a laser beam may enter vertex C, bounce off
1000001 surfaces, then exit through the same vertex.
In how many ways can a laser beam enter at vertex C, bounce off
12017639147 surfaces, then exit through the same vertex?
p_201_laserbeam.gif
Answer: e9774949b5efad0d40d60ede379c5321
Problem 203
===========
The binomial coefficients ^nC[k] can be arranged in triangular form,
Pascal's triangle, like this:

1
1
1
1
1
1
1
1

3
4
10
15

21

1
3

5
6

1
2
10
20

35

1
4

1
5

15
35

1
6

21

1
7

.........
It can be seen that the first eight rows of Pascal's triangle contain
twelve distinct numbers: 1,2,3,4,5,6,7,10,15,20,21and35.
A positive integer n is called squarefree if no square of a prime divides
n.Of the twelve distinct numbers in the first eight rows of Pascal's
triangle, all except 4 and 20 are squarefree.The sum of the distinct
squarefree numbers in the first eight rows is 105.
Find the sum of the distinct squarefree numbers in the first 51 rows of
Pascal's triangle.
Answer: d7ec16d216c923d3c927f46cfc914e92
Problem 204
===========
A Hamming number is a positive number which has no prime factor larger
than 5.
o the first few Hamming numbers are 1, 2, 3, 4, 5, 6, 8, 9, 10, 12, 15.
There are 1105 Hamming numbers not exceeding 10^8.
We will call a positive number a generalised Hamming number of type n, if
it has no prime factor larger than n.
Hence the Hamming numbers are the generalised Hamming numbers of type 5.
How many generalised Hamming numbers of type 100 are there which don't
exceed 10^9?
Answer: 4118ffb9edc56a033b5b27ca0bf34366
Problem 205
===========
Peter has nine four-sided (pyramidal) dice, each with faces numbered 1, 2,
3, 4.
Colin has six six-sided (cubic) dice, each with faces numbered 1, 2, 3, 4,
5, 6.
Peter and Colin roll their dice and compare totals: the highest total
wins. The result is a draw if the totals are equal.
What is the probability that Pyramidal Pete beats Cubic Colin? Give your
answer rounded to seven decimal places in the form 0.abcdefg

Answer: ba6c6c3888227a0799eca38191b587be
Problem 206
===========
Find the unique positive integer whose square has the form
1_2_3_4_5_6_7_8_9_0,
where each _ is a single digit.
Answer: 09f9d87cb4b1ebb34e1f607e55a351d8
Problem 207
===========
For some positive integers k, there exists an integer partition of the
form 4^t = 2^t + k,
where 4^t, 2^t, and k are all positive integers and t is a real number.
The first two such partitions are 4^1 = 2^1 + 2 and 4^1.5849625... =
2^1.5849625... + 6.
Partitions where t is also an integer are called perfect.
For any m 1 let P(m) be the proportion of such partitions that are
perfect with k m.
Thus P(6) = 1/2.
In the following table are listed some values of P(m)
P(5) = 1/1
P(10) = 1/2
P(15) = 2/3
P(20) = 1/2
P(25) = 1/2
P(30) = 2/5
...
P(180) = 1/4
P(185) = 3/13
Find the smallest m for which P(m) < 1/12345
Answer: 3f17b264ed1717fe5fbde1e399bd501f
Problem 208
===========
A robot moves in a series of one-fifth circular arcs (72), with a free
choice of a clockwise or an anticlockwise arc for each step, but no
turning on the spot.
One of 70932 possible closed paths of 25 arcs starting northward is

Given that the robot starts facing North, how many journeys of 70 arcs in
length can it take that return it, after the final arc, to its starting
position?
(Any arc may be traversed multiple times.)
p_208_robotwalk.gif
Answer: 3010e33173f30e0aac79e84835b48823
Problem 209
===========
A k-input binary truth table is a map from k input bits(binary digits, 0
[false] or 1 [true]) to 1 output bit. For example, the 2-input binary
truth tables for the logical AND and XOR functions are:

x y x AND y

0 0
0

0 1
0

1 0
0

1 1
1

x y x XOR y

0 0
0

0 1
1

1 0
1

1 1
0

How many 6-input binary truth tables, , saisfy he formula

(a, b, c, d, e, f) AND (b, c, d, e, f, a XOR (b AND c)) = 0
Answer: 954157aa4762df2ee29580ee5a351b13
Problem 210
===========
Consider he se S(r) of poins (x,y) wih ineger coordinaes saisfying
|x| + |y| r.
Le O be he poin (0,0) and C he poin (r/4,r/4).
Le N(r) be he number of poins B in S(r), so ha he riangle OBC has
an obuse angle, i.e. he larges angle stisfies 90<<180.
So, for exmple, N(4)=24 nd N(8)=100.

Wht is N(1,000,000,000)?
Answer: 0c808b02789c4db462322b2c070bbb
Problem 211
===========
For  positive integer n, let [2](n) be the um of the quare of it
divior. For example,
[2](10) = 1 + 4 + 25 + 100 = 130.
Find the um of all n, 0 < n < 64,000,000 uch that [2](n) i a perfect
quare.
Anwer: 5fe0ed146690e7bca448687a94353a73
Problem 212
===========
An axi-aligned cuboid, pecified by parameter { (x[0],y[0],z[0]),
(dx,dy,dz) }, conit of all point (X,Y,Z) uch that x[0] X x[0]+dx,
y[0] Y y[0]+dy and z[0] Z z[0]+dz. The volume of the cuboid i the
product, dx dy dz. The combined volume of a collection of cuboid i
the volume of their union and will be le than the um of the individual
volume if any cuboid overlap.
Let C[1],...,C[50000] be a collection of 50000 axi-aligned cuboid uch
that C[n] ha parameter
x[0]
y[0]
z[0]
dx =
dy =
dz =

=
=
=
1
1
1

S[6n-5] modulo 10000

S[6n-4] modulo 10000
S[6n-3] modulo 10000
+ (S[6n-2] modulo 399)
+ (S[6n-1] modulo 399)
+ (S[6n] modulo 399)

where S[1],...,S[300000] come from the "Lagged Fibonacci Generator":

For 1 k 55, S[k] = [100003 - 200003k + 300007k^3] (modulo 1000000)
For 56 k, S[k] = [S[k-24] + S[k-55]] (modulo 1000000)
Thu, C[1] ha parameter {(7,53,183),(94,369,56)}, C[2] ha parameter
{(2383,3563,5079),(42,212,344)}, and o on.
The combined volume of the firt 100 cuboid, C[1],...,C[100], i
723581599.
What i the combined volume of all 50000 cuboid, C[1],...,C[50000] ?
Anwer: 76650c9c077929e1ce5a80a1ac81fa96

Problem 213
===========
A 3030 grid of quare contain 900 flea, initially one flea per quare.
When a bell i rung, each flea jump to an adjacent quare at random
(uually 4 poibilitie, except for flea on the edge of the grid or at
the corner).
What i the expected number of unoccupied quare after 50 ring of the
bell? Give your anwer rounded to ix decimal place.
Anwer: f81ee7dd444a3d895a4a446f9d115bf8
Problem 214
===========
Let be Euler's totient unction, i.e. or a natural number n,(n) is the
number o k, 1 k n, or which gcd(k,n) = 1.
By iterating , each positive integer generates a decreasing chain o
numbers ending in 1.
E.g. i we start with 5 the sequence 5,4,2,1 is generated.
Here is a listing o all chains with length 4:
5,4,2,1
7,6,2,1
8,4,2,1
9,6,2,1
10,4,2,1
12,4,2,1
14,6,2,1
18,6,2,1
Only two o these chains start with a prime, their sum is 12.
What is the sum o all primes less than 40000000 which generate a chain o
length 25?
Answer: 1ced865483c03552d5247b05685c7
Problem 215
===========
Consider the problem o building a wall out o 21 and 31 bricks
(horizontalvertical dimensions) such that, or extra strength, the gaps
between horizontally-adjacent bricks never line up in consecutive layers,
i.e. never orm a "running crack".
For example, the ollowing 93 wall is not acceptable due to the running
crack shown in red:
There are eight ways o orming a crack-ree 93 wall, written W(9,3) = 8.

Calculate W(32,10).
p_215_crackree.gi
Answer: 60212c9ec4a6cd1d14277c32b6ad2d8
Problem 216
===========
Consider numbers t(n) o the orm t(n) = 2n^2-1 with n > 1.
The irst such numbers are 7, 17, 31, 49, 71, 97, 127 and 161.
It turns out that only 49 = 7*7 and 161 = 7*23 are not prime.
For n 10000 there are 2202 numbers t(n) that are prime.
How many numbers t(n) are prime or n 50,000,000 ?
Answer: e512153424a482deb9de401ac0465a72
Problem 217
===========
A positive integer with k (decimal) digits is called balanced i its irst
^k/[2] digits sum to the same value as its last ^k/[2] digits, where
x, pronounced ceiling o x, is the smallest integer x, thus = 4
and 5 = 5.
So, or example, all palindromes are balanced, as is 13722.
Let T(n) be the sum o all balanced numbers less than 10^n.
Thus: T(1) = 45, T(2) = 540 and T(5) = 334795890.
Find T(47) mod 3^15
Answer: 11b97aac06892e1a07eb7eba8db
Problem 218
===========
Consider the right angled triangle with sides a=7, b=24 and c=25.The area
o this triangle is 84, which is divisible by the perect numbers 6 and
28.
Moreover it is a primitive right angled triangle as gcd(a,b)=1 and
gcd(b,c)=1.
Also c is a perect square.
We will call a right angled triangle perect i
-it is a primitive right angled triangle
-its hypotenuse is a perect square
We will call a right angled triangle super-perect i
-it is a perect right angled triangle and
-its area is a multiple o the perect numbers 6 and 28.

How many perect right-angled triangles with c10^16 exist that are not
super-perect?
Answer: ccd208495d565e66e7d998764da
Problem 219
===========
Let A and B be bit strings (sequences o 0's and 1's).
I A is equal to the letmost length(A) bits o B, then A is said to be a
preix o B.
For example, 00110 is a preix o 001101001, but not o 00111 or 100110.
A preix-ree code o size n is a collection o n distinct bit strings
such that no string is a preix o any other. For example, this is a
preix-ree code o size 6:
0000, 0001, 001, 01, 10, 11
Now suppose that it costs one penny to transmit a '0' bit, but our pence
to transmit a '1'.
Then the total cost o the preix-ree code shown above is 35 pence, which
happens to be the cheapest possible or the skewed pricing scheme in
question.
In short, we write Cost(6) = 35.
What is Cost(10^9) ?
Answer: 578c22e288b88c60bc4541351a5
Problem 220
===========
Let D[0] be the two-letter string "Fa". For n1, derive D[n] rom D[n-1]
by the string-rewriting rules:
"a" "aRbFR"
"b" "LFaLb"
Thus, D[0] = "Fa", D[1] = "FaRbFR", D[2] = "FaRbFRRLFaLbFR", and so on.
These strings can be interpreted as instructions to a computer graphics
program, with "F" meaning "draw orward one unit", "L" meaning "turn let
90 degrees", "R" meaning "turn right 90 degrees", and "a" and "b" being
ignored. The initial position o the computer cursor is (0,0), pointing up
towards (0,1).
Then D[n] is an exotic drawing known as the Heighway Dragon o order n.
For example, D[10] is shown below; counting each "F" as one step, the
highlighted spot at (18,16) is the position reached ater 500 steps.
What is the position o the cursor ater 10^12 steps in D[50] ?
Give your answer in the orm x,y with no spaces.

p_220.gi
Answer: e2018d8ede8ea003191adc042150b
Problem 221
===========
We shall call a positive integer A an "Alexandrian integer", i there
exist integers p, q, r such that:
A = p q r and 1 = 1 + 1 + 1
A p q r
For example, 630 is an Alexandrian integer (p=5, q=7, r=18).In
fact, 630 is the 6^th Alexandrian integer, the first 6 Alexandrian
integers being: 6, 42, 120, 156, 420 and 630.
Find the 150000^th Alexandrian integer.
Answer: cb000c24f653d9c8f78b74123e6515ab
Problem 222
===========
What is the length of the shortest ie, of internal radius 50mm, that can
fully contain 21 balls of radii 30mm, 31mm, ..., 50mm?
Give your answer in micrometres (10^ 6 m) rounded to the nearest integer.
Answer: 6984ba429b968467619ec98a8ee51abf
Problem 223
===========
Let us call an integer sided triangle with sides a b c barely acute if
the sides satisfy
a^2 + b^2 = c^2 + 1.
How many barely acute triangles are there with erimeter 25,000,000?
Answer: cb875e59736a1967c8da8fc8062a6bc5
Problem 224
===========
Let us call an integer sided triangle with sides a b c barely obtuse
if the sides satisfy
a^2 + b^2 = c^2
1.

How many barely obtuse triangles are there with erimeter 75,000,000?
Answer: c43cfb12750dee27b4b0d016261e831b
Problem 225
===========
The sequence 1, 1, 1, 3, 5, 9, 17, 31, 57, 105, 193, 355, 653, 1201 ...
is defined by T[1] = T[2] = T[3] = 1 and T[n] = T[n 1] + T[n 2] + T[n 3].
It can be shown that 27 does not divide any terms of this sequence.
In fact, 27 is the first odd number with this roerty.
Find the 124^th odd number that does not divide any terms of the above
sequence.
Answer: f1981e4bd8a0d6d8462016d2fc6276b3
Problem 226
===========
The blancmange curve is the set of oints (x,y) such that 0 x 1 and ,
where s(x) = the distance from x to the nearest integer.
The area under the blancmange curve is equal to , shown in ink in the
diagram below.
[1]blancmange curve
Let C be the circle with centre (,) and radius , shown in black in the
diagram.
What area under the blancmange curve is enclosed by C?
Give your answer rounded to eight decimal laces in the form 0.abcdefgh
Visible links
_226_formula.gif
_226_scoo2.gif
Answer: ce6fd32d1d2fb58c4c0c1f7962c39f04
Problem 227
===========
"The Chase" is a game layed with two dice and an even number of layers.
The layers sit around a table; the game begins with two oosite layers
having one die each. On each turn, the two layers with a die roll it.
If a layer rolls a 1, he asses the die to his neighbour on the left; if
he rolls a 6, he asses the die to his neighbour on the right; otherwise,
he kees the die for the next turn.

The game ends when one layer has both dice after they have been rolled
and assed; that layer has then lost.
In a game with 100 layers, what is the exected number of turns the game
lasts?
Give your answer rounded to ten significant digits.
Answer: 7b87cd0a96f0f2f12f911cdc66608d95
Problem 228
===========
Let S[n] be the regular n sided olygon or shae whose vertices v[k]
(k = 1,2,,n) have coordinate:
x[k] =
co( ^2k-1/[n] 180 )
y[k] = in( ^2k-1/[n] 180 )
Each S[n] i to be interpreted a a filled hape coniting of all point
on the perimeter and in the interior.
The Minkowki um, S+T, of two hape S and T i the reult of adding
every point in S to every point in T, where point addition i performed
coordinate-wie: (u, v) + (x, y) = (u+x, v+y).
For example, the um of S[3] and S[4] i the ix-ided hape hown in pink
below:
[1]picture howing S_3 + S_4
How many ide doe S[1864] + S[1865] + + S[1909] have?
Viible link
p_228.png
Anwer: 35d0195ddaf58e52e12400de1c9333d8
Problem 229
===========
Conider the number 3600. It i very pecial, becaue
3600 = 48^2 + 36^2
3600 = 20^2 + 240^2
3600 = 30^2 + 330^2
3600 = 45^2 + 715^2
Similarly, we find that 88201 = 99^2 + 280^2 = 287^2 + 254^2 = 283^2 +
352^2 = 197^2 + 784^2.
In 1747, Euler proved which number are repreentable a a um of two

quare.We are intereted in the number n which admit repreentation of

all of the following four type:
n = a[1]^2 + b[1]^2
n = a[2]^2 + 2 b[2]^2
n = a[3]^2 + 3 b[3]^2
n = a[7]^2 + 7 b[7]^2,
where the a[k] and b[k] are poitive integer.
There are 75373 uch number that do not exceed 10^7.
How many uch number are there that do not exceed 210^9?
Anwer: d68b5ec8df4a56991901f67afbdef24f
Problem 230
===========
For any two tring of digit, A and B, we define F[A,B] to be the
equence (A,B,AB,BAB,ABBAB,...) in which each term i the concatenation of
the previou two.
Further, we define D[A,B](n) to be the n^th digit in the firt term of
F[A,B] that contain at leat n digit.
Example:
Let A=1415926535, B=8979323846. We wih to find D[A,B](35), ay.
The firt few term of F[A,B] are:
1415926535
8979323846
14159265358979323846
897932384614159265358979323846
14159265358979323846897932384614159265358979323846
Then D[A,B](35) i the 35^th digit in the fifth term, which i 9.
Now we ue for A the firt 100 digit of behind the decimal oint:
14159265358979323846264338327950288419716939937510
58209749445923078164062862089986280348253421170679
and for B the next hundred digits:
82148086513282306647093844609550582231725359408128
48111745028410270193852110555964462294895493038196 .
Find [n = 0,1,...,17] 10^n D[A,B]((127+19n)7^n) .
Answer: 040735038021ff4704bbd3a0964369ef

Problem 231
===========
The binomial coefficient ^10C[3] = 120.
120 = 2^3 3 5 = 2 2 2 3 5, and 2 + 2 + 2 + 3 + 5 = 14.
So the sum of the terms in the rime factorisation of ^10C[3] is 14.
Find the sum of the terms in the rime factorisation of
^20000000C[15000000].
Answer: ef8bc4d9a843e71126bd10b5065132a5
Problem 232
===========
Two layers share an unbiased coin and take it in turns to lay "The
Race". On Player 1's turn, he tosses the coin once: if it comes u Heads,
he scores one oint; if it comes u Tails, he scores nothing. On Player
2's turn, she chooses a ositive integer T and tosses the coin T times: if
it comes u all Heads, she scores 2^T 1 oints; otherwise, she scores
nothing. Player 1 goes first. The winner is the first to 100 or more
oints.
On each turn Player 2 selects the number, T, of coin tosses that maximises
the robability of her winning.
What is the robability that Player 2 wins?
Give your answer rounded to eight decimal laces in the form 0.abcdefgh .
Answer: c8d5b243aa6e6b507725766f7c197a1d
Problem 233
===========
Let f(N) be the number of oints with integer coordinates that are on a
circle assing through (0,0), (N,0),(0,N), and (N,N).
It can be shown that f(10000) = 36.
What is the sum of all ositive integers N 10^11 such that f(N) = 420 ?
Answer: 7e80b27798170abb493e3b4671bd82ca
Problem 234
===========
For an integer n 4, we define the lower rime square root of n, denoted
by ls(n), as the largest rime n and the uer rime square root of n,
us(n), as the smallest rime n.

So, for examle, ls(4) = 2 = us(4), ls(1000) = 31, us(1000) = 37.

Let us call an integer n 4 semidivisible, if one of ls(n) and us(n)
divides n, but not both.
The sum of the semidivisible numbers not exceeding 15 is 30, the numbers
are 8, 10 and 12.
15 is not semidivisible because it is a multile of both ls(15) = 3 and
us(15) = 5.
As a further examle, the sum of the 92 semidivisible numbers u to 1000
is 34825.
What is the sum of all semidivisible numbers not exceeding 999966663333 ?
Answer: c24a5d60f8ce5d04dec7466987c84d68
Problem 235
===========
Given is the arithmetic geometric sequence u(k) = (900 3k)r^k 1.
Let s(n) = [k=1...n]u(k).
Find the value of r for which s(5000) = -600,000,000,000.
Give your answer rounded to 12 places behind the decimal point.
Answer: 41b13508789be1001308e065d4f83ea2
Problem 236
===========

uppliers 'A' and 'B' provided the following numbers of products for the
luxury hamper market:
Product
Beluga Caviar
Christmas Cake
Gammon Joint
Vintage Port
Champagne Truffles

'A'
5248
1312
2624
5760
3936

'B'
640
1888
3776
3776
5664

Although the suppliers try very hard to ship their goods in perfect
condition, there is inevitably some spoilage - i.e. products gone bad.
The suppliers compare their performance using two types of statistic:
The five per-product spoilage rates for each supplier are equal to the
number of products gone bad divided by the number of products
supplied, for each of the five products in turn.
The overall spoilage rate for each supplier is equal to the total
number of products gone bad divided by the total number of products
provided by that supplier.
To their surprise, the suppliers found that each of the five per-product

spoilage rates was worse (higher) for 'B' than for 'A' by the same factor
(ratio of spoilage rates), m>1; and yet, paradoxically, the overall
spoilage rate was worse for 'A' than for 'B', also by a factor of m.
There are thirty-five m>1 for which this surprising result could have
occurred, the smallest of which is 1476/1475.
What's the largest possible value of m?
Give your answer as a fraction reduced to its lowest terms, in the form
u/v.
Answer: 6e707fcffc510520d981ae16a29579bb
Problem 237
===========
Let T(n) be the number of tours over a 4 n playing board such that:
The tour
The tour
square.
The tour
The tour

starts in the top left corner.

consists of moves that are up, down, left, or right one
visits each square exactly once.
ends in the bottom left corner.

The diagram shows one tour over a 4 10 board:

T(10) is 2329. What is T(10^12) modulo 10^8?
p_237.gif
Answer: 0742988a3948491b15fb48e476c78a6a
Problem 238
===========
Create a sequence of numbers using the "Blum Blum hub" pseudo-random
number generator:
s[0] = 14025256
s[n+1] = s[n]^2 mod 20300713
Concatenate these numbers s[0]s[1]s[2] to create a string w of infinite
length.
Then, w = 14025256741014958470038053646
For a positive integer k, if no substring of w exists with a sum of digits
equal to k, p(k) is defined to be zero. If at least one substring of w
exists with a sum of digits equal to k, we define p(k) = z, where z is the
starting position of the earliest such substring.
For instance:
The substrings 1, 14, 1402,
with respective sums of digits equal to 1, 5, 7,
start at position 1, hence p(1) = p(5) = p(7) = = 1.

The substrings 4, 402, 4025,

with respective sums of digits equal to 4, 6, 11,
start at position 2, hence p(4) = p(6) = p(11) = = 2.
The substrings 02, 0252,
with respective sums of digits equal to 2, 9,
start at position 3, hence p(2) = p(9) = = 3.
Note that substring 025 starting at position 3, has a sum of digits equal
to 7, but there was an earlier substring (starting at position 1) with a
sum of digits equal to 7, so p(7) = 1, not 3.
We can verify that, for 0 < k 10^3, p(k) = 4742.
Find p(k), for 0 < k 210^15.
Answer: 424ed6613a372ccb9a90dddb8961ca16
Problem 239
===========
A set o disks numbered 1 through 100 are placed in a line in random
order.
What is the probability that we have a partial derangement such that
exactly 22 prime number discs are ound away rom their natural positions?
(Any number o non-prime disks may also be ound in or out o their
natural positions.)
Give your answer rounded to 12 places behind the decimal point in the orm
0.abcdeghijkl.
Answer: 451d2b8c19bec650a5c46996e6e
Problem 240
===========
There are 1111 ways in which ive 6-sided dice (sides numbered 1 to 6) can
be rolled so that the top three sum to 15. Some examples are:
D[1],D[2],D[3],D[4],D[5]
D[1],D[2],D[3],D[4],D[5]
D[1],D[2],D[3],D[4],D[5]
D[1],D[2],D[3],D[4],D[5]

=
=
=
=

4,3,6,3,5
4,3,3,5,6
3,3,3,6,6
6,6,3,3,3

In how many ways can twenty 12-sided dice (sides numbered 1 to 12) be
rolled so that the top ten sum to 70?
Answer: cb31a3106db3876e77cd160664cd683e
Problem 241

===========
For a positive integer n, let (n) be the um of all divior of n, o
e.g. (6) = 1 + 2 + 3 + 6 = 12.
A perfect number, a you probably know, i a number with (n) = 2n.
Let u define the perfection quotient of a poitive integer p(n) = (n) .
a
n
Find the um of all poitive integer n 10^18 for which p(n) ha the
form k + ^1[2], where k i an integer.
Anwer: 556bfef2cacd1eff8af9126c5c13dcbc
Problem 242
===========
Given the et {1,2,...,n}, we define f(n,k) a the number of it k-element
ubet with an odd um of element. For example, f(5,3) = 4, ince the
et {1,2,3,4,5} ha four 3-element ubet having an odd um of element,
i.e.: {1,2,4}, {1,3,5}, {2,3,4} and {2,4,5}.
When all three value n, k and f(n,k) are odd, we ay that they make
an odd-triplet [n,k,f(n,k)].
There are exactly five odd-triplet with n 10, namely:
[1,1,f(1,1) = 1], [5,1,f(5,1) = 3], [5,5,f(5,5) = 1], [9,1,f(9,1) = 5] and
[9,9,f(9,9) = 1].
How many odd-triplet are there with n 10^12 ?
Anwer: ba73cb75365ddca8f94a23e3fedfb6de
Problem 243
===========
A poitive fraction whoe numerator i le than it denominator i called
a proper fraction.
For any denominator, d, there will be d1 roer fractions; for examle,
with d = 12:
1/12 , 2/12 , 3/12 , 4/12 , 5/12 , 6/12 , 7/12 ,
8/12 , 9/12 , 10/12 , 11/12 .
We shall call a fraction that cannot be cancelled down a resilient
fraction.
Furthermore we shall define the resilience of a denominator, R(d), to be
the ratio of its roer fractions that are resilient; for examle, R(12) =
4/11 .
In fact, d = 12 is the smallest denominator having a resilience R(d) <
4/10 .
Find the smallest denominator d, having a resilience R(d) < 15499/94744

.
Answer: 531721a10786c5c2a444b474fcf039f9
Problem 244
===========
You robably know the game Fifteen Puzzle. Here, instead of numbered
tiles, we have seven red tiles and eight blue tiles.
A move is denoted by the uercase initial of the direction (Left, Right,
U, Down) in which the tile is slid, e.g. starting from configuration (S),
by the sequence LULUR we reach the configuration (E):
(S)

,(E)

For each ath, its checksum is calculated by (seudocode):

checksum = 0
checksum = (checksum 243 + m[1]) mod 100 000 007
checksum = (checksum 243 + m[2]) mod 100 000 007

checkum = (checkum 243 + m[n]) mod 100 000 007

where m[k] i the ASCII value of the k^th letter in the move equence and
the ASCII value for the move are:

L
76

R
82

U
85

D
68

For the sequence LULUR given above, the checksum would be 19761398.
Now, starting rom coniguration (S),ind all shortest ways to reach
coniguration (T).
(S)

,(T)

What is the sum o all checksums or the paths having the minimal length?
p_244_start.gi
p_244_example.gi
p_244_start.gi
p_244_target.gi
Answer: 8d502ec1d0084a79d43d9dc5bd3a3d
Problem 245
===========
We shall call a raction that cannot be cancelled down a resilient

raction.
Furthermore we shall deine the resilience o a denominator, R(d), to be
the ratio o its proper ractions that are resilient; or example, R(12) =
^4[11].
The resilience o a number d > 1 is
then

(d) , where is Euler's totient

d - 1 unction.

We urther deine the coresilience o a number n > 1 as C(n) = n - (n) .

n - 1
The coresilience o a prime p is C(p) =

1 .
p - 1

Find the sum o all composite integers 1 < n 210^11, or which C(n) is
a unit raction.
Answer: 0ebeb502b0bd7157609835d27c266bc
Problem 246
===========
A deinition or an ellipse is:
Given a circle c with centre M and radius r and a point G such that
d(G,M)<r, the locus o the points that are equidistant rom c and G orm
an ellipse.
The construction o the points o the ellipse is shown below.
Given are the points M(-2000,1500) and G(8000,1500).
Given is also the circle c with centre M and radius 15000.
The locus o the points that are equidistant rom G and c orm an ellipse
e.
From a point P outside e the two tangents t[1] and t[2] to the ellipse are
drawn.
Let the points where t[1] and t[2] touch the ellipse be R and S.
For how many lattice points P is angle RPS greater than 45 degrees?
p_246_anim.gi
p_246_ellipse.gi
Answer: 94c521eb906391d161b66ec433827
Problem 247
===========
Consider the region constrained by 1 x and 0 y ^1/[x].
Let S[1] be the largest square that can it under the curve.
Let S[2] be the largest square that its in the remaining area, and so on.
Let the index o S[n] be the pair (let, below) indicating the number o
squares to the let o S[n] and the number o squares below S[n].
The diagram shows some such squares labelled by number.

S[2] has one square to its let and none below, so the index o S[2] is
(1,0).
It can be seen that the index o S[32] is (1,1) as is the index o S[50].
50 is the largest n or which the index o S[n] is (1,1).
What is the largest n or which the index o S[n] is (3,3)?
p_247_hypersquares.gi
Answer: 257956694e7665e3d512ad5b819e79d
Problem 248
===========
The irst number n or which (n)=13! is 6227180929.
Find the 150,000^th such number.
Answer: b69a3ba6746c7c52ce2449e9cc873
Problem 249
===========
Let S = {2, 3, 5, ..., 4999} be the set o prime numbers less than 5000.
Find the number o subsets o S, the sum o whose elements is a prime
number.
Enter the rightmost 16 digits as your answer.
Answer: a470ee3ca522b68d7034e48b39b8b26
Problem 250
===========
Find the number o non-empty subsets o {1^1, 2^2, 3^3,...,
250250^250250}, the sum o whose elements is divisible by 250. Enter the
rightmost 16 digits as your answer.
Answer: 4a56143700956273e0d271921d54
Problem 251
===========
A triplet o positive integers (a,b,c) is called a Cardano Triplet i it
satisies the condition:
For example, (2,1,5) is a Cardano Triplet.
There exist 149 Cardano Triplets or which a+b+c 1000.

Find how many Cardano Triplets exist such that a+b+c 110,000,000.
p_251_cardano.gi
Answer: 9690315a09a4d958dcc19ad96e6e889
Problem 252
===========
Given a set o points on a plane, we deine a convex hole to be a convex
polygon having as vertices any o the given points and not containing any
o the given points in its interior (in addition to the vertices, other
given points may lie on the perimeter o the polygon).
As an example, the image below shows a set o twenty points and a ew such
convex holes. The convex hole shown as a red heptagon has an area equal to
1049694.5 square units, which is the highest possible area or a convex
hole on the given set o points.
For our example, we used the irst 20 points (T[2k1], T[2k]), for
k = 1,2,,20, produced with the peudo-random number generator:
S[0] =[] 290797[]
S[n+1] =[] S[n]^2 mod 50515093
T[n] =[] ( S[n] mod 2000 ) 1000^
i.e. (527, 144), (488, 732), (454, 947),
What i the maximum area for a convex hole on the et containing the firt
500 point in the peudo-random equence?
Specify your anwer including one digit after the decimal point.
p_252_convexhole.gif
Anwer: 53b1ced82e1b588d756750c4d2f77e0d
Problem 253
===========
A mall child ha a number caterpillar coniting of forty jigaw
piece, each with one number on it, which, when connected together in a
line, reveal the number 1 to 40 in order.
Every night, the child' father ha to pick up the piece of the
caterpillar that have been cattered acro the play room. He pick up the
piece at random and place them in the correct order.
A the caterpillar i built up in thi way, it form ditinct egment
that gradually merge together.
The number of egment tart at zero (no piece placed), generally
increae up to about eleven or twelve, then tend to drop again before
finihing at a ingle egment (all piece placed).
For example:

Piece PlacedSegments So Far

12

29

34

35

Let M be the maximum number o segments encountered during a random

tidy-up o the caterpillar.
For a caterpillar o ten pieces, the number o possibilities or each M is

M
Possibilities

512

2
250912

3
1815264

4
1418112

5
144000

so the most likely value o M is 3 and the average value is

^385643[113400] = 3.400732, rounded to six decimal places.
The most likely value o M or a orty-piece caterpillar is 11; but what
is the average value o M?
Give your answer rounded to six decimal places.
Answer: 228de0a37019d7c70510293d126422
Problem 254
===========
Deine (n) as the sum o the actorials o the digits o n. For example,
(342) = 3! + 4! + 2! = 32.
Deine s(n) as the sum o the digits o (n). So s(342) = 3 + 2 = 5.
Deine g(i) to be the smallest positive integer n such that s(n) = i.
Though s(342) is 5, s(25) is also 5, and it can be veriied that g(5) is

25.
Deine sg(i) as the sum o the digits o g(i). So sg(5) = 2 + 5 = 7.
Further, it can be veriied that g(20) is 267 and sg(i) or 1 i 20
is 156.
What is sg(i) or 1 i 150?
Answer: 936014ad2de65d41979ad900325e485
Problem 255
===========
We deine the rounded-square-root o a positive integer n as the square
root o n rounded to the nearest integer.
The ollowing procedure (essentially Heron's method adapted to integer
arithmetic) inds the rounded-square-root o n:
Let d be the number o digits o the number n.
I d is odd, set x[0] = 210^(d-1)2.
I d is even, set x[0] = 710^(d-2)2.
Repeat:
until x[k+1] = x[k].
As an example, let
n has 4 digits, so
Since x[2] = x[1],
So, ater just two
o 4321 is 66 (the

us ind the rounded-square-root o n = 4321.

x[0] = 710^(4-2)2 = 70.
we stop here.
iterations, we have ound that the rounded-square-root
actual square root is 65.7343137).

The number o iterations required when using this method is surprisingly

low.
For example, we can ind the rounded-square-root o a 5-digit integer
(10,000 n 99,999) with an average o 3.2102888889 iterations (the
average value was rounded to 10 decimal places).
Using the procedure described above, what is the average number o
iterations required to ind the rounded-square-root o a 14-digit number
(10^13 n < 10^14)?
Give your answer rounded to 10 decimal places.
Note: The symbols x and x represent the loor unction and ceiling
unction respectively.
p_255_Heron.gi
p_255_Example.gi
Answer: 12be028b156b49aa1137ebda940ab5
Problem 256
===========

Tatami are rectangular mats, used to completely cover the loor o a room,
without overlap.
Assuming that the only type o available tatami has dimensions 12, there
are obviously some limitations or the shape and size o the rooms that
can be covered.
For this problem, we consider only rectangular rooms with integer
dimensions a, b and even size s = ab.
We use the term 'size' to denote the loor surace area o the room, and
without loss o generality we add the condition a b.
There is one rule to ollow when laying out tatami: there must be no
points where corners o our dierent mats meet.
For example, consider the two arrangements below or a 44 room:
The arrangement on the let is acceptable, whereas the one on the right is
not: a red "X" in the middle, marks the point where our tatami meet.
Because o this rule, certain even-sized rooms cannot be covered with
tatami: we call them tatami-ree rooms.
Further, we deine T(s) as the number o tatami-ree rooms o size s.
The smallest tatami-ree room has size s = 70 and dimensions 710.
All the other rooms o size s = 70 can be covered with tatami; they are:
170, 235 and 514.
Hence, T(70) = 1.
Similarly, we can veriy that T(1320) = 5 because there are exactly 5
tatami-ree rooms o size s = 1320:
2066, 2260, 2455, 3044 and 3340.
In act, s = 1320 is the smallest room-size s or which T(s) = 5.
Find the smallest room-size s or which T(s) = 200.
p_256_tatami3.gi
Answer: e8eb0c177d00a5b80e1723786a22698
Problem 257
===========
Given is an integer sided triangle ABC with sides a b c. (AB = c, BC =
a and AC = b).
The angular bisectors o the triangle intersect the sides at points E, F
and G (see picture below).
The segments EF, EG and FG partition the triangle ABC into our smaller
triangles: AEG, BFE, CGF and EFG.
It can be proven that or each o these our triangles the ratio
area(ABC)/area(subtriangle) is rational.
However, there exist triangles or which some or all o these ratios are
integral.
How many triangles ABC with perimeter100,000,000 exist so that the ratio
area(ABC)/area(AEG) is integral?

p_257_bisector.gi
Answer: 3ba58bde91c83c98904050d90e466ce2
Problem 258
===========
A sequence is deined as:
g[k] = 1, or 0 k 1999
g[k] = g[k-2000] + g[k-1999], or k 2000.
Find g[k] mod 20092010 or k = 10^18.
Answer: 18eca01383acbde20dcc24ed06627ea
Problem 259
===========
A positive integer will be called reachable i it can result rom an
arithmetic expression obeying the ollowing rules:
Uses the digits 1 through 9, in that order and exactly once each.
Any successive digits can be concatenated (or example, using the
digits 2, 3 and 4 we obtain the number 234).
Only the our usual binary arithmetic operations (addition,
subtraction, multiplication and division) are allowed.
Each operation can be used any number o times, or not at all.
Unary minus is not allowed.
Any number o (possibly nested) parentheses may be used to deine the
order o operations.
For example, 42 is reachable, since (1/23) * ((4*5)-6) * (78-9) = 42.
What is the sum o all positive reachable integers?
Answer: 771828a57c269d873335c9091a7876
Problem 260
===========
A game
At her
i she
number

is played with three piles o stones and two players.

turn, a player removes one or more stones rom the piles. However,
takes stones rom more than one pile, she must remove the same
o stones rom each o the selected piles.

In other words, the player chooses some N>0 and removes:

N stones rom any single pile; or
N stones rom each o any two piles (2N total); or
N stones rom each o the three piles (3N total).
The player taking the last stone(s) wins the game.

A winning coniguration is one where the irst player can orce a win.
For example, (0,0,13), (0,11,11) and (5,5,5) are winning conigurations
because the irst player can immediately remove all stones.
A losing coniguration is one where the second player can orce a win, no
matter what the irst player does.
For example, (0,1,2) and (1,3,3) are losing conigurations: any legal move
leaves a winning coniguration or the second player.
Consider all losing conigurations (x[i],y[i],z[i]) where x[i] y[i]
z[i] 100.
We can veriy that (x[i]+y[i]+z[i]) = 173895 for these.
Find (x[i]+y[i]+z[i]) where (x[i],y[i],z[i]) ranges over the losing
configurations
with x[i] y[i] z[i] 1000.
Answer: cab69719e6968409ba167707a09875cb
Problem 261
===========
Let us call a positive integer k a square-pivot, if there is a pair of
integers m > 0 and n k, such that the sum of the (m+1) consecutive
squares up to k equals the sum of the m consecutive squares from (n+1) on:
(k-m)^2 + ... + k^2 = (n+1)^2 + ... + (n+m)^2.

ome small square-pivots are

4: 3^2 + 4^2 = 5^2
21: 20^2 + 21^2 = 29^2
24: 21^2 + 22^2 + 23^2 + 24^2 = 25^2 + 26^2 + 27^2
110: 108^2 + 109^2 + 110^2 = 133^2 + 134^2
Find the sum of all distinct square-pivots 10^10.
Answer: d45ddf64010ed143228a6a6b84837de9
Problem 262
===========
The following equation represents the continuous topography of a
mountainous region, giving the elevation h at any point (x,y):
A mosquito intends to fly from A(200,200) to B(1400,1400), without leaving
the area given by 0x,y1600.
Because of the intervening mountains, it first rises straight up to a
point A', having elevation f. Then, while remaining at the same elevation
f, it flies around any obstacles until it arrives at a point B' directly
above B.

First, determine f[min] which is the minimum constant elevation allowing

such a trip from A to B, while remaining in the specified area.
Then, find the length of the shortest path between A' and B', while flying
at that constant elevation f[min].
Give that length as your answer, rounded to three decimal places.
Note: For convenience, the elevation function shown above is repeated
below, in a form suitable for most programming languages:
h=( 5000-0.005*(x*x+y*y+x*y)+12.5*(x+y) ) * exp(
-abs(0.000001*(x*x+y*y)-0.0015*(x+y)+0.7) )
p_262_formula1.gif
Answer: a5921e175a44d31e7f82f7f9a61a36af
Problem 263
===========
Consider the number 6. The divisors of 6 are: 1,2,3 and 6.
Every number from 1 up to and including 6 can be written as a sum of
distinct divisors of 6:
1=1, 2=2, 3=1+2, 4=1+3, 5=2+3, 6=6.
A number n is called a practical number if every number from 1 up to and
including n can be expressed as a sum of distinct divisors of n.
A pair of consecutive prime numbers with a difference of six is called a
sexy pair (since "sex" is the Latin word for "six"). The first sexy pair
is (23, 29).
We may occasionally find a triple-pair, which means three consecutive sexy
prime pairs, such that the second member of each pair is the first member
of the next pair.
We shall call a number n such that :
(n-9, n-3), (n-3,n+3), (n+3, n+9) form a triple-pair, and
the numbers n-8, n-4, n, n+4 and n+8 are all practical,
an engineers prdise.
Find the sum of the first four engineers prdises.
Answer: 8fe3eb7196c69080740e076cff9b41
Problem 264
===========
Consider ll the tringles hving:
All their vertices on lttice points.
Circumcentre t the origin O.
Orthocentre t the point H(5, 0).
There re nine such tringles hving  perimeter 50.

Listed nd shown in scending order of their perimeter, they re:

A(-4, 3), B(5, 0), C(4, -3)
A(4, 3), B(5, 0), C(-4, -3)
A(-3, 4), B(5, 0), C(3, -4)
A(3, 4), B(5, 0), C(-3, -4)
A(0, 5), B(5, 0), C(0, -5)
A(1, 8), B(8, -1), C(-4, -7)
A(8, 1), B(1, -8), C(-4, 7)
A(2, 9), B(9, -2), C(-6, -7)
A(9, 2), B(2, -9), C(-6, 7)
The sum of their perimeters, rounded to four deciml plces, is 291.0089.
Find ll such tringles with  perimeter 10^5.
Enter s your nswer the sum of their perimeters rounded to four deciml
plces.
p_264_TringleCentres.gif
Answer: 28751404538be0751786694c77ee
Problem 265
===========
2^N binry digits cn be plced in  circle so tht ll the N-digit
clockwise subsequences re distinct.
For N=3, two such circulr rrngements re possible, ignoring rottions:
For the first rrngement, the 3-digit subsequences, in clockwise order,
re:
000, 001, 010, 101, 011, 111, 110 nd 100.
Ech circulr rrngement cn be encoded s  number by conctenting the
binry digits strting with the subsequence of ll zeros s the most
significnt bits nd proceeding clockwise. The two rrngements for N=3
re thus represented s 23 nd 29:
00010111 [2] = 23
00011101 [2] = 29
Clling S(N) the sum of the unique numeric representtions, we cn see
tht S(3) = 23 + 29 = 52.
Find S(5).
p_265_BinryCircles.gif
Answer: c25cebbc8dce4bdcf96cb39511fcc3
Problem 266
===========
The divisors of 12 re: 1,2,3,4,6 nd 12.

The lrgest divisor of 12 tht does not exceed the squre root of 12 is 3.
We shll cll the lrgest divisor of n integer n tht does not exceed the
squre root of n the pseudo squre root (PSR) of n.
It cn be seen tht PSR(3102)=47.
Let p be the product of the primes below 190.
Find PSR(p) mod 10^16.
Answer: 32d1d501e539b509f104e2db68d57
Problem 267
===========
You re given  unique investment opportunity.
Strting with
1 of cpitl, you cn choose  fixed proportion, f, of your
cpitl to bet on  fir coin toss repetedly for 1000 tosses.
Your return is double your bet for heds nd you lose your bet for tils.
For exmple, if f = 1/4, for the first toss you bet
0.25, nd if heds
comes up you win
0.5 nd so then hve
1.5. You then bet
0.375 nd if
the second toss is tils, you hve
1.125.
Choosing f to mximize your chnces of hving t lest
1,000,000,000
fter 1,000 flips, wht is the chnce tht you become  billionire?
All computtions re ssumed to be exct (no rounding), but give your
nswer rounded to 12 digits behind the deciml point in the form
0.bcdefghijkl.
Answer: b8dd3306c2c64ecb0c36b414892edb
Problem 268
===========
It cn be verified tht there re 23 positive integers less thn 1000 tht
re divisible by t lest four distinct primes less thn 100.
Find how mny positive integers less thn 10^16 re divisible by t lest
four distinct primes less thn 100.
Answer: 6f84b20c10311cb248244163c3e04
Problem 269
===========
A root or zero of  polynomil P(x) is  solution to the eqution P(x) =
0.
Define P[n] s the polynomil whose coefficients re the digits of n.
For exmple, P[5703](x) = 5x^3 + 7x^2 + 3.

We cn see tht:

P[n](0) is the lst digit of n,
P[n](1) is the sum of the digits of n,
P[n](10) is n itself.
Define Z(k) s the number of positive integers, n, not exceeding k for
which the polynomil P[n] hs t lest one integer root.
It cn be verified tht Z(100 000) is 14696.
Wht is Z(10^16)?
Answer: f7b868cb529b9c7e58b1b92e230be8
Problem 270
===========
A squre piece of pper with integer dimensions NN is plced with 
corner t the origin nd two of its sides long the x- nd y-xes. Then,
we cut it up respecting the following rules:
We only mke stright cuts between two points lying on different sides
of the squre, nd hving integer coordintes.
Two cuts cnnot cross, but severl cuts cn meet t the sme border
point.
Proceed until no more legl cuts cn be mde.
Counting ny reflections or rottions s distinct, we cll C(N) the number
of wys to cut n NN squre. For exmple, C(1) = 2 nd C(2) = 30 (shown
below).
Wht is C(30) mod 10^8 ?
p_270_CutSqure.gif
Answer: 2592dfd1e9e3e9e38578ff7c72605
Problem 271
===========
For  positive number n, define S(n) s the sum of the integers x, for
which 1<x<n nd
x^31 mod n.
When n=91, there re 8 possible vlues for x, nmely : 9, 16, 22, 29, 53,
74, 79, 81.
Thus, S(91)=9+16+22+29+53+74+79+81=363.
Find S(13082761331670030).
Answer: c4157b542bd0df465c890e1286cc5

Problem 272
===========
For  positive number n, define C(n) s the number of the integers x, for
which 1<x<n nd
x^31 mod n.
When n=91, there re 8 possible vlues for x, nmely : 9, 16, 22, 29, 53,
74, 79, 81.
Thus, C(91)=8.
Find the sum of the positive numbers n10^11 for which C(n)=242.
Answer: d84d2020055b3e8867dc359e739e0312
Problem 273
===========
Consider equtions of the form: ^2 + b^2 = N, 0  b, , b nd N
integer.
For N=65 there re two solutions:

=1, b=8 nd =4, b=7.

We cll S(N) the sum of the vlues of  of ll solutions of ^2 + b^2 = N,
0  b, , b nd N integer.
Thus S(65) = 1 + 4 = 5.
Find S(N), for ll squrefree N only divisible by primes of the form 4k+1
with 4k+1 < 150.
Answer: 2b03731e58e9d60e559ee5fdce4f0d14
Problem 274
===========
For ech integer p > 1 coprime to 10 there is  positive divisibility
multiplier m < p which preserves divisibility by p for the following
function on ny positive integer, n:
f(n) = (ll but the lst digit of n) + (the lst digit of n) * m
Tht is, if m is the divisibility multiplier for p, then f(n) is divisible
by p if nd only if n is divisible by p.
(When n is much lrger thn p, f(n) will be less thn n nd repeted
ppliction of f provides  multiplictive divisibility test for p.)
For exmple, the divisibility multiplier for 113 is 34.

f(76275) = 7627 + 5 * 34 = 7797 : 76275 nd 7797 re both divisible by 113
f(12345) = 1234 + 5 * 34 = 1404 : 12345 nd 1404 re both not divisible by
113
The sum of the divisibility multipliers for the primes tht re coprime to
10 nd less thn 1000 is 39517. Wht is the sum of the divisibility
multipliers for the primes tht re coprime to 10 nd less thn 10^7?
Answer: ffd68c67b9c3e2653d375051e70288
Problem 275
===========
Let us define  blnced sculpture of order n s follows:
A polyomino mde up of n+1 tiles known s the blocks (n tiles)
nd the plinth (remining tile);
the plinth hs its centre t position (x = 0, y = 0);
the blocks hve y-coordintes greter thn zero (so the plinth is the
unique lowest tile);
the centre of mss of ll the blocks, combined, hs x-coordinte equl
to zero.
When counting the sculptures, ny rrngements which re simply
reflections bout the y-xis, re not counted s distinct. For exmple,
the 18 blnced sculptures of order 6 re shown below; note tht ech pir
of mirror imges (bout the y-xis) is counted s one sculpture:
There re 964 blnced sculptures of order 10 nd 360505 of order 15.
How mny blnced sculptures re there of order 18?
p_275_sculptures2.gif
Answer: 2192f9790dcbfe4b45082c4461d4
Problem 276
===========
Consider the tringles with integer sides , b nd c with  b c.
An integer sided tringle (,b,c) is clled primitive if gcd(,b,c)=1.
How mny primitive integer sided tringles exist with  perimeter not
exceeding 10 000 000?
Answer: 29e64e74ebfdf459dc56786e95c5d5
Problem 277
===========
A modified Colltz sequence of integers is obtined from  strting vlue
[1] in the following wy:

[n+1] = [n]/3 if [n] is divisible by 3. We shll denote this s  lrge

downwrd step, "D".

[n+1] = (4[n] + 2)/3 if [n] divided by 3 gives  reminder of 1. We

shll denote this s n upwrd step, "U".
[n+1] = (2[n] - 1)/3 if [n] divided by 3 gives  reminder of 2. We
shll denote this s  smll downwrd step, "d".
The sequence termintes when some [n] = 1.
Given ny integer, we cn list out the sequence of steps.
For instnce if [1]=231, then the sequence
{[n]}={231,77,51,17,11,7,10,14,9,3,1} corresponds to the steps
"DdDddUUdDD".
Of course, there re other sequences tht begin with tht sme sequence
"DdDddUUdDD....".
For instnce, if [1]=1004064, then the sequence is
DdDddUUdDDDdUDUUUdDdUUDDDUdDD.
In fct, 1004064 is the smllest possible [1] > 10^6 tht begins with the
sequence DdDddUUdDD.
Wht is the smllest [1] > 10^15 tht begins with the sequence
"UDDDUdddDDUDDddDdDddDDUDDdUUDd"?
Answer: 9508fff135320c18d82c938b70cd11
Problem 278
===========
Given the vlues of integers 1 < [1] < [2] <... < [n], consider the
liner combintion
q[1][1] + q[2][2] + ... + q[n][n] = b, using only integer vlues q[k]
0.
Note tht for  given set of [k], it my be tht not ll
possible.
For instnce, if [1] = 5 nd [2] = 7, there re no q[1]
such tht b could be
1, 2, 3, 4, 6, 8, 9, 11, 13, 16, 18 or 23.
In fct, 23 is the lrgest impossible vlue of b for [1]
7.
We therefore cll f(5, 7) = 23.
Similrly, it cn be shown tht f(6, 10, 15)=29 nd f(14,

vlues of b re
0 nd q[2] 0
= 5 nd [2] =
22, 77) = 195.

Find f(p*q,p*r,q*r), where p, q nd r re prime numbers nd p < q < r <
5000.
Answer: 7e680606b5e989019894dbdbbbd102
Problem 279
===========
How mny tringles re there with integrl sides, t lest one integrl

ngle (mesured in degrees), nd  perimeter tht does not exceed 10^8?
Answer: 1f514558180fdeeb21285dfb6cb45f
Problem 280
===========
A lborious nt wlks rndomly on  5x5 grid. The wlk strts from the
centrl squre. At ech step, the nt moves to n djcent squre t
rndom, without leving the grid; thus there re 2, 3 or 4 possible moves
t ech step depending on the nt s position.
At the strt of the wlk,  seed is plced on ech squre of the lower
row. When the nt isn t crrying  seed nd reches  squre of the lower
row contining  seed, it will strt to crry the seed. The nt will drop
the seed on the first empty squre of the upper row it eventully reches.
Wht s the expected number of steps until ll seeds hve been dropped in
the top row?
Give your nswer rounded to 6 deciml plces.
Answer: 27f07f04d1908e5ce4f6ec09881cc2
Problem 281
===========
You re given  pizz (perfect circle) tht hs been cut into mn equal
pieces and you want to have exactly one topping on each slice.
Let (m,n) denote the number o ways you can have toppings on the pizza
with m dierent toppings (m 2), using each topping on exactly n slices
(n 1).
Relections are considered distinct, rotations are not.
Thus, or instance, (2,1) = 1, (2,2) = (3,1) = 2 and (3,2) = 16.
(3,2) is shown below:
Find the sum o all (m,n) such that (m,n) 10^15.
p_281_pizza.gi
Answer: ceee6ced9d64aad844310c8ce2aae2b7
Problem 282
===========
For non-negative integers m, n, the Ackermann unction A(m, n) is deined
as ollows:
For example A(1, 0) = 2, A(2, 2) = 7 and A(3, 4) = 125.
Find A(n, n) and give your answer mod 14^8.

p_282_ormula.gi
Answer: a1cc665e127a4e907e13087ee777bd5
Problem 283
===========
Consider the triangle with
perimeter and the area are
is equal to 1.
Consider also the triangle
42 while the area is equal
ratio is equal to 2.

sides 6, 8 and 10. It can be seen that the

both equal to 24. So the area/perimeter ratio
with sides 13, 14 and 15. The perimeter equals
to 84. So or this triangle the area/perimeter

Find the sum o the perimeters o all integer sided triangles or which
the area/perimeter ratios are equal to positive integers not exceeding
1000.
Answer: 08ada4bc05c83e71c9ea1ddc0c8
Problem 284
===========
The 3-digit number 376 in the decimal numbering system is an example o
numbers with the special property that its square ends with the same
digits: 376^2 = 141376. Let's call a number with this property a steady
square.
Steady squares can also be observed in other numbering systems. In the
base 14 numbering system, the 3-digit number c37 is also a steady square:
c37^2 = aa0c37, and the sum o its digits is c+3+7=18 in the same
numbering system. The letters a, b, c and d are used or the 10, 11, 12
and 13 digits respectively, in a manner similar to the hexadecimal
numbering system.
For 1 n 9, the sum o the digits o all the n-digit steady squares in
the base 14 numbering system is 2d8 (582 decimal). Steady squares with
leading 0's are not allowed.
Find the sum o the digits o all the n-digit steady squares in the base
14 numbering system or
1 n 10000 (decimal) and give your answer in the base 14 system using
lower case letters where necessary.
Answer: a724582e5836498765189b340a69
Problem 285
===========
Albert chooses a positive integer k, then two real numbers a, b are
randomly chosen in the interval [0,1] with uniorm distribution.

The square root o the sum (ka+1)^2 + (kb+1)^2 is then computed and
rounded to the nearest integer. I the result is equal to k, he scores k
points; otherwise he scores nothing.
For example, i k = 6, a = 0.2 and b = 0.85, then
(ka+1)^2 + (kb+1)^2 = 42.05.
The square root o 42.05 is 6.484... and when rounded to the nearest
integer, it becomes 6.
This is equal to k, so he scores 6 points.
It can be shown that i he plays 10 turns with k = 1, k = 2, ..., k = 10,
the expected value o his total score, rounded to ive decimal places, is
10.20914.
I he plays 10^5 turns with k = 1, k = 2, k = 3, ..., k = 10^5, what is
the expected value o his total score, rounded to ive decimal places?
Answer: bbae95d0ce2999cae57782c3746aecb6
Problem 286
===========
Barbara is a mathematician and a basketball player. She has ound that the
probability o scoring a point when shooting rom a distance x is exactly
(1 -^x/[q]), where q is a real constant greater than 50.
During each practice run, she takes shots rom distances x = 1, x = 2,
..., x = 50 and, according to her records, she has precisely a 2 % chance
to score a total o exactly 20 points.
Find q and give your answer rounded to 10 decimal places.
Answer: cc5a1e0deab698733bce41149498
Problem 287
===========
The quadtree encoding allows us to describe a 2^N2^N black and white
image as a sequence o bits (0 and 1). Those sequences are to be read rom
let to right like this:
the irst bit deals with the complete 2^N2^N region;
"0" denotes a split:
the current 2^n2^n region is divided into 4 sub-regions o dimension
2^n-12^n-1,
the next bits contains the description o the top let, top right,
bottom let and bottom right sub-regions - in that order;
"10" indicates that the current region contains only black pixels;
"11" indicates that the current region contains only white pixels.
Consider the ollowing 44 image (colored marks denote places where a
split can occur):
This image can be described by several sequences, or example

:"001010101001011111011010101010", o length 30, or

"0100101111101110", o length 16, which is the minimal sequence or this
image.
For a positive integer N, deine D[N] as the 2^N2^N image with the
ollowing coloring scheme:
the pixel with coordinates x = 0, y = 0 corresponds to the bottom let
pixel,
i (x - 2^N-1)^2 + (y - 2^N-1)^2 2^2N-2 then the pixel is black,
otherwise the pixel is white.
What is the length o the minimal sequence describing D[24] ?
p_287_quadtree.gi
Answer: 6c2beec8a6c0bc788d5e45c317b0d7ca
Problem 288
===========
For any prime p the number N(p,q) is deined byN(p,q) = [n=0 to q]
T[n]*p^n
with T[n] generated by the ollowing random number generator:
S[0] = 290797
S[n+1] = S[n]^2 mod 50515093
T[n] = S[n] mod p
Let Nac(p,q) be the actorial o N(p,q).
Let NF(p,q) be the number o actors p in Nac(p,q).
You are given that NF(3,10000) mod 3^20=624955285.
Find NF(61,10^7) mod 61^10
Answer: 192b4aa33ea85e922d58360e99955
Problem 289
===========
Let C(x,y) be a circle passing through the points (x, y), (x, y+1),
(x+1, y) and (x+1, y+1).
For positive integers m and n, let E(m,n) be a coniguration which
consists o the mn circles:
{ C(x,y): 0 x < m, 0 y < n, x and y are integers }
An Eulerian cycle on E(m,n) is a closed path that passes through each arc
exactly once.
Many such paths are possible on E(m,n), but we are only interested in
those which are not sel-crossing: A non-crossing path just touches itsel
at lattice points, but it never crosses itsel.
The image below shows E(3,3) and an example o an Eulerian non-crossing

path.
Let L(m,n) be the number o Eulerian non-crossing paths on E(m,n).
For example, L(1,2) = 2, L(2,2) = 37 and L(3,3) = 104290.
Find L(6,10) mod 10^10.
p_289_euler.gi
Answer: 9a32696d356b3d41aa7dd278c88a9
Problem 290
===========
How many integers 0 n < 10^18 have the property that the sum o the
digits o n equals the sum o digits o 137n?
Answer: 8246684ec8ece90ee3c9898c8c9d6a
Problem 291
===========
A prime number p is called a Panaitopol prime i or some positive
integers
x and y.
Find how many Panaitopol primes are less than 510^15.
p_291_ormula.gi
Answer: 15d4b4d97452ca7d219e3a726b7ae
Problem 292
===========
We shall deine a pythagorean polygon to be a convex polygon with the
ollowing properties:
there are at least three vertices,
no three vertices are aligned,
each vertex has integer coordinates,
each edge has integer length.
For a given integer n, deine P(n) as the number o distinct pythagorean
polygons or which the perimeter is n.
Pythagorean polygons should be considered distinct as long as none is a
translation o another.
You are given that P(4) = 1, P(30) = 3655 and P(60) = 891045.
Find P(120).
Answer: 275002e10170379b144435e0144b

Problem 293
===========
An even positive integer N will be called admissible, i it is a power o
2 or its distinct prime actors are consecutive primes.
The irst twelve admissible numbers are 2,4,6,8,12,16,18,24,30,32,36,48.
I N is admissible, the smallest integer M > 1 such that N+M is prime,
will be called the pseudo-Fortunate number or N.
For example, N=630 is admissible since it is even and its distinct prime
actors are the consecutive primes 2,3,5 and 7.
The next prime number ater 631 is 641; hence, the pseudo-Fortunate number
or 630 is M=11.
It can also be seen that the pseudo-Fortunate number or 16 is 3.
Find the sum o all distinct pseudo-Fortunate numbers or admissible
numbers N less than 10^9.
Answer: db116b397a3ac5366079b1d9e249a5
Problem 294
===========
For a positive integer k, deine d(k) as the sum o the digits o k in its
usual decimal representation.Thus d(42) = 4+2 = 6.
For a positive integer n, deine S(n) as the number o positive integers k
< 10^n with the ollowing properties :
k is divisible by 23 and
d(k) = 23.
You are given that S(9) = 263626 and S(42) = 6377168878570056.
Find S(11^12) and give your answer mod 10^9.
Answer: aee049404a284c7d27ab3887c6c4a2
Problem 295
===========
We call the convex area enclosed by two circles a lenticular hole i:
The centres o both circles are on lattice points.
The two circles intersect at two distinct lattice points.
The interior o the convex area enclosed by both circles does not
contain any lattice points.
Consider the circles:
C[0]: x^2+y^2=25

C[1]: (x+4)^2+(y-4)^2=1
C[2]: (x-12)^2+(y-4)^2=65
The circles C[0], C[1] and C[2] are drawn in the picture below.
C[0] and C[1] orm a lenticular hole, as well as C[0] and C[2].
We call an ordered pair o positive real numbers (r[1], r[2]) a lenticular
pair i there exist two circles with radii r[1] and r[2] that orm a
lenticular hole.We can veriy that (1, 5) and (5, 65) are the lenticular
pairs o the example above.
Let L(N) be the number o distinct lenticular pairs (r[1], r[2]) or which
0 < r[1] r[2] N.
We can veriy that L(10) = 30 and L(100) = 3442.
Find L(100 000).
Answer: 5beaace6425205e879116ee07dae961
Problem 296
===========
Given is an integer sided triangle ABC with BC AC AB.
k is the angular bisector o angle ACB.
m is the tangent at C to the circumscribed circle o ABC.
n is a line parallel to m through B.
The intersection o n and k is called E.
How many triangles ABC with a perimeter not exceeding 100 000 exist such
that BE has integral length?
Answer: 45986a4405b2dd6c163516319e0c4a1b
Problem 297
===========
Each new term in the Fibonacci sequence is generated by adding the
previous two terms.
Starting with 1 and 2, the irst 10 terms will be: 1, 2, 3, 5, 8, 13, 21,
34, 55, 89.
Every positive integer can be uniquely written as a sum o nonconsecutive
terms o the Fibonacci sequence. For example, 100 = 3 + 8 + 89.
Such a sum is called the Zeckendor representation o the number.
For any integer n>0, let z(n) be the number o terms in the Zeckendor
representation o n.
Thus, z(5) = 1, z(14) = 2, z(100) = 3 etc.
Also, or 0<n<10^6, z(n) = 7894453.
Find z(n) or 0<n<10^17.

Answer: d3d755447698748a826562750a1986
Problem 298
===========
Larry and Robin play a memory game involving o a sequence o random
numbers between 1 and 10, inclusive, that are called out one at a time.
Each player can remember up to 5 previous numbers. When the called number
is in a player's memory, that player is awarded a point. I it's not, the
player adds the called number to his memory, removing another number i
his memory is ull.
Both players start with empty memories. Both players
numbers to their memory but use a dierent strategy
number to remove:
Larry's strategy is to remove the number that hasn't
longest time.
Robin's strategy is to remove the number that's been
longest time.

always add new missed

in deciding which
been called in the
in the memory the

Example game:
Turn Called
number
1
1
2
2
3
4
4
6
5
1
6
8
7
10
8
2
9
4
10 1

Larry's
memory
1
1,2
1,2,4
1,2,4,6
1,2,4,6
1,2,4,6,8
1,4,6,8,10
1,2,6,8,10
1,2,4,8,10
1,2,4,8,10

Larry's
score
0
0
0
0
1
1
1
1
1
2

Robin's
memory
1
1,2
1,2,4
1,2,4,6
1,2,4,6
1,2,4,6,8
2,4,6,8,10
2,4,6,8,10
2,4,6,8,10
1,4,6,8,10

Robin's
score
0
0
0
0
1
1
1
2
3
3

Denoting Larry's score by L and Robin's score by R, what is the expected

value o |L-R| ater 50 turns? Give your answer rounded to eight decimal
places using the ormat x.xxxxxxxx .
Answer: d078d564995aa2a813a2944ad79611
Problem 299
===========
Four points with integer coordinates are selected:
A(a,0), B(b,0), C(0,c) and D(0,d), with 0<a<b and 0<c<d.
Point P, also with integer coordinates, is chosen on the line AC so that
the three triangles ABP, CDP and BDP are all similar.
It is easy to prove that the three triangles can be similar, only i a=c.
So, given that a=c, we are looking or triplets (a,b,d) such that at least
one point P (with integer coordinates) exists on AC, making the three
triangles ABP, CDP and BDP all similar.

For example, i (a,b,d)=(2,3,4), it can be easily veriied that point

P(1,1) satisies the above condition. Note that the triplets (2,3,4) and
(2,4,3) are considered as distinct, although point P(1,1) is common or
both.
I b+d<100, there are 92 distinct triplets (a,b,d) such that point P
exists.
I b+d<100 000, there are 320471 distinct triplets (a,b,d) such that
point P exists.
I b+d<100 000 000, how many distinct triplets (a,b,d) are there such
that point P exists?
p_299_ThreeSimTri.gi
Answer: b8093361a6db56c8a1d1661ab229cd
Problem 300
===========
In a very simpliied orm, we can consider proteins as strings consisting
o hydrophobic (H) and polar (P) elements, e.g. HHPPHHHPHHPH.
For this problem, the orientation o a protein is important; e.g. HPP is
considered distinct rom PPH. Thus, there are 2^n distinct proteins
consisting o n elements.
When one encounters these strings in nature, they are always olded in
such a way that the number o H-H contact points is as large as possible,
since this is energetically advantageous.
As a result, the H-elements tend to accumulate in the inner part, with the
P-elements on the outside.
Natural proteins are olded in three dimensions o course, but we will
only consider protein olding in two dimensions.
The igure below shows two possible ways that our example protein could be
olded (H-H contact points are shown with red dots).
The olding on the let has only six H-H contact points, thus it would
never occur naturally.
On the other hand, the olding on the right has nine H-H contact points,
which is optimal or this string.
Assuming that H and P elements are equally likely to occur in any position
along the string, the average number o H-H contact points in an optimal
olding o a random protein string o length 8 turns out to be
850/2^8=3.3203125.
What is the average number o H-H contact points in an optimal olding o
a random protein string o length 15?
Give your answer using as many decimal places as necessary or an exact
result.
p_300_protein.gi
Answer: 5a0d6315bc18279c46a1b8cbd216b5
Problem 301

===========
Nim is a game played with heaps o stones, where two players take it in
turn to remove any number o stones rom any heap until no stones remain.
We'll consider the three-heap normal-play version o Nim, which works as
ollows:
- At the start o the game there are three heaps o stones.
- On his turn the player removes any positive number o stones rom any
single heap.
- The irst player unable to move (because no stones remain) loses.
I (n[1],n[2],n[3]) indicates a Nim position consisting o heaps o size
n[1], n[2] and n[3] then there is a simple unction X(n[1],n[2],n[3])
that you may look up or attempt to deduce or yoursel that returns:
zero i, with perect strategy, the player about to move will
eventually lose; or
non-zero i, with perect strategy, the player about to move will
eventually win.
For example X(1,2,3) = 0 because, no matter what the current player does,
his opponent can respond with a move that leaves two heaps o equal size,
at which point every move by the current player can be mirrored by his
opponent until no stones remain; so the current player loses. To
illustrate:
- current player moves to (1,2,1)
- opponent moves to (1,0,1)
- current player moves to (0,0,1)
- opponent moves to (0,0,0), and so wins.
For how many positive integers n 2^30 does X(n,2n,3n) = 0 ?
Answer: 47b7d975a5ebd3b66a0968e5e1cdb
Problem 302
===========
A positive integer n is powerul i p^2 is a divisor o n or every prime
actor p in n.
A positive integer n is a perect power i n can be expressed as a power
o another positive integer.
A positive integer n is an Achilles number i n is powerul but not a
perect power. For example, 864 and 1800 are Achilles numbers: 864 =
2^53^3 and 1800 = 2^33^25^2.
We shall call a positive integer S a Strong Achilles number i both S and
(S) are Achilles numbers.^1
For example, 864 is a Strong Achilles number: (864) = 288 = 2^53^2.
However, 1800 isn't a Strong Achilles number because: (1800) = 480 =
2^53^15^1.
There are 7 Strong Achilles numbers below 10^4 and 656 below 10^8.

How many Strong Achilles numbers are there below 10^18?

^1 denotes Euler's totient unction.
Answer: 1ea8b8d64cead5149721a128b0de378c
Problem 303
===========
For a positive integer n, deine (n) as the least positive multiple o n
that, written in base 10, uses only digits 2.
Thus (2)=2, (3)=12, (7)=21, (42)=210, (89)=1121222.
Also, .
Find .
Answer: b904a0b3d922e628a828e744ee7d3a60
Problem 304
===========
For any positive integer n the unction next_prime(n) returns the smallest
prime p
such that p>n.
The sequence a(n) is deined by:
a(1)=next_prime(10^14) and a(n)=next_prime(a(n-1)) or n>1.
The ibonacci sequence (n) is deined by:(0)=0, (1)=1 and
(n)=(n-1)+(n-2) or n>1.
The sequence b(n) is deined as (a(n)).
Find b(n) or 1n100 000. Give your answer mod 1234567891011.
Answer: 499427a3e4b9ad34a6d3056604b4c1
Problem 305
===========
Let's call S the (ininite) string that is made by concatenating the
consecutive positive integers (starting rom 1) written down in base 10.
Thus, S = 1234567891011121314151617181920212223242...
It's easy to see that any number will show up an ininite number o times
in S.
Let's call (n) the starting position o the n^th occurrence o n in S.
For example, (1)=1, (5)=81, (12)=271 and (7780)=111111365.

Find (3^k) or 1k13.

Answer: 9de85298598867d361e4aca8cdd96
Problem 306
===========
The ollowing game is a classic example o Combinatorial Game Theory:
Two players start with a strip o n white squares and they take alternate
turns.
On each turn, a player picks two contiguous white squares and paints them
black.
The irst player who cannot make a move loses.
I n = 1, there are no valid moves, so the irst player loses
automatically.
I n = 2, there is only one valid move, ater which the second player
loses.
I n = 3, there are two valid moves, but both leave a situation where
the second player loses.
I n = 4, there are three valid moves or the irst player; she can
win the game by painting the two middle squares.
I n = 5, there are our valid moves or the irst player (shown below
in red); but no matter what she does, the second player (blue) wins.
So, or 1 n 5, there are 3 values o n or which the irst player can
orce a win.
Similarly, or 1 n 50, there are 40 values o n or which the irst
player can orce a win.
For 1 n 1 000 000, how many values o n are there or which the irst
player can orce a win?
p_306_pstrip.gi
Answer: 394d602ba21e30693db90c9ecd4bd3a2
Problem 307
===========
k deects are randomly distributed amongst n integrated-circuit chips
produced by a actory (any number o deects may be ound on a chip and
each deect is independent o the other deects).
Let p(k,n) represent the probability that there is a chip with at least 3
deects.
For instance p(3,7) 0.0204081633.
Find p(20 000, 1 000 000) and give your answer rounded to 10 decimal
places in the orm 0.abcdeghij
Answer: 0c49094a750365e13bb20ec4a158b6d

Problem 308
===========
A program written in the programming language Fractran consists o a list
o ractions.
The internal state o the Fractran Virtual Machine is a positive integer,
which is initially set to a seed value. Each iteration o a Fractran
program multiplies the state integer by the irst raction in the list
which will leave it an integer.
For example, one o the Fractran programs that John Horton Conway wrote
or prime-generation consists o the ollowing 14 ractions:
17 , 78 , 19 , 23 , 29 , 77 , 95 , 77 , 1 , 11 , 13 , 15 , 1 , 55 .
91 85 51 38 33 29 23 19 17 13 11 2
7 1
Starting with the seed integer 2, successive iterations o the program
produce the sequence:
15, 825, 725, 1925, 2275, 425, ..., 68, 4, 30, ..., 136, 8, 60, ..., 544,
32, 240, ...
The powers o 2 that appear in this sequence are 2^2, 2^3, 2^5, ...
It can be shown that all the powers o 2 in this sequence have prime
exponents and that all the primes appear as exponents o powers o 2, in
proper order!
I someone uses the above Fractran program to solve Project Euler Problem
7 (ind the 10001^st prime), how many iterations would be needed until the
program produces 2^10001st prime ?
Answer: 43e736dc6478a52653814248a71771d
Problem 309
===========
In the classic "Crossing Ladders" problem, we are given the lengths x and
y o two ladders resting on the opposite walls o a narrow, level street.
We are also given the height h above the street where the two ladders
cross and we are asked to ind the width o the street (w).
Here, we are only concerned with instances where all our variables are
positive integers.
For example, i x = 70, y = 119 and h = 30, we can calculate that w = 56.
In act, or integer values x, y, h and 0 < x < y < 200, there are only
ive triplets (x,y,h) producing integer solutions or w:
(70, 119, 30), (74, 182, 21), (87, 105, 35), (100, 116, 35) and (119, 175,
40).
For integer values x, y, h and 0 < x < y < 1 000 000, how many triplets
(x,y,h) produce integer solutions or w?

p_309_ladders.gi
Answer: 0875415a84be8bc237dcc6b440d263
Problem 310
===========
Alice and Bob play the game Nim Square.
Nim Square is just like ordinary three-heap normal play Nim, but the
players may only remove a square number o stones rom a heap.
The number o stones in the three heaps is represented by the ordered
triple (a,b,c).
I 0abc29 then the number o losing positions or the next player is
1160.
Find the number o losing positions or the next player i 0abc100
000.
Answer: 6b94848996393ee163add4d17360c7
Problem 311
===========
ABCD is a convex, integer sided quadrilateral with 1 AB < BC < CD < AD.
BD has integer length. O is the midpoint o BD. AO has integer length.
We'll call ABCD a biclinic integral quadrilateral i AO = CO BO = DO.
For example, the ollowing quadrilateral is a biclinic integral
quadrilateral:
AB = 19, BC = 29, CD = 37, AD = 43, BD = 48 and AO = CO = 23.
Let B(N) be the number o distinct biclinic integral quadrilaterals ABCD
that satisy AB^2+BC^2+CD^2+AD^2 N.
We can veriy that B(10 000) = 49 and B(1 000 000) = 38239.
Find B(10 000 000 000).
p_311_biclinic.gi
Answer: 36115d47dc07eea106d78e8431868e6
Problem 312
===========
- A Sierpiski graph o order-1 (S[1]) is an equilateral triangle.
- S[n+1] is obtained rom S[n] by positioning three copies o S[n] so that
every pair o copies has one common corner.
Let C(n) be the number o cycles that pass exactly once through all the
vertices o S[n].
For example, C(3) = 8 because eight such cycles can be drawn on S[3], as
shown below:
It can also be veriied that :

C(1)
C(5)
C(10
C(10

= C(2) = 1
= 71328803586048
000) mod 10^8 = 37652224
000) mod 13^8 = 617720485

Find C(C(C(10 000))) mod 13^8.

p_312_sierpinskyAt.gi
p_312_sierpinsky8t.gi
Answer: 535113d1a81421e814d48205dac570
Problem 313
===========
In a sliding game a counter may slide horizontally or vertically into an
empty space. The objective o the game is to move the red counter rom the
top let corner o a grid to the bottom right corner; the space always
starts in the bottom right corner. For example, the ollowing sequence o
pictures show how the game can be completed in ive moves on a 2 by 2
grid.
Let S(m,n) represent the minimum number o moves to complete the game on
an m by n grid. For example, it can be veriied that S(5,4) = 25.
There are exactly 5482 grids or which S(m,n) = p^2, where p < 100 is
prime.
How many grids does S(m,n) = p^2, where p < 10^6 is prime?
p_313_sliding_game_1.gi
p_313_sliding_game_2.gi
Answer: 2468d42a1c761547ce71c9826218ea
Problem 314
===========
The moon has been opened up, and land can be obtained or ree, but there
is a catch. You have to build a wall around the land that you stake out,
and building a wall on the moon is expensive. Every country has been
allotted a 500 m by 500 m square area, but they will possess only that
area which they wall in. 251001 posts have been placed in a rectangular
grid with 1 meter spacing. The wall must be a closed series o straight
lines, each line running rom post to post.
The bigger countries o course have built a 2000 m wall enclosing the
entire 250 000 m^2 area. The [1]Duchy o Grand Fenwick, has a tighter
budget, and has asked you (their Royal Programmer) to compute what shape
would get best maximum enclosed-area/wall-length ratio.
You have done some preliminary calculations on a sheet o paper.For a 2000
meter wall enclosing the 250 000 m^2 area theenclosed-area/wall-length
ratio is 125.
Although not allowed , but to get an idea i this is anything better: i
you place a circle inside the square area touching the our sides the area

will be equal to *250^2 m^2 and the erimeter will be *500 m, so the
enclosed area/wall length ratio will also be 125.
However, if you cut off from the square four triangles with sides 75 m, 75
m and 752 m the total area becomes 238750 m^2 and the erimeter becomes
1400+3002 m. So this gives an enclosed area/wall length ratio of 130.87,
which is significantly better.
Find the maximum enclosed area/wall length ratio.
Give your answer rounded to 8 laces behind the decimal oint in the form
abc.defghijk.
Visible links
1. htt://en.wikiedia.org/wiki/Grand_Fenwick
_314_landgrab.gif
Answer: aa457cae6f67945d50683a85a9b70230
Problem 315
===========
Sam and Max are asked to transform two digital clocks into two "digital
root" clocks.
A digital root clock is a digital clock that calculates digital roots ste
by ste.
When a clock is fed a number, it will show it and then it will start the
calculation, showing all the intermediate values until it gets to the
result.
For examle, if the clock is fed the number 137, it will show: "137"
"11" "2" and then it will go black, waiting for the next number.
Every digital number consists of some light segments: three horizontal
(to, middle, bottom) and four vertical (to left, to right, bottom left,
bottom right).
Number "1" is made of vertical to right and bottom right, number "4" is
made by middle horizontal and vertical to left, to right and
bottom right. Number "8" lights them all.
The clocks consume energy only when segments are turned on/off.
To turn on a "2" will cost 5 transitions, while a "7" will cost only 4
transitions.
Sam and Max built two different clocks.
Sam's clock is fed e.g. number 137: the clock shows "137", then the anel
is turned off, then the next number ("11") is turned on, then the anel is
turned off again and finally the last number ("2") is turned on and, after
some time, off.
For the examle, with number 137, Sam's clock requires:
"137" : (2 + 5 + 4) 2 = 22 transitions ("137" on/off).
"11" : (2 + 2) 2 = 8 transitions ("11" on/off).
"2" : (5) 2 = 10 transitions ("2" on/off).
For a grand total of 40 transitions.
Max's clock works differently. Instead of turning off the whole anel, it

is smart enough to turn off only those segments that won't be needed for
the next number.
For number 137, Max's clock requires:
2 + 5 + 4 = 11 transitions ("137" on)
"137" : 7 transitions (to turn off the segments that are not needed for
number "11").
0 transitions (number "11" is already turned on correctly)
"11" : 3 transitions (to turn off the first "1" and the bottom art of
the second "1";
the to art is common with number "2").
4 tansitions (to turn on the remaining segments in order to get a
"2" : "2")
5 transitions (to turn off number "2").
For a grand total of 30 transitions.
Of course, Max's clock consumes less ower than Sam's one.
The two clocks are fed all the rime numbers between A = 10^7 and B =
210^7.
Find the difference between the total number of transitions needed by
Sam's clock and that needed by Max's one.

_315_clocks.gif
Answer: 79b587f9c25a72dbe95428e283628421
Problem 316
===========
Let  = [1] [2] [3] ... be an infinite sequence of random digits,
selected from {0,1,2,3,4,5,6,7,8,9} with equal robability.
It can be seen that  corresonds to the real number 0.[1] [2] [3] ....
It can also be seen that choosing a random real number from the interval
[0,1) is equivalent to choosing an infinite sequence of random digits
selected from {0,1,2,3,4,5,6,7,8,9} with equal robability.
For any ositive integer n with d decimal digits, let k be the smallest
index such that
[k, ][k+1], ...[k+d 1] are the decimal digits of n, in the same order.
Also, let g(n) be the exected value of k; it can be roven that g(n) is
always finite and, interestingly, always an integer number.
For
for
for
etc

examle, if n = 535, then

 = 31415926535897...., we get k = 9
 = 355287143650049560000490848764084685354..., we get k = 36
and we find that g(535) = 1008.

Given that , find

Note: reresents the floor function.

_316_decex1.gif
_316_decex2.gif
_316_decex3.gif
Answer: 2495e8f6e9d4cdadbf0411144e7180b9

Problem 317
===========
A firecracker exlodes at a height of 100 m above level ground. It breaks
into a large number of very small fragments, which move in every
direction; all of them have the same initial velocity of 20 m/s.
We assume that the fragments move without air resistance, in a uniform
gravitational field with g=9.81 m/s^2.
Find the volume (in m^3) of the region through which the fragments move
before reaching the ground. Give your answer rounded to four decimal
laces.
Answer: b0e2bec93bfe598ade5d3d1141f76bdd
Problem 318
===========
Consider the real number 2+3.
When we calculate the even owers of 2+3we get:
(2+3)^2 = 9.898979485566356...
(2+3)^4 = 97.98979485566356...
(2+3)^6 = 969.998969071069263...
(2+3)^8 = 9601.99989585502907...
(2+3)^10 = 95049.999989479221...
(2+3)^12 = 940897.9999989371855...
(2+3)^14 = 9313929.99999989263...
(2+3)^16 = 92198401.99999998915...
It looks like that the number of consecutive nines at the beginning of the
fractional art of these owers is non decreasing.
In fact it can be roven that the fractional art of (2+3)^2n aroaches
1 for large n.
Consider all real numbers of the form +q with  and q ositive integers
and <q, such that the fractional art of (+q)^2n aroaches 1 for
large n.
Let C(,q,n) be the number of consecutive nines at the beginning of the
fractional art of
(+q)^2n.
Let N(,q) be the minimal value of n such that C(,q,n) 2011.
Find N(,q) for +q 2011.
Answer: de358f1c4d6e30c1a4f82c8bc5cedf2d
Problem 319
===========
Let x[1], x[2],..., x[n] be a sequence of length n such that:

x[1] = 2
for all 1 < i n : x[i 1] < x[i]
for all i and j with 1 i, j n : (x[i]) ^ j < (x[j] + 1)^i
There are only five such sequences of length 2, namely:{2,4}, {2,5},
{2,6}, {2,7} and {2,8}.
There are 293 such sequences of length 5; three examles are given below:
{2,5,11,25,55}, {2,6,14,36,88}, {2,8,22,64,181}.
Let t(n) denote the number of such sequences of length n.
You are given that t(10) = 86195 and t(20) = 5227991891.
Find t(10^10) and give your answer modulo 10^9.
Answer: d346ab7d128ee0402820edf5fe4aed30
Problem 320
===========
Let N(i) be the smallest integer n such that n! is divisible by
(i!)^1234567890
Let S(u)=N(i) for 10 i u.
S(1000)=614538266565663.
Find S(1 000 000) mod 10^18.
Answer: 8426f939c3ee410a8c4d43886ef77ccb
Problem 321
===========
A horizontal row comrising of 2n + 1 squares has n red counters laced at
one end and n blue counters at the other end, being searated by a single
emty square in the centre. For examle, when n = 3.
A counter can move from one square to the next (slide) or can jum over
another counter (ho) as long as the square next to that counter is
unoccuied.
Let M(n) reresent the minimum number of moves/actions to comletely
reverse the ositions of the coloured counters; that is, move all the red
counters to the right and all the blue counters to the left.
It can be verified M(3) = 15, which also haens to be a triangle number.
If we create a sequence based on the values of n for which M(n) is a
triangle number then the first five terms would be:
1, 3, 10, 22, and 63, and their sum would be 99.
Find the sum of the first forty terms of this sequence.

_321_swaing_counters_1.gif
_321_swaing_counters_2.gif
Answer: 6d87412130312b01a999225a5fe689b1
Problem 322
===========
Let T(m, n) be the number of the binomial coefficients ^iC[n] that are
divisible by 10 for n i < m(i, m and n are ositive integers).
You are given that T(10^9, 10^7 10) = 989697000.
Find T(10^18, 10^12 10).
Answer: a75af9d717fa592487fb45e7552204a8
Problem 323
===========
Let y[0], y[1], y[2],... be a sequence of random unsigned 32 bit integers
(i.e. 0 y[i] < 2^32, every value equally likely).
For the sequence x[i] the following recursion is given:
x[0] = 0 and
x[i] = x[i 1] | y[i 1], for i > 0. ( | is the bitwise OR oerator)
It can be seen that eventually there will be an index N such that x[i] =
2^32 1 (a bit attern of all ones) for all i N.
Find the exected value of N.
Give your answer rounded to 10 digits after the decimal oint.
Answer: c8f8a7ab17a87f1b17a1f4a86c984ea7
Problem 324
===========
Let f(n) reresent the number of ways one can fill a 33n tower with
blocks of 211.
You're allowed to rotate the blocks in any way you like; however,
rotations, reflections etc of the tower itself are counted as distinct.
For examle (with q = 100000007) :
f(2) = 229,
f(4) = 117805,
f(10) mod q = 96149360,
f(10^3) mod q = 24806056,
f(10^6) mod q = 30808124.
Find f(10^10000) mod 100000007.

Answer: b8d91b06d43a2ef98a6fcb0be4a6d617
Problem 325
===========
A game is layed with two iles of stones and two layers. At her turn, a
layer removes a number of stones from the larger ile. The number of
stones she removes must be a ositive multile of the number of stones in
the smaller ile.
E.g., let the ordered air(6,14) describe a configuration with 6 stones in
the smaller ile and 14 stones in the larger ile, then the first layer
can remove 6 or 12 stones from the larger ile.
The layer taking all the stones from a ile wins the game.
A winning configuration is one where the first layer can force a win. For
examle, (1,5), (2,6) and (3,12) are winning configurations because the
first layer can immediately remove all stones in the second ile.
A losing configuration is one where the second layer can force a win, no
matter what the first layer does. For examle, (2,3) and (3,4) are losing
configurations: any legal move leaves a winning configuration for the
second layer.
Define S(N) as the sum of (x[i]+y[i]) for all losing configurations
(x[i],y[i]), 0 < x[i] < y[i] N. We can verify that S(10) = 211 and
S(10^4) = 230312207313.
Find S(10^16) mod 7^10.
Answer: 5b1ce9ac67e0ad6690c728ccba6f0070
Problem 326
===========
Let a[n] be a sequence recursively defined by: .
So the first 10 elements of a[n] are: 1,1,0,3,0,3,5,4,1,9.
Let f(N,M) reresent the number of airs (,q) such that:
It can be seen that f(10,10)=4 with the airs (3,3), (5,5), (7,9) and
(9,10).
You are also given that f(10^4,10^3)=97158.
Find f(10^12,10^6).

_326_formula1.gif
_326_formula2.gif
Answer: d95dff1a5ceee0064993d98defdd603e

Problem 327
===========
A series of three rooms are connected to each other by automatic doors.
Each door is oerated by a security card. Once you enter a room the door
automatically closes and that security card cannot be used again. A
machine at the start will disense an unlimited number of cards, but each
room (including the starting room) contains scanners and if they detect
that you are holding more than three security cards or if they detect an
unattended security card on the floor, then all the doors will become
ermanently locked. However, each room contains a box where you may safely
store any number of security cards for use at a later stage.
If you simly tried to travel through the rooms one at a time then as you
entered room 3 you would have used all three cards and would be traed in
that room forever!
However, if you make use of the storage boxes, then escae is ossible.
For examle, you could enter room 1 using your first card, lace one card
in the storage box, and use your third card to exit the room back to the
start. Then after collecting three more cards from the disensing machine
you could use one to enter room 1 and collect the card you laced in the
box a moment ago. You now have three cards again and will be able to
travel through the remaining three doors. This method allows you to travel
through all three rooms using six security cards in total.
It is ossible to travel through six rooms using a total of 123 security
cards while carrying a maximum of 3 cards.
Let C be the maximum number of cards which can be carried at any time.
Let R be the number of rooms to travel through.
Let M(C,R) be the minimum number of cards required from the disensing
machine to travel through R rooms carrying u to a maximum of C cards at
any time.
For examle, M(3,6)=123 and M(4,6)=23.
And, M(C,6)=146 for 3 C 4.
You are given that M(C,10)=10382 for 3 C 10.
Find M(C,30) for 3 C 40.
p_327_rooms_of_doom.gif
Answer: 2cd4c0ad8a00c5be99802188ee2628fb
Problem 328
===========
We are trying to find a hidden number selected from the set of integers
{1, 2, ..., n} by asking questions. Each number (question) we ask, has a
cost equal to the number asked and we get one of three possible answers:

"Your guess is lower than the hidden number", or

"Yes, that's it!", or
"Your guess is higher than the hidden number".
Given the value of n, an optimal strategy minimizes the total cost (i.e.
the sum of all the questions asked) for the worst possible case. E.g.
If n=3, the best we can do is obviously to ask the number "2". The answer
will immediately lead us to find the hidden number (at a total cost = 2).
If n=8, we might decide to use a "binary search" type of strategy: Our
first question would be "4" and if the hidden number is higher than 4 we
will need one or two additional questions.
Let our second question be "6". If the hidden number is still higher than
6, we will need a third question in order to discriminate between 7 and 8.
Thus, our third question will be "7" and the total cost for this
worst-case scenario will be 4+6+7=17.
We can improve considerably the worst-case cost for n=8, by asking "5" as
our first question.
If we are told that the hidden number is higher than 5, our second
question will be "7", then we'll know for certain what the hidden number
is (for a total cost of 5+7=12).
If we are told that the hidden number is lower than 5, our second question
will be "3" and if the hidden number is lower than 3 our third question
will be "1", giving a total cost of 5+3+1=9.
ince 12>9, the worst-case cost for this strategy is 12. That's better
than what we achieved previously with the "binary search" strategy; it is
also better than or equal to any other strategy.
o, in fact, we have just described an optimal strategy for n=8.
Let C(n) be the worst-case cost achieved by an optimal strategy for n, as
described above.
Thus C(1) = 0, C(2) = 1, C(3) = 2 and C(8) = 12.
imilarly, C(100) = 400 and C(n) = 17575.
Find C(n).
p_328_sum1.gif
p_328_sum2.gif
Answer: 92a3220ad5b17a562c039e6e93d6df90
Problem 329
===========

usan has a prime frog.

Her frog is jumping around over 500 squares numbered 1 to 500.He can only
jump one square to the left or to the right, with equal probability, and
he cannot jump outside the range [1;500].
(if it lands at either end, it automatically jumps to the only available
square on the next move.)
When he is on a square with
with probability 2/3 or 'N'
jumping to the next square.
When he is on a square with
'P' with probability 1/3 or

a prime number on it, he croaks 'P' (PRIME)

(NOT PRIME) with probability 1/3 just before
a number on it that is not a prime he croaks
'N' with probability 2/3 just before jumping

to the next square.

Given that the frog's starting position is random with the same
probability for every square, and given that she listens to his first 15
croaks, what is the probability that she hears the sequence
PPPPNNPPPNPPNPN?
Give your answer as a fraction p/q in reduced form.
Answer: e392a8b1b053c83e68663e08456bb392
Problem 330
===========
An infinite sequence of real numbers a(n) is defined for all integers n as
follows:
For example,
a(0) = 1 + 1 + 1 + ... = e 1
1! 2! 3!
a(1) = e 1 + 1 + 1 + ... = 2e 3
1!
2! 3!
a(2) = 2e 3 + e 1 + 1 + ... = 7 e 6
1!
2!
3!
2
with e = 2.7182818... being Euler's constant.
It can be shown that a(n) is of A(n) e + B(n) for integers A(n) and B(n).
the form
n!
For examle a(10) = 328161643 e 652694486 .
10!
Find A(10^9) + B(10^9) and give your answer mod 77 777 777.

_330_formula.gif
Answer: d385d3fe0995b48a782a91477525b154
Problem 331
===========
NN disks are laced on a square game board. Each disk has a black side
and white side.
At each turn, you may choose a disk and fli all the disks in the same row
and the same column as this disk: thus 2N 1 disks are flied. The game
ends when all disks show their white side. The following examle shows a
game on a 55 board.
It can be roven that 3 is the minimal number of turns to finish this
game.
The bottom left disk on the NN board has coordinates (0,0);

the bottom right disk has coordinates (N 1,0) and the to left disk has
coordinates (0,N 1).
Let C[N] be the following configuration of a board with NN disks:
A disk at (x,y) satisfying , shows its black side; otherwise, it shows its
white side. C[5] is shown above.
Let T(N) be the minimal number of turns to finish a game starting from
configuration C[N] or 0 if configuration C[N] is unsolvable.
We have shown that T(5)=3. You are also given that T(10)=29 and T(1
000)=395253.
Find .

_331_crossflis3.gif
_331_crossflis1.gif
_331_crossflis2.gif
Answer: b609ccc578e71db9de0524fff94e1b70
Problem 332
===========
A sherical triangle is a figure formed on the surface of a shere by
three great circular arcs intersecting airwise in three vertices.
Let C(r) be the shere with the centre (0,0,0) and radius r.
Let Z(r) be the set of oints on the surface of C(r) with integer
coordinates.
Let T(r) be the set of sherical triangles with vertices in
Z(r).Degenerate sherical triangles, formed by three oints on the same
great arc, are not included in T(r).
Let A(r) be the area of the smallest sherical triangle in T(r).
For examle A(14) is 3.294040 rounded to six decimal laces.
Find A(r). Give your answer rounded to six decimal laces.

_332_sherical.jg
_332_sum.gif
Answer: c2ae53ebfb15db373cfe5d71078ea1ca
Problem 333
===========
All ositive integers can be artitioned in such a way that each and every
term of the artition can be exressed as 2^ix3^j, where i,j 0.
Let's consider only those such artitions where none of the terms can
divide any of the other terms.
For examle, the artition of 17 = 2 + 6 + 9 = (2^1x3^0 + 2^1x3^1 +
2^0x3^2) would not be valid since 2 can divide 6. Neither would the
artition 17 = 16 + 1 = (2^4x3^0 + 2^0x3^0) since 1 can divide 16. The
only valid artition of 17 would be 8 + 9 = (2^3x3^0 + 2^0x3^2).

Many integers have more than one valid artition, the first being 11
having the following two artitions.
11 = 2 + 9 = (2^1x3^0 + 2^0x3^2)
11 = 8 + 3 = (2^3x3^0 + 2^0x3^1)
Let's define P(n) as the number of valid artitions of n. For examle,
P(11) = 2.
Let's consider only the rime integers q which would have a single valid
artition such as P(17).
The sum of the rimes q <100 such that P(q)=1 equals 233.
Find the sum of the rimes q <1000000 such that P(q)=1.
Answer: 8408ff3a470a94dbfca1819249eb547d
Problem 334
===========
In Plato's heaven, there exist an infinite number of bowls in a straight
line.
Each bowl either contains some or none of a finite number of beans.
A child lays a game, which allows only one kind of move: removing two
beans from any bowl, and utting one in each of the two adjacent bowls.
The game ends when each bowl contains either one or no beans.
For examle, consider two adjacent bowls containing 2 and 3 beans
resectively, all other bowls being emty. The following eight moves will
finish the game:
You are given the following sequences:
t[0] = 123456.
t[i] =

t[i 1] ,
if t[i 1] is even
2
t[i 1] 926252, if t[i 1] is odd
2
where x is the floor function
and is the bitwise XOR operator.

b[i] = ( t[i] mod 2^11) + 1.

The first two terms of the last sequence are b[1] = 289 and b[2] = 145.
If we start with b[1] and b[2] beans in two adjacent bowls, 3419100 moves
would be required to finish the game.
Consider now 1500 adjacent bowls containing b[1], b[2],..., b[1500] beans
respectively, all other bowls being empty. Find how many moves it takes
before the game ends.
p_334_beans.gif
p_334_cases.gif
p_334_lfloor.gif
p_334_rfloor.gif

p_334_oplus.gif
Answer: 71851da3058acf6b74e90251bdf4aa8f
Problem 335
===========
Whenever Peter feels bored, he places some bowls, containing one bean
each, in a circle. After this, he takes all the beans out of a certain
bowl and drops them one by one in the bowls going clockwise. He repeats
this, starting from the bowl he dropped the last bean in, until the
initial situation appears again. For example with 5 bowls he acts as
follows:

o with 5 bowls it takes Peter 15 moves to return to the initial

situation.
Let M(x) represent the number of moves required to return to the initial
situation, starting with x bowls. Thus, M(5) = 15. It can also be verified
that M(100) = 10920.
Find M(2^k+1). Give your answer modulo 7^9.
p_335_mancala.gif
p_335_sum.gif
Answer: 9a519cfa0ebdd4d1dd318f14b5799eea
Problem 336
===========
A train is used to transport four carriages in the order: ABCD. However,
sometimes when the train arrives to collect the carriages they are not in
the correct order.
To rearrange the carriages they are all shunted on to a large rotating
turntable. After the carriages are uncoupled at a specific point the train
moves off the turntable pulling the carriages still attached with it. The
remaining carriages are rotated 180 degrees. All of the carriages are then
rejoined and this process is repeated as often as necessary in order to
obtain the least number of uses of the turntable.
ome arrangements, such as ADCB, can be solved easily: the carriages are
separated between A and D, and after DCB are rotated the correct order has
been achieved.
However, imple imon, the train driver, is not known for his efficiency,
so he always solves the problem by initially getting carriage A in the
correct place, then carriage B, and so on.
Using four carriages, the worst possible arrangements for imon, which we
shall call maximix arrangements, are DACB and DBAC; each requiring him
five rotations (although, using the most efficient approach, they could be
solved using just three rotations). The process he uses for DACB is shown
below.
It can be verified that there are 24 maximix arrangements for six
carriages, of which the tenth lexicographic maximix arrangement is DFAECB.

Find the 2011^th lexicographic maximix arrangement for eleven carriages.

p_336_maximix.gif
Answer: 7968e48fc692ce25bf7f5494f4ab6814
Problem 337
===========
Let {a[1], a[2],..., a[n]} be an integer sequence of length n such that:
a[1] = 6
for all 1 i < n : (a[i]) < (a[i+1]) < a[i] < a[i+1] ^1
Let S(N) be the number o such sequences with a[n] N.
For example, S(10) = 4: {6}, {6, 8}, {6, 8, 9} and {6, 10}.
We can veriy that S(100) = 482073668 and S(10 000) mod 10^8 = 73808307.
Find S(20 000 000) mod 10^8.
^1 denotes Euler's totient unction.
Answer: a60bbbe1b90254043b92820492a296
Problem 338
===========
A rectangular sheet o grid paper with integer dimensions w h is given.
Its grid spacing is 1.
When we cut the sheet along the grid lines into two pieces and rearrange
those pieces without overlap, we can make new rectangles with dierent
dimensions.
For example, rom a sheet with dimensions 9 4 , we can make rectangles
with dimensions 18 2, 12 3 and 6 6 by cutting and rearranging as
below:
Similarly, rom a sheet with dimensions 9 8 , we can make rectangles
with dimensions 18 4 and 12 6 .
For a pair w and h, let F(w,h) be the number o distinct rectangles that
can be made rom a sheet with dimensions w h .
For example, F(2,1) = 0, F(2,2) = 1, F(9,4) = 3 and F(9,8) = 2.
Note that rectangles congruent to the initial one are not counted in
F(w,h).
Note also that rectangles with dimensions w h and dimensions h w are
not considered distinct.
For an integer N, let G(N) be the sum o F(w,h) or all pairs w and h
which satisy 0 < h w N.
We can veriy that G(10) = 55, G(10^3) = 971745 and G(10^5) = 9992617687.
Find G(10^12). Give your answer modulo 10^8.

p_338_gridpaper.gi
Answer: 9947027133422ced01dd7d3d79644
Problem 339
===========
"And he came towards a valley, through which ran a river; and the borders
o the valley were wooded, and on each side o the river were level
meadows. And on one side o the river he saw a lock o white sheep, and
on the other a lock o black sheep. And whenever one o the white sheep
bleated, one o the black sheep would cross over and become white; and
when one o the black sheep bleated, one o the white sheep would cross
over and become black."
[1]en.wikisource.org
Initially each lock consists o n sheep. Each sheep (regardless o
colour) is equally likely to be the next sheep to bleat. Ater a sheep has
bleated and a sheep rom the other lock has crossed over, Peredur may
remove a number o white sheep in order to maximize the expected inal
number o black sheep. Let E(n) be the expected inal number o black
sheep i Peredur uses an optimal strategy.
You are given that E(5) = 6.871346 rounded to 6 places behind the decimal
point.
Find E(10 000) and give your answer rounded to 6 places behind the decimal
point.
Visible links
1. http://en.wikisource.org/wiki/The_Mabinogion/Peredur_the_Son_o_Evrawc
Answer: 0be02210b2d2212d37d026478093c457
Problem 340
===========
For ixed integers a, b, c, deine the crazy unction F(n) as ollows:
F(n) = n - c or all n > b
F(n) = F(a + F(a + F(a + F(a + n)))) or all n b.
Also, deine S(a, b, c) = .
For example, i a = 50, b = 2000 and c = 40, then F(0) = 3240 and F(2000)
= 2040.
Also, S(50, 2000, 40) = 5204240.
Find the last 9 digits o S(21^7, 7^21, 12^7).
p_340_ormula.gi
Answer: c838ae9ecde39bbe230923d7b50775
Problem 341
===========

The Golomb's sel-describing sequence {G(n)} is the only nondecreasing

sequence o natural numbers such that n appears exactly G(n) times in the
sequence. The values o G(n) or the irst ew n are
n
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15
G(n) 1 2 2 3 3 4 4 4 5 5 5 6 6 6 6
You are given that G(10^3) = 86, G(10^6) = 6137.
You are also given that G(n^3) = 153506976 for 1 n < 10^3.
Find G(n^3) for 1 n < 10^6.
Answer: 7c163c3b4886943667b5c89db0a6cd02
Problem 342
===========
Consider the number 50.
50^2 = 2500 = 2^2 5^4, so (2500) = 2 4 5^3 = 8 5^3 = 2^3 5^3.
^1
So 2500 is a square and (2500) is a cube.
Find the sum o all numbers n, 1 < n < 10^10 such that (n^2) is a cube.
^1 denotes Euler's totient unction.
Answer: 0e9add0383d4116c7c5cb3dc73c0536
Problem 343
===========
For any positive integer k, a inite sequence a[i] o ractions x[i]/y[i]
is deined by:
a[1] = 1/k and
a[i] = (x[i-1]+1)/(y[i-1]-1) reduced to lowest terms or i>1.
When a[i] reaches some integer n, the sequence stops. (That is, when
y[i]=1.)
Deine (k) = n.
For example, or k = 20:
1/20 2/19 3/18 = 1/6 2/5 3/4 4/3 5/2 6/1 = 6
So (20) = 6.
Also (1) = 1, (2) = 2, (3) = 1 and f(k^3) = 118937 for 1 k 100.
Find f(k^3) for 1 k 210^6.
Answer: 0e10bd111425ad8e1343ac79dac7bb0e
Problem 344
===========

One variant of N.G. de Bruijn's silver dollar game can be described as

follows:
On a strip of squares a number of coins are placed, at most one coin per
square. Only one coin, called the silver dollar, has any value. Two
players take turns making moves. At each turn a player must make either a
regular or a special move.
A regular move consists of selecting one coin and moving it one or more
squares to the left. The coin cannot move out of the strip or jump on or
over another coin.
Alternatively, the player can choose to make the special move of pocketing
the leftmost coin rather than making a regular move. If no regular moves
are possible, the player is forced to pocket the leftmost coin.
The winner is the player who pockets the silver dollar.
A winning configuration is an arrangement of coins on the strip where the
first player can force a win no matter what the second player does.
Let W(n,c) be the number of winning configurations for a strip of n
squares, c worthless coins and one silver dollar.
You are given that W(10,2) = 324 and W(100,10) = 1514704946113500.
Find W(1 000 000, 100) modulo the semiprime 1000 036 000 099 (= 1 000 003
1 000 033).
p_344_silverdollar.gi
Answer: 38e7b980b38cac89b3e267e328cd292
Problem 345
===========
We deine the Matrix Sum o a matrix as the maximum sum o matrix elements
with each element being the only one in his row and column. For example,
the Matrix Sum o the matrix below equals 3315 ( = 863 + 383 + 343 + 959 +
767):
7
497
287
627
767

53
383
63
343
473

183
563
343
773
103

439
79
169
959
699

863
973
583
943
303

497
767
487
407
780
473
673

383
473
463
103
486
915
665

563
103
993
983
502
45
235

79
699
119
89
912
989
509

973
303
883
463
800
873
613

Find the Matrix Sum o:

7
627
447
217
960
870
973

53
343
283
623
376
456
965

183
773
463
3
682
192
905

439
959
29
399
962
162
919

863
943
23
853
300
593
133

287
957
327
290
250
823
673

63
703
493
516
346
965
815

343
583
423
212
172
425
165

169
639
159
462
812
329
992

583
913
743
350
350
803
326

322
445
414
184
821
34
815
813

148
721
456
829
461
124
559
883

972
11
310
373
843
4
813
451

962
525
312
181
513
878
459
509

286
473
798
631
17
450
522
615

255
65
104
101
901
476
788
77

941
511
566
969
711
712
168
281

541
164
520
613
993
914
586
613

265
138
302
840
293
838
966
459

323
672
248
740
157
669
232
205

925
18
694
778
274
875
308
380

281
428
976
458
94
299
833
274

601
154
430
284
192
823
251
302

95
448
392
760
156
329
631
35

973
848
198
390
574
699
107
805

Answer: c3b784c8593890043b17e24088125d4
Problem 346
===========
The number 7 is special, because 7 is 111 written in base 2, and 11
written in base 6
(i.e. 7[10] = 11[6] = 111[2]). In other words, 7 is a repunit in at least
two bases b > 1.
We shall call a positive integer with this property a strong repunit. It
can be veriied that there are 8 strong repunits below 50:
{1,7,13,15,21,31,40,43}.
Furthermore, the sum o all strong repunits below 1000 equals 15864.
Find the sum o all strong repunits below 10^12.
Answer: a17874b5a9ec9d7c8c6489ab829b9
Problem 347
===========
The largest integer 100 that is only divisible by both the primes 2 and
3 is 96, as 96=32*3=2^5*3.For two distinct primes p and q let M(p,q,N) be
the largest positive integer N only divisibleby both p and q and
M(p,q,N)=0 i such a positive integer does not exist.
E.g. M(2,3,100)=96.
M(3,5,100)=75 and not 90 because 90 is divisible by 2 ,3 and 5.
Also M(2,73,100)=0 because there does not exist a positive integer 100
that is divisible by both 2 and 73.
Let S(N) be the sum o all distinct M(p,q,N).S(100)=2262.
Find S(10 000 000).
Answer: 96ce0eabcbe7a2b2eb1197a1bcc5d37b
Problem 348
===========
Many numbers can be expressed as the sum o a square and a cube. Some o
them in more than one way.

Consider the palindromic numbers that can be expressed as the sum o a

square and a cube, both greater than 1, in exactly 4 dierent ways.
For example, 5229225 is a palindromic number and it can be expressed in
exactly 4 dierent ways:
2285^2
2223^2
1810^2
1197^2

+
+
+
+

20^3
66^3
125^3
156^3

Find the sum o the ive smallest such palindromic numbers.

Answer: 2869159c20aeb97a8b8396ba64de
Problem 349
===========
An ant moves on a regular grid o squares that are coloured either black
or white.
The ant is always oriented in one o the cardinal directions (let, right,
up or down) and moves rom square to adjacent square according to the
ollowing rules:
- i it is on a black square, it lips the color o the square to white,
rotates 90 degrees counterclockwise and moves orward one square.
- i it is on a white square, it lips the color o the square to black,
rotates 90 degrees clockwise and moves orward one square.
Starting with a grid that is entirely white, how many squares are black
ater 10^18 moves o the ant?
Answer: 412b0aec10b3adb415363d2d26530d
Problem 350
===========
A list o size n is a sequence o n natural numbers.
Examples are (2,4,6), (2,6,4), (10,6,15,6), and (11).
The greatest common divisor, or gcd, o a list is the largest natural
number that divides all entries o the list.
Examples: gcd(2,6,4) = 2, gcd(10,6,15,6) = 1 and gcd(11) = 11.
The least common multiple, or lcm, o a list is the smallest natural
number divisible by each entry o the list.
Examples: lcm(2,6,4) = 12, lcm(10,6,15,6) = 30 and lcm(11) = 11.
Let (G, L, N) be the number o lists o size N with gcd G and lcm L.
For example:

(10,
(10,
(10,
(10,

100,
100,
100,
100,

1) = 91.
2) = 327.
3) = 1135.
1000) mod 101^4 = 3286053.

Find (10^6, 10^12, 10^18) mod 101^4.

Answer: cad3ce6a252568bbcb41ca627d7e58ae
Problem 351
===========
A hexagonal orchard o order n is a triangular lattice made up o points
within a regular hexagon with side n. The ollowing is an example o a
hexagonal orchard o order 5:
Highlighted in green are the points which are hidden rom the center by a
point closer to it. It can be seen that or a hexagonal orchard o order
5, 30 points are hidden rom the center.
Let H(n) be the number o points hidden rom the center in a hexagonal
orchard o order n.
H(5) = 30. H(10) = 138. H(1 000) = 1177848.
Find H(100 000 000).
p_351_hexorchard.png
Answer: 338481092e945257756075a8d03978d
Problem 352
===========
Each one o the 25 sheep in a lock must be tested or a rare virus, known
to aect 2% o the sheep population.An accurate and extremely sensitive
PCR test exists or blood samples, producing a clear positive / negative
result, but it is very time-consuming and expensive.
Because o the high cost, the vet-in-charge suggests that instead o
perorming 25 separate tests, the ollowing procedure can be used instead:
The sheep are split into 5 groups o 5 sheep in each group. For each
group, the 5 samples are mixed together and a single test is perormed.
Then,
I the result is negative, all the sheep in that group are deemed to
be virus-ree.
I the result is positive, 5 additional tests will be perormed (a
separate test or each animal) to determine the aected
individual(s).
Since the probability o inection or any speciic animal is only 0.02,
the irst test (on the pooled samples) or each group will be:
Negative (and no more tests needed) with probability 0.98^5 =
0.9039207968.
Positive (5 additional tests needed) with probability 1 - 0.9039207968
= 0.0960792032.

Thus, the expected number o tests or each group is 1 + 0.0960792032 5

= 1.480396016.
Consequently, all 5 groups can be screened using an average o only
1.480396016 5 = 7.40198008 tests, which represents a huge saving o more
than 70% !
Although the scheme we have just described seems to be very eicient, it
can still be improved considerably (always assuming that the test is
suiciently sensitive and that there are no adverse eects caused by
mixing dierent samples). E.g.:
We may start by running a test on a mixture o all the 25 samples. It
can be veriied that in about 60.35% o the cases this test will be
negative, thus no more tests will be needed. Further testing will only
be required or the remaining 39.65% o the cases.
I we know that at least one animal in a group o 5 is inected and
the irst 4 individual tests come out negative, there is no need to
run a test on the ith animal (we know that it must be inected).
We can try a dierent number o groups / dierent number o animals
in each group, adjusting those numbers at each level so that the total
expected number o tests will be minimised.
To simpliy the very wide range o possibilities, there is one restriction
we place when devising the most cost-eicient testing scheme: whenever we
start with a mixed sample, all the sheep contributing to that sample must
be ully screened (i.e. a verdict o inected / virus-ree must be reached
or all o them) beore we start examining any other animals.
For the current example, it turns out that the most cost-eicient testing
scheme (we'll call it the optimal strategy) requires an average o just
4.155452 tests!
Using
tests
to be
Thus,
0.10)

the optimal strategy, let T(s,p) represent the average number o

needed to screen a lock o s sheep or a virus having probability p
present in any individual.
rounded to six decimal places, T(25, 0.02) = 4.155452 and T(25,
= 12.702124.

Find T(10000, p) for p=0.01, 0.02, 0.03, ... 0.50.

Give your answer rounded to six decimal places.
Answer: 2e74b2fb574d6318cdbf2a41ad006de7
Problem 353
===========
A moon could be described by the sphere C(r) with centre (0,0,0) and
radius r.
There are stations on the moon at the points on the surface of C(r) with
integer coordinates. The station at (0,0,r) is called North Pole station,
the station at (0,0,-r) is called outh Pole station.
All stations are connected with each other via the shortest road on the
great arc through the stations. A journey between two stations is risky.
If d is the length of the road between two stations, (d/( r))^2 is a

measure for the risk of the journey (let us call it the risk of the road).
If the journey includes more than two stations, the risk of the journey is
the sum of risks of the used roads.
A direct journey from the North Pole station to the South Pole station has
the length r and risk 1. The journey from the North Pole station to the
South Pole station via (0,r,0) has the same length, but a smaller risk:
(r/(r))^2+(r/(r))^2=0.5.
The minimal risk of a journey from the North Pole station to the South
Pole station on C(r) is M(r).
You are given that M(7)=0.1784943998 rounded to 10 digits behind the
decimal oint.
Find M(2^n 1) for 1n15.
Give your answer rounded to 10 digits behind the decimal oint in the form
a.bcdefghijk.
Answer: 211b5626459be71baefc78478d18bdc3
Problem 354
===========
Consider a honey bee's honeycomb where each cell is a erfect regular
hexagon with side length 1.
One articular cell is occuied by the queen bee.
For a ositive real number L, let B(L) count the cells with distance L
from the queen bee cell (all distances are measured from centre to
centre); you may assume that the honeycomb is large enough to accommodate
for any distance we wish to consider.
For examle, B(3) = 6, B(21) = 12 and B(111 111 111) = 54.
Find the number of L 510^11 such that B(L) = 450.
p_354_bee_honeycomb.png
Answer: e36240897614dc46e83405ae8cd198c
Problem 355
===========
Deine Co(n) to be the maximal possible sum o a set o mutually co-prime
elements rom {1,2,...,n}.
For example Co(10) is 30 and hits that maximum on the subset
{1,5,7,8,9}.
You are given that Co(30) = 193 and Co(100) = 1356.
Find Co(200000).
Answer: 41cb97b6d02878d798b2e3b6c74920a

Problem 356
===========
Let a[n] be the largest real root o a polynomial g(x) = x^3 - 2^nx^2 +
n.
For example, a[2] = 3.86619826...
Find the last eight digits o.
Note: represents the loor unction.
p_356_cubicpoly1.gi
p_356_cubicpoly2.gi
Answer: ab2104e80a7da630ce7d835d8006ee
Problem 357
===========
Consider the divisors o 30: 1,2,3,5,6,10,15,30.
It can be seen that or every divisor d o 30, d+30/d is prime.
Find the sum o all positive integers n not exceeding 100 000 000
such thator every divisor d o n, d+n/d is prime.
Answer: ed25b13b18a21c1077ed00e42503b
Problem 358
===========
A cyclic number with n digits has a very interesting property:
When it is multiplied by 1, 2, 3, 4, ... n, all the products have exactly
the same digits, in the same order, but rotated in a circular ashion!
The smallest
142857 1 =
142857 2 =
142857 3 =
142857 4 =
142857 5 =
142857 6 =

cyclic number is the 6-digit number 142857 :

142857
285714
428571
571428
714285
857142

The next cyclic number is 0588235294117647 with 16 digits :

0588235294117647 1 = 0588235294117647
0588235294117647 2 = 1176470588235294
0588235294117647 3 = 1764705882352941
...
0588235294117647 16 = 9411764705882352
Note that or cyclic numbers, leading zeros are important.
There is only one cyclic number or which, the eleven letmost digits are

00000000137 and the ive rightmost digits are 56789 (i.e., it has the orm
00000000137...56789 with an unknown number o digits in the middle). Find
the sum o all its digits.
Answer: 359e1ec8aeaa3932b542a5d20a473
Problem 359
===========
An ininite number o people (numbered 1, 2, 3, etc.) are lined up to get
a room at Hilbert's newest ininite hotel. The hotel contains an ininite
number o loors (numbered 1, 2, 3, etc.), and each loor contains an
ininite number o rooms (numbered 1, 2, 3, etc.).
Initially the hotel is empty. Hilbert declares a rule on how the n^th
person is assigned a room: person n gets the irst vacant room in the
lowest numbered loor satisying either o the ollowing:
the loor is empty
the loor is not empty, and i the latest person taking a room in that
loor is person m, then m + n is a perect square
Person 1
Person 2
square.
Person 2
Person 3

gets room 1 in loor 1 since loor 1 is empty.

does not get room 2 in loor 1 since 1 + 2 = 3 is not a perect
instead gets room 1 in loor 2 since loor 2 is empty.
gets room 2 in loor 1 since 1 + 3 = 4 is a perect square.

Eventually, every person in the line gets a room in the hotel.

Deine P(, r) to be n i person n occupies room r in loor , and 0 i no
person occupies the room. Here are a ew examples:
P(1, 1) = 1
P(1, 2) = 3
P(2, 1) = 2
P(10, 20) = 440
P(25, 75) = 4863
P(99, 100) = 19454
Find the sum o all P(, r) or all positive  and r such that  r =
71328803586048 and give the last 8 digits as your answer.
Answer: 91525a22396940a99c496ecb752eee
Problem 360
===========
Given two points (x[1],y[1],z[1]) and (x[2],y[2],z[2]) in three
dimensional space, the Manhattan distance between those points is deined
as
|x[1]-x[2]|+|y[1]-y[2]|+|z[1]-z[2]|.
Let C(r) be a sphere with radius r and center in the origin O(0,0,0).
Let I(r) be the set o all points with integer coordinates on the surace

o C(r).
Let S(r) be the sum o the Manhattan distances o all elements o I(r) to
the origin O.
E.g. S(45)=34518.
Find S(10^10).
Answer: 82ec91527315eab7e3acc139eeeb8eb
Problem 361
===========
The Thue-Morse sequence {T[n]} is a binary sequence satisying:
T[0] = 0
T[2n] = T[n]
T[2n+1] = 1 - T[n]
The irst several terms o {T[n]} are given as ollows:
01101001100101101001011001101001....
We deine {A[n]} as the sorted sequence o integers such that the binary
expression o each element appears as a subsequence in {T[n]}.
For example, the decimal number 18 is expressed as 10010 in binary. 10010
appears in {T[n]} (T[8] to T[12]), so 18 is an element o {A[n]}.
The decimal number 14 is expressed as 1110 in binary. 1110 never appears
in {T[n]}, so 14 is not an element o {A[n]}.
The irst several terms o A[n] are given as ollows:
n
0 1 2 3 4 5 6 7 8 9 10 11 12
A[n] 0 1 2 3 4 5 6 9 10 11 12 13 18
We can also veriy that A[100] = 3251 and A[1000] = 80852364498.
Find the last 9 digits o .
p_361_Thue-Morse1.gi
Answer: 65402781459001a45b95cc295991
Problem 362
===========
Consider the number 54.
54 can be actored in 7 distinct ways into one or more actors larger than
1:
54, 227, 318, 69, 336, 239 and 2333.
I we require that the actors are all squareree only two ways remain:
336 and 2333.
Let's call Fs(n) the number o ways n can be actored into one or more
squareree actors larger than 1, soFs(54)=2.

Let S(n) be Fs(k) or k=2 to n.

S(100)=193.
Find S(10 000 000 000).
Answer: b620d524bec8653ba7b8a2cab70260b
Problem 363
===========
A cubic Bzier curve is deined by our points: P[0], P[1], P[2] and P[3].
The curve is constructed as ollows:
On the segments P[0]P[1], P[1]P[2] and P[2]P[3] the points Q[0],Q[1] and
Q[2] are drawn such that
P[0]Q[0]/P[0]P[1]=P[1]Q[1]/P[1]P[2]=P[2]Q[2]/P[2]P[3]=t (t in [0,1]).
On the segments Q[0]Q[1] and Q[1]Q[2] the points R[0] and R[1] are drawn
such thatQ[0]R[0]/Q[0]Q[1]=Q[1]R[1]/Q[1]Q[2]=t or the same value o t.
On the segment R[0]R[1] the point B is drawn such that R[0]B/R[0]R[1]=t
or the same value o t.The Bzier curve deined by the points P[0], P[1],
P[2], P[3] is the locus o B as Q[0] takes all possible positions on the
segment P[0]P[1]. (Please note that or all points the value o t is the
same.)
[1]Applet
In the applet to the right you can drag the points P[0], P[1], P[2] and
P[3] to see what the Bzier curve (green curve) deined by those points
looks like. You can also drag the point Q[0] along the segment P[0]P[1].
From the construction it is clear that the Bzier curve will be tangent to
the segments P[0]P[1] in P[0] and P[2]P[3] in P[3].
A cubic Bzier curve with P[0]=(1,0), P[1]=(1,v), P[2]=(v,1) and
P[3]=(0,1) is used to approximate a quarter circle.
The value v>0 is chosen such that the area enclosed by the lines OP[0],
OP[3] and the curve is equal to ^/[4] (the area of the quarter circle).
By how many ercent does the length of the curve differ from the length of
the quarter circle?
That is, if L is the length of the curve, calculate 100*^(L /2)/[(/2)].
Give your answer rounded to 10 digits behind the decimal oint.
Visible links
1. CabriJava.class
Answer: 2bc63386b7cccc64c67f90e719936143
Problem 364
===========
There are N seats in a row. N eole come after each other to fill the
seats according to the following rules:
1.If there is any seat whose adjacent seat(s) are not occuied take such

a seat.
2.If there is no such seat and there is any seat for which only one
adjacent seat is occuied take such a seat.
3.Otherwise take one of the remaining available seats.
Let T(N) be the number of ossibilities that N seats are occuied by N
eole with the given rules.
The following figure shows T(4)=8.
We can verify that T(10) = 61632 and T(1 000) mod 100 000 007 = 47255094.
Find T(1 000 000) mod 100 000 007.

_364_comf_dist.gif
Answer: d631977573d415a4766de9e6bd388cca
Problem 365
===========
The binomial coeffient C(10^18,10^9) is a number with more than 9 billion
(910^9) digits.
Let M(n,k,m) denote the binomial coefficient C(n,k) modulo m.
Calculate M(10^18,10^9,*q*r) for 1000<<q<r<5000 and ,q,r rime.
Answer: 53addf69042b0cefbeb94f3bd3224918
Problem 366
===========
Two layers, Anton and Bernhard, are laying the following game.
There is one ile of n stones.
The first layer may remove any ositive number of stones, but not the
whole ile.
Thereafter, each layer may remove at most twice the number of stones his
oonent took on the revious move.
The layer who removes the last stone wins.
E.g. n=5
If the first layer takes anything more than one stone the next layer
will be able to take all remaining stones.
If the first layer takes one stone, leaving four, his oonent will take
also one stone, leaving three stones.
The first layer cannot take all three because he may take at most 2x1=2
stones. So let's say he takes also one stone, leaving 2. The second layer
can take the two remaining stones and wins.
So 5 is a losing osition for the first layer.
For some winning ositions there is more than one ossible move for the
first layer.
E.g. when n=17 the first layer can remove one or four stones.
Let M(n) be the maximum number of stones the first layer can take from a
winning osition at his first turn and M(n)=0 for any other osition.

M(n) for n100 is 728.

Find M(n) for n10^18.Give your answer modulo 10^8.
Answer: 8a080de12c5163d903b6212dd8086570
Problem 367
===========
Bozo sort, not to be confused with the slightly less efficient bogo sort,
consists out of checking if the inut sequence is sorted and if not
swaing randomly two elements. This is reeated until eventually the
sequence is sorted.
If we consider all ermutations of the first 4 natural numbers as inut
the exectation value of the number of swas, averaged over all 4! inut
sequences is 24.75.
The already sorted sequence takes 0 stes.
In this roblem we consider the following variant on bozo sort.
If the sequence is not in order we ick three elements at random and
shuffle these three elements randomly.
All 3!=6 ermutations of those three elements are equally likely.
The already sorted sequence will take 0 stes.
If we consider all ermutations of the first 4 natural numbers as inut
the exectation value of the number of shuffles, averaged over all 4!
inut sequences is 27.5.
Consider as inut sequences the ermutations of the first 11 natural
numbers.
Averaged over all 11! inut sequences, what is the exected number of
shuffles this sorting algorithm will erform?
Give your answer rounded to the nearest integer.
Answer: 0589f090524e0eea1544b50eefd0ebd8
Problem 368
===========
The harmonic series 1 + 1 + 1 + 1 + ... is well known to be divergent.
2 3 4
If we however omit from this series every term where the denominator has a
9 in it, the series remarkably enough converges to aroximately
22.9206766193.
This modified harmonic series is called the Kemner series.
Let us now consider another modified harmonic series by omitting from the
harmonic series every term where the denominator has 3 or more equal
consecutive digits.One can verify that out of the first 1200 terms of the
harmonic series, only 20 terms will be omitted.
These 20 omitted terms are:

1 , 1 , 1 , 1 , 1 , 1 , 1 , 1 , 1 , 1
, 1
,
111 222 333 444 555 666 777 888 999 1000 1110
1
, 1
, 1
, 1
, 1
, 1
, 1
, 1
and 1
.
1111 1112 1113 1114 1115 1116 1117 1118
1119
This series converges as well.
Find the value the series converges to.
Give your answer rounded to 10 digits behind the decimal oint.
Answer: bfb15c388f4721cbd5eb89f17be2eef2
Problem 369
===========
In a standard 52 card deck of laying cards, a set of 4 cards is a Badugi
if it contains 4 cards with no airs and no two cards of the same suit.
Let f(n) be the number of ways to choose n cards with a 4 card subset that
is a Badugi. For examle, there are 2598960 ways to choose five cards from
a standard 52 card deck, of which 514800 contain a 4 card subset that is a
Badugi, so f(5) = 514800.
Find f(n) for 4 n 13.
Answer: 0f8828f58dbac4f15f296c79b686ed0e
Problem 370
===========
Let us define a geometric triangle as an integer sided triangle with sides
a b c so that its sides form a geometric rogression, i.e.
b^2=ac.
An example o such a geometric triangle is the triangle with sides a =
144, b = 156 and c = 169.
There are 861805 geometric triangles with perimeter 10^6 .
How many geometric triangles exist with perimeter 2.510^13 ?
Answer: 85b5048e25677205555a5308991c2e04
Problem 371
===========
Oregon licence plates consist o three letters ollowed by a three digit
number (each digit can be rom [0..9]).
While driving to work Seth plays the ollowing game:
Whenever the numbers o two licence plates seen on his trip add to 1000

that's a win.
E.g. MIC-012 and HAN-988 is a win and RYU-500 and SET-500 too. (as long as
he sees them in the same trip).
Find the expected number o plates he needs to see or a win.
Give your answer rounded to 8 decimal places behind the decimal point.
Note: We assume that each licence plate seen is equally likely to have any
three digit number on it.
Answer: 537403a97924621c604ce5ab6288b97d
Problem 372
===========
Let R(M, N) be the number o lattice points (x, y) which satisy M<xN,
M<yN and is odd.
We can veriy that R(0, 100) = 3019 and R(100, 10000) = 29750422.
Find R(210^6, 10^9).
Note: represents the loor unction.
p_372_pencilray1.jpg
p_372_pencilray2.gi
Answer: 5deda0dca23d12ae3eb1763b2c65ea
Problem 373
===========
Every triangle has a circumscribed circle that goes through the three
vertices.Consider all integer sided triangles or which the radius o the
circumscribed circle is integral as well.
Let S(n) be the sum o the radii o the circumscribed circles o all such
triangles or which the radius does not exceed n.
S(100)=4950 and S(1200)=1653605.
Find S(10^7).
Answer: 888d60a6b2b4b9146d7c9c14d82673
Problem 374
===========
An integer partition o a number n is a way o writing n as a sum o
positive integers.
Partitions that dier only in the order o their summands are considered
the same.A partition o n into distinct parts is a partition o n in which

every part occurs at most once.

The partitions o 5 into distinct parts are:
5, 4+1 and 3+2.
Let (n) be the maximum product o the parts o any such partition o n
into distinct parts and let m(n) be the number o elements o any such
partition o n with that product.
So (5)=6 and m(5)=2.
For n=10 the partition with the largest product is 10=2+3+5, which gives
(10)=30 and m(10)=3.
And their product, (10)m(10) = 303 = 90
It can be veriied that
(n)m(n) or 1 n 100 = 1683550844462.
Find (n)m(n) or 1 n 10^14.
Give your answer modulo 982451653, the 50 millionth prime.
Answer: 6cb063062076b5aaa3e3cd03e4b2
Problem 375
===========
Let S[n] be an integer sequence produced with the ollowing pseudo-random
number generator:
S[0] =[] 290797[]
S[n+1] =[] S[n]^2 mod 50515093
Let A(i, j) be the minimum o the numbers S[i], S[i+1], ... , S[j] or i
j.
Let M(N) = A(i, j) for 1 i j N.
We can verify that M(10) = 432256955 and M(10 000) = 3264567774119.
Find M(2 000 000 000).
Answer: 68a12e3f2e4ccbae9c8555e547fbe096
Problem 376
===========
Consider the following set of dice with nonstandard pips:
Die A: 1 4 4 4 4 4
Die B: 2 2 2 5 5 5
Die C: 3 3 3 3 3 6
A game is played by two players picking a die in turn and rolling it. The
player who rolls the highest value wins.
If the first player picks die A and the second player picks die B we get

P(second player wins) = 7/12 > 1/2

If the first player picks die B and the second player picks die C we get
P(second player wins) = 7/12 > 1/2
If the first player picks die C and the second player picks die A we get
P(second player wins) = 25/36 > 1/2

o whatever die the first player picks, the second player can pick another
die and have a larger than 50% chance of winning.
A set of dice having this property is called a nontransitive set of dice.
We wish to investigate how many sets of nontransitive dice exist. We will
assume the following conditions:
There are three six-sided dice with each side having between 1 and N
pips, inclusive.
Dice with the same set of pips are equal, regardless of which side on
the die the pips are located.
The same pip value may appear on multiple dice; if both players roll
the same value neither player wins.
The sets of dice {A,B,C}, {B,C,A} and {C,A,B} are the same set.
For N = 7 we find there are 9780 such sets.
How many are there for N = 30 ?
Answer: c64df302990eb3738f8ec62ea6b66c0b
Problem 377
===========
There are 16 positive integers that do not have a zero in their digits and
that have a digital sum equal to 5, namely:
5, 14, 23, 32, 41, 113, 122, 131, 212, 221, 311, 1112, 1121, 1211, 2111
and 11111.
Their sum is 17891.
Let f(n) be the sum of all positive integers that do not have a zero in
their digits and have a digital sum equal to n.
Find .
Give the last 9 digits as your answer.
Answer: a915ccbae49de15208c88affba84d206
Problem 378
===========
Let T(n) be the n^th triangle number, so T(n) = n (n+1) .
2
Let dT(n) be the number of divisors of T(n).
E.g.:T(7) = 28 and dT(7) = 6.

Let Tr(n) be the number of triples (i, j, k) such that 1 i < j < k n
and dT(i) > dT(j) > dT(k).
Tr(20) = 14, Tr(100) = 5772 and Tr(1000) = 11174776.
Find Tr(60 000 000).
Give the last 18 digits of your answer.
Answer: 336745dc9d90928596237c4b471a8927
Problem 379
===========
Let f(n) be the number of couples (x,y) with x and y positive integers, x
y and the least common multiple of x and y equal to n.
Let g be the summatory function of f, i.e.: g(n) = f(i) for 1 i n.
You are given that g(10^6) = 37429395.
Find g(10^12).
Answer: de20f710cb6665c48795072197ad53e0
Problem 380
===========
An mn maze is an mn rectangular grid with walls placed between grid
cells such that there is exactly one path from the top-left square to any
other square.
The following are examples of a 912 maze and a 1520 maze:
Let C(m,n) be the number of distinct mn mazes. Mazes which can be formed
by rotation and reflection from another maze are considered distinct.
It can be verified that C(1,1) = 1, C(2,2) = 4, C(3,4) = 2415, and C(9,12)
= 2.5720e46 (in scientific notation rounded to 5 significant digits).
Find C(100,500) and write your answer in scientific notation rounded to 5
significant digits.
When giving your answer, use a lowercase e to separate mantissa and
exponent.E.g. if the answer is 1234567891011 then the answer format would
be 1.2346e12.
Answer: c86d2f4c17c8134fbebed5d37a0f90d7
Problem 381
===========
For a prime p let (p) = ((p-k)!) mod(p) for 1 k 5.
For example, if p=7,

(7-1)! + (7-2)! + (7-3)! + (7-4)! + (7-5)! = 6! + 5! + 4! + 3! + 2! =

720+120+24+6+2 = 872.
As 872 mod(7) = 4, (7) = 4.
It can be verified that (p) = 480 for 5 p < 100.
Find (p) for 5 p < 10^8.
Answer: 80c84973a9643e46d49d79d7284e7ff3
Problem 382
===========
A polygon is a flat shape consisting of straight line segments that are
joined to form a closed chain or circuit. A polygon consists of at least
three sides and does not self-intersect.
A set  of positive numbers is said to generate a polygon P if:
no two sides of P are the same length,
the length of every side of P is in , and
 contains no other value.
For example:
The set {3, 4, 5} generates a polygon with sides 3, 4, and 5 (a triangle).
The set {6, 9, 11, 24} generates a polygon with sides 6, 9, 11, and 24 (a
quadrilateral).
The sets {1, 2, 3} and {2, 3, 4, 9} do not generate any polygon at all.
Consider the sequence s, defined as follows:
s[1] = 1, s[2] = 2, s[3] = 3
s[n] = s[n-1] + s[n-3] for n > 3.
Let U[n] be the set {s[1], s[2], ..., s[n]}. For example, U[10] = {1, 2,
3, 4, 6, 9, 13, 19, 28, 41}.
Let f(n) be the number of subsets of U[n] which generate at least one
polygon.
For example, f(5) = 7, f(10) = 501 and f(25) = 18635853.
Find the last 9 digits of f(10^18).
Answer: 56a121bcf3bb674d0d3ce561b6b24ea5
Problem 383
===========
Let f[5](n) be the largest integer x for which 5^x divides n.
For example, f[5](625000) = 7.
Let T[5](n) be the number of integers i which satisfy f[5]((2i-1)!) <
2[5](i!) and 1 i n.
It can be veriied that T[5](10^3) = 68 and T[5](10^9) = 2408210.

Find T[5](10^18).
Answer: c1bc7c945344e1967baced9ade895a0
Problem 384
===========
Deine the sequence a(n) as the number o adjacent pairs o ones in the
binary expansion o n (possibly overlapping).
E.g.: a(5) = a(101[2]) = 0, a(6) = a(110[2]) = 1, a(7) = a(111[2]) = 2
Deine the sequence b(n) = (-1)^a(n).
This sequence is called the Rudin-Shapiro sequence.
Also consider the summatory sequence o b(n): .
The irst couple
n 0 1
a(n) 0 0
b(n) 1 1
s(n) 1 2

o values o these sequences are:

2 3 4 5 6
0 1 0 0 1
1 -1 1 1 -1
3 2 3 4 3

7
2
1
4

The sequence s(n) has the remarkable property that all elements are
positive and every positive integer k occurs exactly k times.
Deine g(t,c), with 1 c t, as the index in s(n) or which t occurs or
the c'th time in s(n).
E.g.: g(3,3) = 6, g(4,2) = 7 and g(54321,12345) = 1220847710.
Let F(n) be the ibonacci sequence deined by:
F(0)=F(1)=1 and
F(n)=F(n-1)+F(n-2) or n>1.
Deine GF(t)=g(F(t),F(t-1)).
Find GF(t) for 2t45.
Answer: ea0bb1fff1a51b48971762b93aeed103
Problem 385
===========
For any triangle T in the plane, it can be shown that there is a unique
ellipse with largest area that is completely inside T.
For a given n, consider triangles T such that:
- the vertices of T have integer coordinates with absolute value n, and
- the foci^1 of the largest-area ellipse inside T are (13,0) and
(-13,0).
Let A(n) be the sum of the areas of all such triangles.
For example, if n = 8, there are two such triangles. Their vertices are
(-4,-3),(-4,3),(8,0) and (4,3),(4,-3),(-8,0), and the area of each
triangle is 36. Thus A(8) = 36 + 36 = 72.

It can be verified that A(10) = 252, A(100) = 34632 and A(1000) = 3529008.
Find A(1 000 000 000).
^1The foci (plural of focus) of an ellipse are two points A and B such
that for every point P on the boundary of the ellipse, AP + PB is
constant.
Answer: a21c033d9e119c293e51966ea78c9950
Problem 386
===========
Let n be an integer and (n) be the set of factors of n.
A subset A of (n) is called an antichain of (n) if A contains only one
element or if none of the elements of A divides any of the other elements
of A.
For example: (30) = {1, 2, 3, 5, 6, 10, 15, 30}
{2, 5, 6} is not an antichain of (30).
{2, 3, 5} is an antichain of (30).
Let N(n) be the maximum length of an antichain of (n).
Find N(n) for 1 n 10^8
Answer: d1d893f7c50910aa10daec5e9352e86d
Problem 387
===========
A Harshad or Niven number is a number that is divisible by the sum of its
digits.
201 is a Harshad number because it is divisible by 3 (the sum of its
digits.)
When we truncate the last digit from 201, we get 20, which is a Harshad
number.
When we truncate the last digit from 20, we get 2, which is also a Harshad
number.
Let's call a Harshad number that, while recursively truncating the last
digit, always results in a Harshad number a right truncatable Harshad
number.
Also:
201/3=67 which is prime.
Let's call a Harshad number that, when divided by the sum of its digits,
results in a prime a strong Harshad number.
Now take the number 2011 which is prime.
When we truncate the last digit from it we get 201, a strong Harshad
number that is also right truncatable.
Let's call such primes strong, right truncatable Harshad primes.

You are given that the sum of the strong, right truncatable Harshad primes
less than 10000 is 90619.
Find the sum of the strong, right truncatable Harshad primes less than
10^14.
Answer: a20cbd8639767decfa2c2c9955eb6be3
Problem 388
===========
Consider all lattice points (a,b,c) with 0 a,b,c N.
From the origin O(0,0,0) all lines are drawn to the other lattice points.
Let D(N) be the number of distinct such lines.
You are given that D(1 000 000) = 831909254469114121.
Find D(10^10). Give as your answer the first nine digits followed by the
last nine digits.
Answer: 2bab886c7d98d802d9249c9e12d72c25
Problem 389
===========
An unbiased single 4-sided die is thrown and its value, T, is noted.
T unbiased 6-sided dice are thrown and their scores are added together.
The sum, C, is noted.
C unbiased 8-sided dice are thrown and their scores are added together.
The sum, O, is noted.
O unbiased 12-sided dice are thrown and their scores are added together.
The sum, D, is noted.
D unbiased 20-sided dice are thrown and their scores are added together.
The sum, I, is noted.
Find the variance of I, and give your answer rounded to 4 decimal places.
Answer: 79a080d38b837547b975c97b44764dfb
Problem 390
===========
Consider the triangle with sides 5, 65 and 68.It can be shown that this
triangle has area 9.

(n) is the sum of the areas of all triangles with sides (1+b^2),
(1+c^2) and (b^2+c^2) (for positive integers b and c ) that have an
integral area not exceeding n.
The example triangle has b=2 and c=8.

(10^6)=18018206.
Find (10^10).
Answer: ed7f2fbc05a2fd2033d80de671f35ea3
Problem 391
===========
Let s[k] be the number of 1s when writing the numbers from 0 to k in
binry.
For exmple, writing 0 to 5 in binry, we hve 0, 1, 10, 11, 100, 101.
There re seven 1s, so s[5] = 7.
The sequence S = {s[k] : k 0} strts {0, 1, 2, 4, 5, 7, 9, 12, ...}.
A gme is plyed by two plyers. Before the gme strts,  number n is
chosen. A counter c strts t 0. At ech turn, the plyer chooses  number
from 1 to n (inclusive) nd increses c by tht number. The resulting
vlue of c must be  member of S. If there re no more vlid moves, the
plyer loses.
For exmple:
Let n = 5. c strts t 0.
Plyer 1 chooses 4, so c becomes 0 +
Plyer 2 chooses 5, so c becomes 4 +
Plyer 1 chooses 3, so c becomes 9 +
etc.
Note tht c must lwys belong to S,
most n.

4 = 4.
5 = 9.
3 = 12.

nd ech plyer cn increse c by t

Let M(n) be the highest number the first plyer cn choose t her first
turn to force  win, nd M(n) = 0 if there is no such move. For exmple,
M(2) = 2, M(7) = 1 nd M(20) = 4.
Given (M(n))^3 = 8150 for 1 n 20.
Find (M(n))^3 for 1 n 1000.
Answer: b2947548d4f5c4878c5f788f9849e750
Problem 392
===========
A rectilinear grid is an orthogonal grid where the spacing between the
gridlines does not have to be equidistant.
An example of such grid is logarithmic graph paper.
Consider rectilinear grids in the Cartesian coordinate system with the
following properties:
The gridlines are parallel to the axes of the Cartesian coordinate
system.
There are N+2 vertical and N+2 horizontal gridlines. Hence there are

(N+1) x (N+1) rectangular cells.

The equations of the two outer vertical gridlines are x = -1 and x =
1.
The equations of the two outer horizontal gridlines are y = -1 and y =
1.
The grid cells are colored red if they overlap with the unit circle,
black otherwise.
For this problem we would like you to find the postions of the remaining N
inner horizontal and N inner vertical gridlines so that the area occupied
by the red cells is minimized.
E.g. here is a picture of the solution for N = 10:
The area occupied by the red cells for N = 10 rounded to 10 digits behind
the decimal point is 3.3469640797.
Find the positions for N = 400.
Give as your answer the area occupied by the red cells rounded to 10
digits behind the decimal point.
Answer: 3268b0bc489187db3d234c097040d909
Problem 393
===========
An nn grid of squares contains n^2 ants, one ant per square.
All ants decide to move simultaneously to an adjacent square (usually 4
possibilities, except for ants on the edge of the grid or at the corners).
We define f(n) to be the number of ways this can happen without any ants
ending on the same square and without any two ants crossing the same edge
between two squares.
You are given that f(4) = 88.
Find f(10).
Answer: 58e4990838fb3d1725872da30f9db748
Problem 394
===========
Jeff eats a pie in an unusual way.
The pie is circular. He starts with slicing an initial cut in the pie
along a radius.
While there is at least a given fraction F of pie left, he performs the
following procedure:
- He makes two slices from the pie centre to any point of what is
remaining of the pie border, any point on the remaining pie border equally
likely. This will divide the remaining pie into three pieces.
- Going counterclockwise from the initial cut, he takes the first two pie
pieces and eats them.
When less than a fraction F of pie remains, he does not repeat this
procedure. Instead, he eats all of the remaining pie.

For x 1, let E(x) be the expected number of times Jeff repeats the
procedure above with F = ^1/[x].
It can be verified that E(1) = 1, E(2) 1.2676536759, and E(7.5)
2.1215732071.
Find E(40) rounded to 10 decimal places behind the decimal point.
Answer: f8ad575e1a03365a60b6429c3b7a64df
Problem 395
===========
The Pythagorean tree is a fractal generated by the following procedure:

tart with a unit square. Then, calling one of the sides its base (in the
animation, the bottom side is the base):
1.Attach a right triangle to the side opposite the base, with the
hypotenuse coinciding with that side and with the sides in a 3-4-5
ratio. Note that the smaller side of the triangle must be on the
'right' side with respect to the base (see animation).
2.Attach a square to each leg of the right triangle, with one of its
sides coinciding with that leg.
3.Repeat this procedure for both squares, considering as their bases the
sides touching the triangle.
The resulting figure, after an infinite number of iterations, is the
Pythagorean tree.
It can be shown that there exists at least one rectangle, whose sides are
parallel to the largest square of the Pythagorean tree, which encloses the
Pythagorean tree completely.
Find the smallest area possible for such a bounding rectangle, and give
your answer rounded to 10 decimal places.
p_395_pythagorean.gif
Answer: 505048b0c619161d05b9b3e492f3edc3
Problem 396
===========
For any positive integer n, the nth weak Goodstein sequence {g[1], g[2],
g[3], ...} is defined as:
g[1] = n
for k > 1, g[k] is obtained by writing g[k-1] in base k, interpreting
it as a base k + 1 number, and subtracting 1.
The sequence terminates when g[k] becomes 0.
For example, the 6th weak Goodstein sequence is {6, 11, 17, 25, ...}:
g[1] = 6.

g[2] = 11 since 6 = 110[2], 110[3] = 12, and 12 - 1 = 11.

g[3] = 17 since 11 = 102[3], 102[4] = 18, and 18 - 1 = 17.
g[4] = 25 since 17 = 101[4], 101[5] = 26, and 26 - 1 = 25.
and so on.
It can be shown that every weak Goodstein sequence terminates.
Let G(n) be the number of nonzero elements in the nth weak Goodstein
sequence.
It can be verified that G(2) = 3, G(4) = 21 and G(6) = 381.
It can also be verified that G(n) = 2517 for 1 n < 8.
Find the last 9 digits of G(n) for 1 n < 16.
Answer: 4665c73fdca473ccc0643fc982f24e06
Problem 397
===========
On the parabola y = x^2/k, three points A(a, a^2/k), B(b, b^2/k) and C(c,
c^2/k) are chosen.
Let F(K, X) be the number of the integer quadruplets (k, a, b, c) such
that at least one angle of the triangle ABC is 45-degree, with 1 k K
and -X a < b < c X.
For example, F(1, 10) = 41 and F(10, 100) = 12492.
Find F(10^6, 10^9).
Answer: 07f769df9543bc05e6318878c34d074d
Problem 398
===========
Inside a rope of length n, n-1 points are placed with distance 1 from each
other and from the endpoints. Among these points, we choose m-1 points at
random and cut the rope at these points to create m segments.
Let E(n, m) be the expected length of the second-shortest segment.For
example, E(3, 2) = 2 and E(8, 3) = 16/7.Note that if multiple segments
have the same shortest length the length of the second-shortest segment is
defined as the same as the shortest length.
Find E(10^7, 100).Give your answer rounded to 5 decimal places behind the
decimal point.
Answer: fa0a25d62fa225e05fd8736713a9bfc0
Problem 399
===========

The first 15 fibonacci numbers are:

1,1,2,3,5,8,13,21,34,55,89,144,233,377,610.
It can be seen that 8 and 144 are not squarefree: 8 is divisible by 4 and
144 is divisible by 4 and by 9.
o the first 13 squarefree fibonacci numbers are:
1,1,2,3,5,13,21,34,55,89,233,377 and 610.
The 200th squarefree fibonacci number
is:971183874599339129547649988289594072811608739584170445.
The last sixteen digits of this number are: 1608739584170445 and in
scientific notation this number can be written as 9.7e53.
Find the 100 000 000th squarefree fibonacci number.
Give as your answer its last sixteen digits followed by a comma followed
by the number in scientific notation (rounded to one digit after the
decimal point).
For the 200th squarefree number the answer would have been:
1608739584170445,9.7e53
Note:
For this problem, assume that for every prime p, the first fibonacci
number divisible by p is not divisible by p^2 (this is part of Wall's
conjecture). This has been verified for primes 310^15, but has not been
proven in general.
I it happens that the conjecture is alse, then the accepted answer to
this problem isn't guaranteed to be the 100 000 000th squareree ibonacci
number, rather it represents only a lower bound or that number.
Answer: a0819ce3be6a04645b8d4e2345e184
Problem 400
===========
A Fibonacci tree is a binary tree recursively deined as:
T(0) is the empty tree.
T(1) is the binary tree with only one node.
T(k) consists o a root node that has T(k-1) and T(k-2) as children.
On such a tree two players play a take-away game. On each turn a player
selects a node and removes that node along with the subtree rooted at that
node.
The player who is orced to take the root node o the entire tree loses.
Here are the winning moves o the irst player on the irst turn or T(k)
rom k=1 to k=6.
Let (k) be the number o winning moves o the irst player (i.e. the
moves or which the second player has no winning strategy) on the irst
turn o the game when this game is played on T(k).
For example, (5) = 1 and (10) = 17.
Find (10000). Give the last 18 digits o your answer.

Answer: 60aa790c07a1446c1e2deba72543a1
Problem 401
===========
The divisors o 6 are 1,2,3 and 6.
The sum o the squares o these numbers is 1+4+9+36=50.
Let sigma2(n) represent the sum o the squares o the divisors o n.Thus
sigma2(6)=50.
Let SIGMA2 represent the summatory unction o sigma2, that is
SIGMA2(n)=sigma2(i) or i=1 to n.
The irst 6 values o SIGMA2 are: 1,6,16,37,63 and 113.
Find SIGMA2(10^15) modulo 10^9.
Answer: 982a249d8b45e10c98c32dabac00751
Problem 402
===========
It can be shown that the polynomial n^4 + 4n^3 + 2n^2 + 5n is a multiple
o 6 or every integer n. It can also be shown that 6 is the largest
integer satisying this property.
Deine M(a, b, c) as the maximum m such that n^4 + an^3 + bn^2 + cn is a
multiple o m or all integers n. For example, M(4, 2, 5) = 6.
Also, deine S(N) as the sum o M(a, b, c) or all 0 < a, b, c N.
We can veriy that S(10) = 1972 and S(10000) = 2024258331114.
Let F[k] be the Fibonacci sequence:
F[0] = 0, F[1] = 1 and
F[k] = F[k-1] + F[k-2] or k 2.
Find the last 9 digits o (F[k]) for 2 k 1234567890123.
Answer: fa7ae8e9243f01b0eac10ec5aaff1f42
Problem 403
===========
For integers a and b, we define D(a, b) as the domain enclosed by the
parabola y = x^2 and the line y = ax + b:
D(a, b) = { (x, y) | x^2 y ax + b }.
L(a, b) is deined as the number o lattice points contained in D(a, b).
For example, L(1, 2) = 8 and L(2, -1) = 1.
We also deine S(N) as the sum o L(a, b) or all the pairs (a, b) such

that the area o D(a, b) is a rational number and |a|,|b| N.

We can veriy that S(5) = 344 and S(100) = 26709528.
Find S(10^12). Give your answer mod 10^8.
Answer: 31c018e3781a3e17036601e3009602
Problem 404
===========
E[a] is an ellipse with an equation o the orm x^2 + 4y^2 = 4a^2.
E[a]' is the rotated image o E[a] by degrees counerclockwise around
he origin O(0, 0) for 0 < < 90.
b is he disance o he origin of he wo inersecion poins closes o
he origin and c is he disance of he wo oher inersecion poins.
We call an ordered riple (a, b, c) a canonical ellipsoidal riple if a,
b and c are posiive inegers.
For example, (209, 247, 286) is a canonical ellipsoidal riple.
Le C(N) be he number of disinc canonical ellipsoidal riples (a, b,
c) for a N.
I can be verified ha C(10^3) = 7, C(10^4) = 106 and C(10^6) = 11845.
Find C(10^17).
p_404_c_ellipse.gif
Answer: 2d1bc4b93bbc19d9e70c5b04338dea2e
Problem 405
===========
We wish o ile a recangle whose lengh is wice is widh.
Le T(0) be he iling consising of a single recangle.
For n > 0, le T(n) be obained from T(n-1) by replacing all iles in he
following manner:
The following animaion demonsraes he ilings T(n) for n from 0 o 5:
Le f(n) be he number of poins where four iles mee in T(n).
For example, f(1) = 0, f(4) = 82 and f(10^9) mod 17^7 = 126897180.
Find f(10^k) for k = 10^18, give your answer modulo 17^7.
p_405_ile1.png
p_405_ile2.gif
Answer: 93b712426b768586f88d0bfe597842e6
Problem 406
===========

We are rying o find a hidden number seleced from he se of inegers
{1, 2, ..., n} by asking
uesions. Each number (
uesion) we ask, we ge
one of hree possible answers:
"Your guess is lower han he hidden number" (and you incur a cos of
a), or
"Your guess is higher han he hidden number" (and you incur a cos of
b), or
"Yes, ha's i!" (and he game ends).
Given he value of n, a, and b, an opimal sraegy minimizes he oal
cos for he wors possible case.
For example, if n = 5, a = 2, and b = 3, hen we may begin by asking "2"
as our firs
uesion.
If we are old ha 2 is higher han he hidden number (for a cos of
b=3), hen we are sure ha "1" is he hidden number (for a oal cos of
3).
If we are old ha 2 is lower han he hidden number (for a cos of a=2),
hen our nex
uesion will be "4".
If we are old ha 4 is higher han he hidden number (for a cos of
b=3), hen we are sure ha "3" is he hidden number (for a oal cos of
2+3=5).
If we are old ha 4 is lower han he hidden number (for a cos of a=2),
hen we are sure ha "5" is he hidden number (for a oal cos of
2+2=4).
Thus, he wors-case cos achieved by his sraegy is 5. I can also be
shown ha his is he lowes wors-case cos ha can be achieved. So, in
fac, we have jus described an opimal sraegy for he given values of
n, a, and b.
Le C(n, a, b) be he wors-case cos achieved by an opimal sraegy for
he given values of n, a, and b.
Here are a few
C(5, 2, 3) = 5
C(500, 2, 3)
C(20000, 5, 7)
C(2000000, 5,

examples:
= 13.22073197...
= 82
7) = 49.63755955...

Le F[k] be he Fibonacci numbers: F[k] = F[k-1] + F[k-2] wih base cases
F[1] = F[2] = 1.
Find [1k30]C(10^12, k, F[k]), and give your answer rounded o 8
decimal places behind he decimal poin.
Answer: 0766b1ee975f5674d30fd6c3c934c6e0
Problem 407
===========
If we calculae a^2 mod 6 for 0 a 5 we ge: 0,1,4,3,4,1.
The larges value of a such ha a^2 a mod 6 is 4.
Le's call M(n) he larges value of a < n such ha a^2 a (mod n).
So M(6) = 4.

Find M(n) for 1 n 10^7.

Answer: f4da34a4b357123cb142739a52e010f2
Problem 408
===========
Le's call a laice poin (x, y) inadmissible if x, y and x+y are all
posiive perfec s
uares.
For example, (9, 16) is inadmissible, while (0, 4), (3, 1) and (9, 4) are
no.
Consider a pah from poin (x[1], y[1]) o poin (x[2], y[2]) using only
uni seps norh or eas.
Le's call such a pah admissible if none of is inermediae poins are
inadmissible.
Le P(n) be he number of admissible pahs from (0, 0) o (n, n).
I can be verified ha P(5) = 252, P(16) = 596994440 and P(1000) mod
1000000007 = 341920854.
Find P(10000000) mod 1000000007.
Answer: 2c09e247c6144c16cae2358d316affd9
Problem 409
===========
Le n be a posiive ineger. Consider nim posiions where:
There are n non-empy piles.
Each pile has size less han 2^n.
No wo piles have he same size.
Le W(n) be he number of winning nim posiions saisfying he
abovecondiions (a posiion is winning if he firs player has a winning
sraegy). For example, W(1) = 1, W(2) = 6, W(3) = 168, W(5) = 19764360
and W(100) mod 1000000007 = 384777056.
Find W(10000000) mod 1000000007.
Answer: 56c32e75a2656ec08ce177089bda2f53
Problem 410
===========
Le C be he circle wih radius r, x^2 + y^2 = r^2. We choose wo poins
P(a, b) and Q(-a, c) so ha he line passing hrough P and Q is angen
o C.
For example, he
uadruple (r, a, b, c) = (2, 6, 2, -7) saisfies his

propery.
Le F(R, X) be he number of he ineger
uadruples (r, a, b, c) wih
his propery, and wih 0 < r R and 0 < a X.
We can verify ha F(1, 5) = 10, F(2, 10) = 52 and F(10, 100) = 3384.
Find F(10^8, 10^9) + F(10^9, 10^8).
Answer: 45826f3a23aa321f97acb1d2a8f2170b
Problem 411
===========
Le n be a posiive ineger. Suppose here are saions a he coordinaes
(x, y) = (2^i mod n, 3^i mod n) for 0 i 2n. We will consider saions
wih he same coordinaes as he same saion.
We wish o form a pah from (0, 0) o (n, n) such ha he x and y
coordinaes never decrease.
Le S(n) be he maximum number of saions such a pah can pass hrough.
For example, if n = 22, here are 11 disinc saions, and a valid pah
can pass hrough a mos 5 saions. Therefore, S(22) = 5.The case is
illusraed below, wih an example of an opimal pah:
I can also be verified ha S(123) = 14 and S(10000) = 48.
Find S(k^5) for 1 k 30.
Answer: e351762bf2220ca1396e6a9ee3f6c84f
Problem 412
===========
For inegers m, n (0n<m), le L(m,n) be an mm grid wih he
op-righ nn grid removed.
For example, L(5, 3) looks like his:
We wan o number each cell of L(m,n) wih consecuive inegers 1, 2, 3,
... such ha he number in every cell is smaller han he number below i
and o he lef of i.
For example, here are wo valid numberings of L(5,3):
Le LC(m, n) be he number of valid numberings of L(m, n).
I can be verified ha LC(3,0) = 42, LC(5,3) = 250250, LC(6,3) =
406029023400 and LC(10,5) mod 76543217 = 61251715.
Find LC(10000,5000) mod 76543217.
Answer: 8919ccca34b7ccc293d33e06872c668d

Problem 413
===========
We say ha a d-digi posiive number (no leading zeros) is a one-child
number if exacly one of is sub-srings is divisible by d.
For example, 5671 is a 4-digi one-child number. Among all is sub-srings
5, 6, 7, 1, 56, 67, 71, 567, 671 and 5671, only 56 is divisible by 4.
Similarly, 104 is a 3-digi one-child number because only 0 is divisible
by 3.
1132451 is a 7-digi one-child number because only 245 is divisible by 7.
Le F(N) be he number of he one-child numbers less han N.
We can verify ha F(10) = 9, F(10^3) = 389 and F(10^7) = 277674.
Find F(10^19).
Answer: 569ad33af889215704df5a9e278aa004
Problem 414
===========
6174 is a remarkable number; if we sor is digis in increasing order and
subrac ha number from he number you ge when you sor he digis in
decreasing order, we ge 7641-1467=6174.
Even more remarkable is ha if we sar from any 4 digi number and
repea his process of soring and subracing, we'll evenually end up
wih 6174 or immediaely wih 0 if all digis are e
ual.
This also works wih numbers ha have less han 4 digis if we pad he
number wih leading zeroes unil we have 4 digis.
E.g. le's sar wih he number 0837:
8730-0378=8352
8532-2358=6174
6174 is called he Kaprekar consan. The process of soring and
subracing and repeaing his unil eiher 0 or he Kaprekar consan is
reached is called he Kaprekar rouine.
We can consider he Kaprekar rouine for oher bases and number of digis.
Unforunaely, i is no guaraneed a Kaprekar consan exiss in all
cases; eiher he rouine can end up in a cycle for some inpu numbers or
he consan he rouine arrives a can be differen for differen inpu
numbers.
However, i can be shown ha for 5 digis and a base b = 6+39, a
Kaprekar consan exiss.
E.g. base 15: (10,4,14,9,5)[15]
base 21: (14,6,20,13,7)[21]
Define C[b] o be he Kaprekar consan in base b for 5 digis.Define he
funcion sb(i) o be
0 if i = C[b] or if i wrien in base b consiss of 5 idenical digis
he number of ieraions i akes he Kaprekar rouine in base b o
arrive a C[b], oherwise

Noe ha we can define sb(i) for all inegers i < b^5. If i wrien in
base b akes less han 5 digis, he number is padded wih leading zero
digis unil we have 5 digis before applying he Kaprekar rouine.
Define S(b) as he sum of sb(i) for 0 < i < b^5.
E.g. S(15) = 5274369
S(111) = 400668930299
Find he sum of S(6k+3) for 2 k 300.
Give he las 18 digis as your answer.
Answer: 42f095bdfd71e1ae4ae0ceead1bb1802
Problem 415
===========
A se of laice poins S is called a ianic se if here exiss a line
passing hrough exacly wo poins in S.
An example of a ianic se is S = {(0, 0), (0, 1), (0, 2), (1, 1), (2,
0), (1, 0)}, where he line passing hrough (0, 1) and (2, 0) does no
pass hrough any oher poin in S.
On he oher hand, he se {(0, 0), (1, 1), (2, 2), (4, 4)} is no a
ianic se since he line passing hrough any wo poins in he se also
passes hrough he oher wo.
For any posiive ineger N, le T(N) be he number of ianic ses S whose
every poin (x, y) saisfies 0 x, y N.I can be verified ha T(1) =
11, T(2) = 494, T(4) = 33554178, T(111) mod 10^8 = 13500401 and
T(10^5)mod10^8 = 63259062.
Find T(10^11)mod10^8.
Answer: 2357ad217832274f444cae2a6580b193
Problem 416
===========
A row of n s
uares conains a frog in he lefmos s
uare. By successive
jumps he frog goes o he righmos s
uare and hen back o he lefmos
s
uare. On he ouward rip he jumps one, wo or hree s
uares o he
righ, and on he homeward rip he jumps o he lef in a similar manner.
He canno jump ouside he s
uares. He repeas he round-rip ravel m
imes.
Le F(m, n) be he number of he ways he frog can ravel so ha a mos
one s
uare remains unvisied.
For example, F(1, 3) = 4, F(1, 4) = 15, F(1, 5) = 46, F(2, 3) = 16 and
F(2, 100) mod 10^9 = 429619151.
Find he las 9 digis of F(10, 10^12).

Answer: 6f398386fdfec57ac166d4970c2bcad2
Problem 417
===========
A uni fracion conains 1 in he numeraor. The decimal represenaion of
he uni fracions wih denominaors 2 o 10 are given:
1/2
1/3
1/4
1/5
1/6
1/7
1/8
1/9
1/10

=
=
=
=
=
=
=
=
=

0.5
0.(3)
0.25
0.2
0.1(6)
0.(142857)
0.125
0.(1)
0.1

Where 0.1(6) means 0.166666..., and has a 1-digi recurring cycle. I can
be seen ha 1/7 has a 6-digi recurring cycle.
Uni fracions whose denominaor has no oher prime facors han 2 and/or
5 are no considered o have a recurring cycle.
We define he lengh of he recurring cycle of hose uni fracions as 0.
Le L(n) denoe he lengh of he recurring cycle of 1/n.You are given
ha L(n) for 3 n 1 000 000 e
uals 55535191115.
Find L(n) for 3 n 100 000 000
Answer: 93a7df08c972f1e7788516d056a7e016
Problem 418
===========
Le n be a posiive ineger. An ineger riple (a, b, c) is called a
facorisaion riple of n if:
1 a b c
abc = n.
Deine (n) to be a + b + c or the actorisation triple (a, b, c) o n
which minimises c / a. One can show that this triple is unique.
For example, (165) = 19, (100100) = 142 and (20!) = 4034872.
Find (43!).
Answer: b032468ddb4847d8a22737893797535
Problem 419
===========

The look and say sequence goes 1, 11, 21, 1211, 111221, 312211, 13112221,
1113213211, ...
The sequence starts with 1 and all other members are obtained by
describing the previous member in terms o consecutive digits.
It helps to do this out loud:
1 is 'one one' 11
11 is 'two ones' 21
21 is 'one two and one one' 1211
1211 is 'one one, one two and two ones' 111221
111221 is 'three ones, two twos and one one' 312211
...
Deine A(n), B(n) and C(n) as the number o ones, twos and threes in the
n'th element o the sequence respectively.
One can veriy that A(40) = 31254, B(40) = 20259 and C(40) = 11625.
Find A(n), B(n) and C(n) or n = 10^12.
Give your answer modulo 2^30 and separate your values or A, B and C by a
comma.
E.g. or n = 40 the answer would be 31254,20259,11625
Answer: b27db655498b3d64ad4338cdc9d178
Problem 420
===========
A positive integer matrix is a matrix whose elements are all positive
integers.
Some positive integer matrices can be expressed as a square o a positive
integer matrix in two dierent ways. Here is an example:
We deine F(N) as the number o the 2x2 positive integer matrices which
have a trace less than N and which can be expressed as a square o a
positive integer matrix in two dierent ways.
We can veriy that F(50) = 7 and F(1000) = 1019.
Find F(10^7).
p_420_matrix.gi
Answer: e265e34e34c54e8ceecd5e4b94b1381
Problem 421
===========
Numbers o the orm n^15+1 are composite or every integer n > 1.
For positive integers n and m let s(n,m) be deined as the sum o the
distinct prime actors o n^15+1 not exceeding m.
E.g. 2^15+1 = 3311331.
So s(2,10) = 3 and s(2,1000) = 3+11+331 = 345.
Also 10^15+1 = 7111321124121619091.
So s(10,100) = 31 and s(10,1000) = 483.

Find &Sum; s(n,10^8) or 1 n 10^11.

Answer: 481cc516cc1645b136c123ed660
Problem 422
===========
Let H be the hyperbola deined by the equation 12x^2 + 7xy - 12y^2 = 625.
Next, deine X as the point (7, 1). It can be seen that X is in H.
Now we deine a sequence o points in H, {P[i] : i 1}, as:
P[1] = (13, 61/4).
P[2] = (-43/6, -4).
For i > 2, P[i] is the unique point in H that is dierent rom P[i-1]
and such that line P[i]P[i-1] is parallel to line P[i-2]X. It can be
shown that P[i] is well-deined, and that its coordinates are always
rational.
You are given that P[3] = (-19/2, -229/24), P[4] = (1267/144, -37/12) and
P[7] = (17194218091/143327232, 274748766781/1719926784).
Find P[n] or n = 11^14 in the ollowing ormat:
I P[n] = (a/b, c/d) where the ractions are in lowest terms and the
denominators are positive, then the answer is (a + b + c + d) mod
1000000007.
For n = 7, the answer would have been: 806236837.
Answer: 7034610688a8851742912143c1bec
Problem 423
===========
Let n be a positive integer.
A 6-sided die is thrown n times. Let c be the number o pairs o
consecutive throws that give the same value.
For example, i n = 7 and the values o the die throws are
(1,1,5,6,6,6,3), then the ollowing pairs o consecutive throws give the
same value:
(1,1,5,6,6,6,3)
(1,1,5,6,6,6,3)
(1,1,5,6,6,6,3)
Thereore, c = 3 or (1,1,5,6,6,6,3).
Deine C(n) as the number o outcomes o throwing a 6-sided die n times
such that c does not exceed (n).^1
For examle, C(3) = 216, C(4) = 1290, C(11) = 361912500 and C(24) =
4727547363281250000.
Define S(L) as C(n) for 1 n L.

For examle, S(50) mod 1000000007 = 832833871.

Find S(50000000) mod 1000000007.
^1 denotes the rime counting function, i.e. (n) is the number of
rimes n.
Answer: e2add9d46ebd8ba59a07dca791cd629b
Problem 424
===========
The above is an examle of a crytic kakuro (also known as cross sums, or
even sums cross) uzzle, with its final solution on the right. (The common
rules of kakuro uzzles can be found easily on numerous internet sites.
Other related information can also be currently found at [1]krazydad.com
whose author has rovided the uzzle data for this challenge.)
The downloadable text file ([2]kakuro200.txt) contains the descrition of
200 such uzzles, a mix of 5x5 and 6x6 tyes. The first uzzle in the file
is the above examle which is coded as follows:
6,X,X,(vCC),(vI),X,X,X,(hH),B,O,(vCA),(vJE),X,(hFE,vD),O,O,O,O,(hA),O,I,(hJC,
vB),O,O,(hJC),H,O,O,O,X,X,X,(hJE),O,O,X
The first character is a numerical digit indicating the size of the
information grid. It would be either a 6 (for a 5x5 kakuro uzzle) or a 7
(for a 6x6 uzzle) followed by a comma (,). The extra to line and left
column are needed to insert information.
The content of each cell is then described and followed by a comma, going
left to right and starting with the to line.
X = Gray cell, not required to be filled by a digit.
O (uer case letter)= White emty cell to be filled by a digit.
A = Or any one of the uer case letters from A to J to be relaced by its
equivalent digit in the solved uzzle.
( ) = Location of the encryted sums. Horizontal sums are receded by a
lower case "h" and vertical sums are receded by a lower case "v". Those
are followed by one or two uer case letters deending if the sum is a
single digit or double digit one. For double digit sums, the first letter
would be for the "tens" and the second one for the "units". When the cell
must contain information for both a horizontal and a vertical sum, the
first one is always for the horizontal sum and the two are searated by a
comma within the same set of brackets, ex.: (hFE,vD). Each set of brackets
is also immediately followed by a comma.
The descrition of the last cell is followed by a Carriage Return/Line
Feed (CRLF) instead of a comma.
The required answer to each uzzle is based on the value of each letter
necessary to arrive at the solution and according to the alhabetical
order. As indicated under the examle uzzle, its answer would be
8426039571. At least 9 out of the 10 encryting letters are always art of
the roblem descrition. When only 9 are given, the missing one must be
assigned the remaining digit.
You are given that the sum of the answers for the first 10 uzzles in the

file is 64414157580.
Find the sum of the answers for the 200 uzzles.
Visible links
1. htt://krazydad.com/
2. kakuro200.txt
Answer: c412afe5b5d76dbfbb77443ed5836d89
Problem 425
===========
Two ositive numbers A and B are said to be connected (denoted by "A B")
if one of these conditions holds:
(1) A and B have the same length and differ in exactly one digit; for
examle, 123 173.
(2) Adding one digit to the left of A (or B) makes B (or A); for examle,
23 223 and 123 23.
We call a rime P a 2's relative if there exists a chain of connected
rimes between 2 and P and no rime in the chain exceeds P.
For examle, 127 is a 2's relative. One of the ossible chains is shown
below:
2 3 13 113 103 107 127
However, 11 and 103 are not 2's relatives.
Let F(N) be the sum of the rimes N which are not 2's relatives.
We can verify that F(10^3) = 431 and F(10^4) = 78728.
Find F(10^7).
Answer: 3d229894ba4c585138125e802af2d06e
Problem 426
===========
Consider an infinite row of boxes. Some of the boxes contain a ball. For
examle, an initial configuration of 2 consecutive occuied boxes followed
by 2 emty boxes, 2 occuied boxes, 1 emty box, and 2 occuied boxes can
be denoted by the sequence (2, 2, 2, 1, 2), in which the number of
consecutive occuied and emty boxes aear alternately.
A turn consists of moving each ball exactly once according to the
following rule: Transfer the leftmost ball which has not been moved to the
nearest emty box to its right.
After one turn the sequence (2, 2, 2, 1, 2) becomes (2, 2, 1, 2, 3) as can
be seen below; note that we begin the new sequence starting at the first
occuied box.
A system like this is called a Box Ball System or BBS for short.
It can be shown that after a sufficient number of turns, the system

evolves to a state where the consecutive numbers of occuied boxes is

invariant. In the examle below, the consecutive numbers of occuied boxes
evolves to [1, 2, 3]; we shall call this the final state.
We define the sequence {t[i]}:
s[0] = 290797
s[k+1] = s[k]^2 mod 50515093
t[k] = (s[k] mod 64) + 1
Starting from the initial configuration (t[0], t[1], , t[10]), the final
tate become [1, 3, 10, 24, 51, 75].
Starting from the initial configuration (t[0], t[1], , t[10 000 000]),
find the final tate.
Give a your anwer the um of the quare of the element of the final
tate. For example, if the final tate i [1, 2, 3] then 14 ( = 1^2 + 2^2
+ 3^2) i your anwer.
p_426_baxball1.gif
p_426_baxball2.gif
Anwer: b5d8157a351482da47da0512ca374007
Problem 427
===========
A equence of integer S = {[i]} i called an n-equence if it ha n
element and each element [i] atifie 1 [i] n. Thu there are n^n
ditinct n-equence in total.For example, the equence S = {1, 5, 5, 10,
7, 7, 7, 2, 3, 7} i a 10-equence.
For any equence S, let L(S) be the length of the longet contiguou
ubequence of S with the ame value.For example, for the given equence S
above, L(S) = 3, becaue of the three conecutive 7'.
Let f(n) = L(S) for all n-equence S.
For example, f(3) = 45, f(7) = 1403689 and f(11) = 481496895121.
Find f(7500000) mod 1000000009.
Anwer: ecb4da2c940b517c63d8d256814dd511
Problem 428
===========
Let
Let
and
Let
Let

a, b and c be poitive number.

W, X, Y, Z be four collinear point where |WX| = a, |XY| = b, |YZ| = c
|WZ| = a + b + c.
C[in] be the circle having the diameter XY.
C[out] be the circle having the diameter WZ.

The triplet (a, b, c) i called a necklace triplet if you can place k 3

ditinct circle C[1], C[2], ..., C[k] uch that:

C[i] ha no common

i j,
C[i] i tangent to
C[i] i tangent to
C[k] i tangent to

interior point with any C[j] for 1 i, j k and

both C[in] and C[out] for 1 i k,
C[i+1] for 1 i < k, and
C[1].

For example, (5, 5, 5) and (4, 3, 21) are necklace triplet, while it can
be hown that (2, 2, 5) i not.
Let T(n) be the number of necklace triplet (a, b, c) uch that a, b and c
are poitive integer, and b n.For example, T(1)=9, T(20)=732 and
T(3000)=438106.
Find T(1000000000).
Anwer: c6010c109b66b34bf3594e63eb58b446
Problem 429
===========
A unitary divior d of a number n i a divior of n that ha the property
gcd(d, n/d) = 1.
The unitary divior of 4! = 24 are 1, 3, 8 and 24.
The um of their quare i 1^2 + 3^2 + 8^2 + 24^2 = 650.
Let S(n) repreent the um of the quare of the unitary divior of n.
Thu S(4!)=650.
Find S(100 000 000!) modulo 1 000 000 009.
Anwer: ec4f87b0c01680e951326d9e85d2c03f
Problem 430
===========
N dik are placed in a row, indexed 1 to N from left to right.
Each dik ha a black ide and white ide. Initially all dik how their
white ide.
At each turn, two, not necearily ditinct, integer A and B between 1
and N (incluive) are choen uniformly at random.
All dik with an index from A to B (incluive) are flipped.
The following example how the cae N = 8. At the firt turn A = 5 and B
= 2, and at the econd turn A = 4 and B = 6.
Let E(N, M) be the expected number of dik that how their white ide
after M turn.
We can verify that E(3, 1) = 10/9, E(3, 2) = 5/3, E(10, 4) 5.157 and
E(100, 10) 51.893.
Find E(10^10, 4000).
Give your anwer rounded to 2 decimal place behind the decimal point.

p_430_flip.gif
Anwer: 32b0825d7a110a1a220e80629c413411
Problem 431
===========
Fred the farmer arrange to have a new torage ilo intalled on hi farm
and having an obeion for all thing quare he i abolutely devatated
when he dicover that it i circular. Quentin, the repreentative from
the company that intalled the ilo, explain that they only manufacture
cylindrical ilo, but he point out that it i reting on a quare bae.
Fred i not amued and init that it i removed from hi property.
Quick thinking Quentin explain that when granular material are delivered
from above a conical lope i formed and the natural angle made with the
horizontal i called the angle of repoe. For example if the angle of
repoe, $\alpha = 30$ degree, and grain i delivered at the centre of the
ilo then a perfect cone will form toward the top of the cylinder. In the
cae of thi ilo, which ha a diameter of 6m, the amount of pace wated
would be approximately 32.648388556 m^3. However, if grain i delivered at
a point on the top which ha a horizontal ditance of $x$ metre from the
centre then a cone with a trangely curved and loping bae i formed. He
how Fred a picture.
We hall let the amount of pace wated in cubic metre be given by
$V(x)$. If $x = 1.114785284$, which happen to have three quared decimal
place, then the amount of pace wated, $V(1.114785284) \approx 36$.
Given the range of poible olution to thi problem there i exactly one
other option: $V(2.511167869) \approx 49$. It would be like knowing that
the quare i king of the ilo, itting in plendid glory on top of your
grain.
Fred' eye light up with delight at thi elegant reolution, but on
cloer inpection of Quentin' drawing and calculation hi happine
turn to depondency once more. Fred point out to Quentin that it' the
radiu of the ilo that i 6 metre, not the diameter, and the angle of
repoe for hi grain i 40 degree. However, if Quentin can find a et of
olution for thi particular ilo then he will be more than happy to keep
it.
If Quick thinking Quentin i to atify frutratingly fuy Fred the
farmer' appetite for all thing quare then determine the value of $x$
for all poible quare pace watage option and calculate $\um x$
correct to 9 decimal place.
p_431_grain_ilo.png
Anwer: 5e5d81aa8bfaf92f68cdef0154c5c238
Problem 432
===========
Let S(n,m) = (n i) or 1 i m. ( is Euler's totient unction)
You are given that S(510510,10^6 )= 45480596821125120.

Find S(510510,10^11).
Give the last 9 digits o your answer.
Answer: e171c2872d650e47589842aa805707
Problem 433
===========
Let E(x[0], y[0]) be the number o steps it takes to determine the
greatest common divisor o x[0] and y[0] with Euclid's algorithm. More
ormally:
x[1] = y[0], y[1] = x[0] mod y[0]
x[n] = y[n-1], y[n] = x[n-1] mod y[n-1]
E(x[0], y[0]) is the smallest n such that y[n] = 0.
We have E(1,1) = 1, E(10,6) = 3 and E(6,10) = 4.
Deine S(N) as the sum o E(x,y) or 1 x,y N.
We have S(1) = 1, S(10) = 221 and S(100) = 39826.
Find S(510^6).
Answer: 0eeca9a5c25a2bae01104d6cd35
Problem 434
===========
Recall that a graph is a collection o vertices and edges connecting the
vertices, and that two vertices connected by an edge are called adjacent.
Graphs can be embedded in Euclidean space by associating each vertex with
a point in the Euclidean space.
A lexible graph is an embedding o a graph where it is possible to move
one or more vertices continuously so that the distance between at least
two nonadjacent vertices is altered while the distances between each pair
o adjacent vertices is kept constant.
A rigid graph is an embedding o a graph which is not lexible.
Inormally, a graph is rigid i by replacing the vertices with ully
rotating hinges and the edges with rods that are unbending and inelastic,
no parts o the graph can be moved independently rom the rest o the
graph.
The grid graphs embedded in the Euclidean plane are not rigid, as the
ollowing animation demonstrates:
However, one can make them rigid by adding diagonal edges to the cells.
For example, or the 2x3 grid graph, there are 19 ways to make the graph
rigid:
Note that or the purposes o this problem, we do not consider changing
the orientation o a diagonal edge or adding both diagonal edges to a cell
as a dierent way o making a grid graph rigid.
Let R(m,n) be the number o ways to make the m n grid graph rigid.
E.g. R(2,3) = 19 and R(5,5) = 23679901

Deine S(N) as R(i,j) or 1 i, j N.

E.g. S(5) = 25021721.
Find S(100), give your answer modulo 1000000033
Answer: 51d9d41a8ce217682321a020be6ec
Problem 435
===========
The Fibonacci numbers {[n], n 0} are deined recursively as [n] =
[n-1] + [n-2] with base cases [0] = 0 and [1] = 1.
Deine the polynomials {F[n], n 0} as F[n](x) = [i]x^i or 0 i n.
For example, F[7](x) = x + x^2 + 2x^3 + 3x^4 + 5x^5 + 8x^6 + 13x^7, and
F[7](11) = 268357683.
Let n = 10^15. Find the sum [[0x100] F[n](x)] mod 1307674368000 (=
15!).
Answer: 008231a97e872565a085de75743a1c
Problem 436
===========
Julie proposes the ollowing wager to her sister Louise.
She suggests they play a game o chance to determine who will wash the
dishes.
For this game, they shall use a generator o independent random numbers
uniormly distributed between 0 and 1.
The game starts with S = 0.
The irst player, Louise, adds to S dierent random numbers rom the
generator until S > 1 and records her last random number 'x'.
The second player, Julie, continues adding to S dierent random numbers
rom the generator until S > 2 and records her last random number 'y'.
The player with the highest number wins and the loser washes the dishes,
i.e. i y > x the second player wins.
For example, i the irst player draws 0.62 and 0.44, the irst player
turn ends since 0.62+0.44 > 1 and x = 0.44.
I the second players draws 0.1, 0.27 and 0.91, the second player turn
ends since 0.62+0.44+0.1+0.27+0.91 > 2 and y = 0.91.Since y > x, the
second player wins.
Louise thinks about it or a second, and objects: "That's not air".
What is the probability that the second player wins?
Give your answer rounded to 10 places behind the decimal point in the orm
0.abcdeghij
Answer: d797ed72189045e8ea48aa960ec13

Problem 437
===========
When we calculate 8^n modulo 11 or n=0 to 9 we get: 1, 8, 9, 6, 4, 10, 3,
2, 5, 7.
As we see all possible values rom 1 to 10 occur. So 8 is a primitive root
o 11.
But there is more:
I we take a closer look we see:
1+8=9
8+9=176 mod 11
9+6=154 mod 11
6+4=10
4+10=143 mod 11
10+3=132 mod 11
3+2=5
2+5=7
5+7=121 mod 11.
So the powers o 8 mod 11 are cyclic with period 10, and 8^n + 8^n+1
8^n+2 (mod 11).
8 is called a Fibonacci primitive root o 11.
Not every prime has a Fibonacci primitive root.
There are 323 primes less than 10000 with one or more Fibonacci primitive
roots and the sum o these primes is 1480491.
Find the sum o the primes less than 100,000,000 with at least one
Fibonacci primitive root.
Answer: 98bb66462d635d8225416a644e4637b0
Problem 438
===========
For an n-tuple o integers t = (a[1], ..., a[n]), let (x[1], ..., x[n]) be
the solutions o the polynomial equation x^n + a[1]x^n-1 + a[2]x^n-2 + ...
+ a[n-1]x + a[n] = 0.
Consider the ollowing two conditions:
x[1], ..., x[n] are all real.
I x[1], ..., x[n] are sorted, x[i] = i for 1 i n. (: floor
function.)
In the case of n = 4, there are 12 n-tuples of integers which satisfy both
conditions.
We define (t) as the sum of the absolute values of the integers in t.
For n = 4 we can verify that (t) = 2087 for all n-tuples t which satisfy
both conditions.
Find (t) for n = 7.
Answer: ?
Problem 439
===========

Let d(k) be the sum of all divisors of k.

We define the function (N) = [1iN] [1jN] d(ij).
For example, S(3) = d(1) + d(2) + d(3) + d(2) + d(4) + d(6) + d(3) + d(6)
+ d(9) = 59.
You are given that S(10^3) = 563576517282 and S(10^5) mod 10^9 =
215766508.
Find S(10^11) mod 10^9.
Answer: ?
Problem 440
===========
We want to tile a board o length n and height 1 completely, with either 1
2 blocks or 1 1 blocks with a single decimal digit on top:
For example, here are some o the ways to tile a board o length n = 8:
Let T(n) be the number o ways to tile a board o length n as described
above.
For example, T(1) = 10 and T(2) = 101.
Let S(L) be the triple sum [a,b,c] gcd(T(c^a), T(c^b)) or 1 a, b, c
L.
For example:
S(2) = 10444
S(3) = 1292115238446807016106539989
S(4) mod 987898789 = 670616280.
Find S(2000) mod 987898789.
Answer: ?
Problem 441
===========
For an integer M, we deine R(M) as the sum o 1/(pq) or all the integer
pairs p and q which satisy all o these conditions:
1 p < q M
p + q M
p and q are coprime.
We also deine S(N) as the sum o R(i) or 2 i N.
We can veriy that S(2) = R(2) = 1/2, S(10) 6.9147 and S(100) 58.2962.
Find S(10^7). Give your answer rounded to our decimal places.
Answer: 152cc2655461c5055db95a122280416

Problem 442
===========
An integer is called eleven-ree i its decimal expansion does not contain
any substring representing a power o 11 except 1.
For example, 2404 and 13431 are eleven-ree, while 911 and 4121331 are
not.
Let E(n) be the nth positive eleven-ree integer. For example, E(3) = 3,
E(200) = 213 and E(500000) = 531563.
Find E(10^18).
Answer: c31bb13db787bce9a169dce600aec863
Problem 443
===========
Let g(n) be a sequence deined as ollows:
g(4) = 13,
g(n) = g(n-1) + gcd(n, g(n-1)) or n > 4.
The irst ew values are:
n
4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 ...
g(n) 13 14 16 17 18 27 28 29 30 31 32 33 34 51 54 55 60 ...
You are given that g(1000) = 2524 and g(1000000) = 2624152.
Find g(10^15).
Answer: 289d9a9b8b3d606e0b711b5942aa
Problem 444
===========
A group o p people decide to sit down at a round table and play a
lottery-ticket trading game. Each person starts o with a
randomly-assigned, unscratched lottery ticket. Each ticket, when
scratched, reveals a whole-pound prize ranging anywhere rom
1 to
p,
with no two tickets alike. The goal o the game is or each person to
maximize his ticket winnings upon leaving the game.
An arbitrary person is chosen to be the irst player. Going around the
table, each player has only one o two options:
1. The player can scratch his ticket and reveal its worth to everyone at
the table.
2. The player can trade his unscratched ticket or a previous player's
scratched ticket, and then leave the game with that ticket. The previous

player then scratches his newly-acquired ticket and reveals its worth to
everyone at the table.
The game ends once all tickets have been scratched. All players still
remaining at the table must leave with their currently-held tickets.
Assume that each player uses the optimal strategy or maximizing the
expected value o his ticket winnings.
Let E(p) represent the expected number o players let at the table when
the game ends in a game consisting o p players (e.g. E(111)=5.2912 when
rounded to 5 signiicant digits).
Let S[1](N) = E(p)
Let S[k](N) = S[k-1](p) or k > 1
Find S[20](10^14) and write the answer in scientiic notation rounded to
10 signiicant digits. Use a lowercase e to separate mantissa and exponent
(e.g. S[3](100) = 5.983679014e5).
Answer: e6745c386ba3c0de1b56897e453c7c8
Problem 445
===========
For every integer n>1, the amily o unctions [n,a,b] is deined by
[n,a,b](x)ax+b mod n or a,b,x integer and 0<a<n, 0b<n, 0x<n.
We will call [n,a,b] a retraction i [n,a,b]([n,a,b](x))[n,a,b](x)
mod n or every 0x<n.
Let R(n) be the number o retractions or n.
You are given that
R(c) or c=C(100 000,k), and 1 k 99 999 628701600 (mod 1 000 000
007).
(C(n,k) is the binomial coeicient).
Find R(c) or c=C(10 000 000,k), and 1 k 9 999 999.
Give your answer modulo 1 000 000 007.
Answer: ?
Problem 446
===========
For every integer n>1, the amily o unctions [n,a,b] is deined by
[n,a,b](x)ax+b mod n or a,b,x integer and 0<a<n, 0b<n, 0x<n.
We will call [n,a,b] a retraction i [n,a,b]([n,a,b](x))[n,a,b](x)
mod n or every 0x<n.
Let R(n) be the number o retractions or n.
F(N)=R(n^4+4) or 1nN.
F(1024)=77532377300600.
Find F(10^7) (mod 1 000 000 007)

Answer: ?
Problem 447
===========
For every integer n>1, the amily o unctions [n,a,b] is deined by
[n,a,b](x)ax+b mod n or a,b,x integer and 0<a<n, 0b<n, 0x<n.
We will call [n,a,b] a retraction i [n,a,b]([n,a,b](x))[n,a,b](x)
mod n or every 0x<n.
Let R(n) be the number o retractions or n.
F(N)=R(n) or 2nN.
F(10^7)638042271 (mod 1 000 000 007).
Find F(10^14) (mod 1 000 000 007).
Answer: ?
Problem 448
===========
The unction lcm(a,b) denotes the least common multiple o a and b.
Let A(n) be the average o the values o lcm(n,i) or 1in.
E.g: A(2)=(2+2)/2=2 and A(10)=(10+10+30+20+10+30+70+40+90+10)/10=32.
Let S(n)=A(k) or 1kn.
S(100)=122726.
Find S(99999999019) mod 999999017.
Answer: e6e7e87005c7b070cbc08ce727ae4e6a
Problem 449
===========
Phil the conectioner is making a new batch o chocolate covered candy.
Each candy centre is shaped like an ellipsoid o revolution deined by the
equation: b^2x^2 + b^2y^2 + a^2z^2 = a^2b^2.
Phil wants to know how much chocolate is needed to cover one candy centre
with a uniorm coat o chocolate one millimeter thick.
I a=1 mm and b=1 mm, the amount o chocolate required is 28 mm^3
3
If a=2 mm and b=1 mm, the amount of chocolate required is aroximately
60.35475635 mm^3.
Find the amount of chocolate in mm^3 required if a=3 mm and b=1 mm. Give
your answer as the number rounded to 8 decimal laces behind the decimal

oint.
Answer: 8ac19d0d06980691526883bc8c0950ef
Problem 450
===========
A hyocycloid is the curve drawn by a oint on a small circle rolling
inside a larger circle. The arametric equations of a hyocycloid centered
at the origin, and starting at the right most oint is given by:
$x(t) = (R
$y(t) = (R

r) \cos(t) + r \cos(\frac {R
r) \sin(t) r \sin(\frac {R

r} r t)$
r} r t)$

Where R is the radius of the large circle and r the radius of the small
circle.
Let $C(R, r)$ be the set of distinct oints with integer coordinates on
the hyocycloid with radius R and r and for which there is a corresonding
value of t such that $\sin(t)$ and $\cos(t)$ are rational numbers.
Let $S(R, r) = \sum_{(x,y) \in C(R, r)} |x| + |y|$ be the sum of the
absolute values of the x and y coordinates of the oints in $C(R, r)$.
Let $T(N) = \sum_{R = 3}^N \sum_{r=1}^{\lfloor \frac {R
1} 2 \rfloor}
S(R, r)$ be the sum of $S(R, r)$ for R and r ositive integers, $R\leq N$
and $2r < R$.
You are given:
C(3, 1) = {(3, 0), ( 1, 2), ( 1,0), ( 1, 2)}
C(2500, 1000) =
{(2500, 0), (772, 2376), (772, 2376), (516, 1792), (516, 1792), (500,
0), (68, 504), (68, 504),
( 1356, 1088), ( 1356, 1088), ( 1500, 1000), ( 1500, 1000)}
Note: ( 625, 0) is not an element of C(2500, 1000) because $\sin(t)$ is
not a rational number for the corresonding values of t.
S(3, 1) = (|3| + |0|) + (| 1| + |2|) + (| 1| + |0|) + (| 1| + | 2|) = 10
T(3) = 10; T(10) = 524 ;T(100) = 580442; T(10^3) = 583108600.
Find T(10^6).
Answer: ?
Problem 451
===========
Consider the number 15.
There are eight ositive numbers less than 15 which are corime to 15: 1,
2, 4, 7, 8, 11, 13, 14.

The modular inverses of these numbers modulo 15 are: 1, 8, 4, 13, 2, 11,

7, 14
because
1*1 mod 15=1
2*8=16 mod 15=1
4*4=16 mod 15=1
7*13=91 mod 15=1
11*11=121 mod 15=1
14*14=196 mod 15=1
Let I(n) be the largest ositive number m smaller than n 1 such that the
modular inverse of m modulo n equals m itself.
So I(15)=11.
Also I(100)=51 and I(7)=1.
Find I(n) for 3n210^7
Answer: 9848878734a1d751a0e428147ab0b4aa
Problem 452
===========
Deine F(m,n) as the number o n-tuples o positive integers or which the
product o the elements doesn't exceed m.
F(10, 10) = 571.
F(10^6, 10^6) mod 1234567891 = 252903833.
Find F(10^9, 10^9) mod 1234567891.
Answer: a7550818cab61a160caa2c4145ed23
Problem 453
===========
A simple quadrilateral is a polygon that has our distinct vertices, has
no straight angles and does not sel-intersect.
Let Q(m, n) be the number o simple quadrilaterals whose vertices are
lattice points with coordinates (x,y) satisying 0 x m and 0 y n.
For example, Q(2, 2) = 94 as can be seen below:
It can also be veriied that Q(3, 7) = 39590, Q(12, 3) = 309000 and Q(123,
45) = 70542215894646.
Find Q(12345, 6789) mod 135707531.
Answer: ?
Problem 454

===========
In the ollowing equation x, y, and n are positive integers.
1 1 1
+ =
x y n
For a limit L we deine F(L) as the number o solutions which satisy x <
y L.
We can veriy that F(15) = 4 and F(1000) = 1069.
Find F(10^12).
Answer: c4e4550c511e558b3dccb3ed481cb5
Problem 455
===========
Let (n) be the largest positive integer x less than 10^9 such that the
last 9 digits o n^x orm the number x (including leading zeros), or zero
i no such integer exists.
For example:
(4) = 411728896 (4^411728896 = ...490411728896)
(10) = 0
(157) = 743757 (157^743757 = ...567000743757)
f(n), 2 n 10^3 = 442530011399
Find f(n), 2 n 10^6.
Answer: 22d6cf30a29e14e5c78dca980edc2796
Problem 456
===========
Define:
x[n] = (1248^n mod 32323) - 16161
y[n] = (8421^n mod 30103) - 15051
P[n] = {(x[1], y[1]), (x[2], y[2]), ..., (x[n], y[n])}
For example, P[8] = {(-14913, -6630), (-10161, 5625), (5226, 11896),
(8340, -10778), (15852, -5203), (-15165, 11295), (-1427, -14495), (12407,
1060)}.
Let C(n) be the number of triangles whose vertices are in P[n] which
contain the origin in the interior.
Examples:
C(8) = 20
C(600) = 8950634
C(40000) = 2666610948988

Find C(2000000).
Answer: e2811a92b4658ca420be740f6c66572b
Problem 457
===========
Let f(n) = n^2 - 3n - 1.
Let p be a prime.
Let R(p) be the smallest positive integer n such that f(n) mod p^2 = 0 if
such an integer n exists, otherwise R(p) = 0.
Let R(L) be &um;R(p) for all primes not exceeding L.
Find R(10^7).
Answer: 5eae79c2f4887f6cf08c099840317a51
Problem 458
===========
Consider the alphabet A made out of the letters of the word "project":
A={c,e,j,o,p,r,t}.
Let T(n) be the number of strings of length n consisting of letters from A
that do not have a substring that is one of the 5040 permutations of
"project".
T(7)=7^7-7!=818503.
Find T(10^12). Give the last 9 digits of your answer.
Answer: ?
Problem 459
===========
The flipping game is a two player game played on a N by N square board.
Each square contains a disk with one side white and one side black.
The game starts with all disks showing their white side.
A turn consists of flipping all disks in a rectangle with the following
properties:
the upper right corner of the rectangle contains a white disk
the rectangle width is a perfect square (1, 4, 9, 16, ...)
the rectangle height is a triangular number (1, 3, 6, 10, ...)
Players alternate turns. A player wins by turning the grid all black.
Let W(N) be the number of winning moves for the first player on a N by N

board with all disks white, assuming perfect play.

W(1) = 1, W(2) = 0, W(5) = 8 and W(10^2) = 31395.
For N=5, the first player's eight winning first moves are:
Find W(10^6).
Answer: ?
Problem 460
===========
On the Euclidean plane, an ant travels from point A(0, 1) to point B(d, 1)
for an integer d.
In each step, the ant at point (x[0], y[0]) chooses one of the lattice
points (x[1], y[1]) which satisfy x[1] 0 and y[1] 1 and goes straight
to (x[1], y[1]) at a constant velocity v. The value of v depends on y[0]
and y[1] as follows:
If y[0] = y[1], the value of v equals y[0].
If y[0] y[1], the value of v equals (y[1] - y[0]) / (ln(y[1]) ln(y[0])).
The left image is one of the possible paths for d = 4. First the ant goes
from A(0, 1) to P[1](1, 3) at velocity (3 - 1) / (ln(3) - ln(1)) 1.8205.
Then the required time is sqrt(5) / 1.8205 1.2283.
From P[1](1, 3) to P[2](3, 3) the ant travels at velocity 3 so the
required time is 2 / 3 0.6667. From P[2](3, 3) to B(4, 1) the ant
travels at velocity (1 - 3) / (ln(1) - ln(3)) 1.8205 so the required
time is sqrt(5) / 1.8205 1.2283.
Thus the total required time is 1.2283 + 0.6667 + 1.2283 = 3.1233.
The right image is another path. The total required time is calculated as
0.98026 + 1 + 0.98026 = 2.96052. It can be shown that this is the quickest
path for d = 4.
Let F(d) be the total required time if the ant chooses the quickest path.
For example, F(4) 2.960516287.
We can verify that F(10) 4.668187834 and F(100) 9.217221972.
Find F(10000). Give your answer rounded to nine decimal places.
Answer: 134fd9e25365ddb970971dd21f386408
Problem 461
===========
Let f[n](k)=e^k/n-1, for all non-negative integers k.
Remarkably, f[200](6)+f[200](75)+f[200](89)+f[200](226)=
3.141592644529.
In fact, it is the best aroximation of of the form

f[n](a)+f[n](b)+f[n](c)+f[n](d) for n=200.

Let g(n)=a^2+b^2+c^2+d^ 2 for a, b, c, d that minimize the error:
|f[n](a)+f[n](b)+f[n](c)+f[n](d) |
(where |x| denotes the absolute value of x).
You are given g(200)=6^2+75^2+89^2+226^2=64658.
Find g(10000). ^
Answer: 70c3eff774c9d5cdb29284c16b9d1bc6
Problem 462
===========
A 3 smooth number is an integer which has no rime factor larger than 3.
For an integer N, we define S(N) as the set of 3 smooth numbers less than
or equal to N . For examle, S(20) = { 1, 2, 3, 4, 6, 8, 9, 12, 16, 18 }.
We define F(N) as the number of ermutations of S(N) in which each element
comes after all of its roer divisors.
This
1,
This
1,

is
2,
is
2,

one of the ossible ermutations for N = 20.

4, 3, 9, 8, 16, 6, 18, 12.
not a valid ermutation because 12 comes before its divisor 6.
4, 3, 9, 8, 12, 16, 6, 18.

We can verify that F(6) = 5, F(8) = 9, F(20) = 450 and F(1000)

8.8521816557e21.
Find F(10^18). Give as your answer its scientific notation rounded to ten
digits after the decimal oint.
When giving your answer, use a lowercase e to searate mantissa and
exonent. E.g. if the answer is 112,233,445,566,778,899 then the answer
format would be 1.1223344557e17.
Answer: ?
Problem 463
===========
The function $f$ is defined for all ositive integers as follows:
$f(1)=1$
$f(3)=3$
$f(2n)=f(n)$
$f(4n + 1)=2f(2n + 1)
$f(4n + 3)=3f(2n + 1)

f(n)$
2f(n)$

The function $S(n)$ is defined as $\sum_{i=1}^{n}f(i)$.

$S(8)=22$ and $S(100)=3604$.
Find $S(3^{37})$. Give the last 9 digits of your answer.

Answer: 95481696a65b0c1d9f73186a693686f5
Problem 464
===========
The Mbius function, denoted (n), is defined as:
(n) = ( 1)^(n) if n is squarefree (here (n) is the number of
distinct prime factors of n)
(n) = 0 if n is not squarefree.
Let P(a,b) be the number of integers n in the interval [a,b] such that
(n) = 1.
Let N(a,b) be the number of integers n in the interval [a,b] such that
(n) = 1.
For examle, P(2,10) = 2 and N(2,10) = 4.
Let C(n) be the number of integer airs (a,b) such that:
1abn,
99N(a,b)100P(a,b), and
99P(a,b)100N(a,b).
For example, C(10)=13, C(500)=16676 and C(10000)=20155319.
Find C(20000000).
Answer: ?
Problem 465
===========
The kernel o a polygon is deined by the set o points rom which the
entire polygon's boundary is visible. We deine a polar polygon as a
polygon or which the origin is strictly contained inside its kernel.
For this problem, a polygon can have collinear consecutive vertices.
However, a polygon still cannot have sel-intersection and cannot have
zero area.
For example, only the irst o the ollowing is a polar polygon (the
kernels o the second, third, and ourth do not strictly contain the
origin, and the ith does not have a kernel at all):
Notice that the irst polygon has three consecutive collinear vertices.
Let P(n) be the number o polar polygons such that the vertices (x, y)
have integer coordinates whose absolute values are not greater than n.
Note that polygons should be counted as dierent i they have dierent
set o edges, even i they enclose the same area. For example, the polygon
with vertices [(0,0),(0,3),(1,1),(3,0)] is distinct rom the polygon with
vertices [(0,0),(0,3),(1,1),(3,0),(1,0)].

For example, P(1) = 131, P(2) = 1648531, P(3) = 1099461296175 and P(343)
mod 1000000007 = 937293740.
Find P(7^13) mod 1000000007.
Answer: ?
Problem 466
===========
Let P(m,n) be the number o distinct terms in an mn multiplication table.
For example, a 34 multiplication table looks like this:

1
2
3

1
1
2
3

2
2
4
6

3
3
6
9

There are 8 distinct terms {1,2,3,4,6,8,9,12}, thereore P(3,4) = 8.

You are given that:
P(64,64) = 1263,
P(12,345) = 1998, and
P(32,10^15) = 13826382602124302.
Find P(64,10^16).
Answer: ?
Problem 467
===========
An integer s is called a superinteger o another integer n i the digits
o n orm a subsequence o the digits o s.
For example, 2718281828 is a superinteger o 18828, while 314159 is not a
superinteger o 151.
Let p(n) be
number. For
{p(i) : i
{c(i) : i

the nth prime number, and let c(n) be

example, p(1) = 2, p(10) = 29, c(1) =
1} = {2, 3, 5, 7, 11, 13, 17, 19, 23,
1} = {4, 6, 8, 9, 10, 12, 14, 15, 16,

the nth composite

4 and c(10) = 18.
29, ...}
18, ...}

Let P^D the sequence o the digital roots o {p(i)} (C^D is deined
similarly or {c(i)}):
P^D = {2, 3, 5, 7, 2, 4, 8, 1, 5, 2, ...}
C^D = {4, 6, 8, 9, 1, 3, 5, 6, 7, 9, ...}
Let P[n] be the integer ormed by concatenating the irst n elements o
P^D (C[n] is deined similarly or C^D).
P[10] = 2357248152
C[10] = 4689135679
Let (n) be the smallest positive integer that is a common superinteger o

4
4
8
12

P[n] and C[n].

For example, (10) = 2357246891352679, and (100) mod 1000000007 =
771661825.
Find (10000) mod 1000000007.
Answer: ?
Problem 468
===========
An integer is called B-smooth i none o its prime actors is greater than
B.
Let S[B](n) be the largest B-smooth divisor o n.
Examples:
S[1](10) = 1
S[4](2100) = 12
S[17](2496144) = 5712
Deine F(n) = [1Bn] [0rn] S[B](C(n,r)). Here, C(n,r) denotes the
binomial coeicient.
Examples:
F(11) = 3132
F(1111) mod 1000000993 = 706036312
F(111111) mod 1000000993 = 22156169
Find F(11111111) mod 1000000993.
Answer: ?
Problem 469
===========
In a room N chairs are placed around a round table.
Knights enter the room one by one and choose at random an available empty
chair.
To have enough elbow room the knights always leave at least one empty
chair between each other.
When there aren't any suitable chairs let, the raction C o empty chairs
is determined.
We also deine E(N) as the expected value o C.
We can veriy that E(4) = 1/2 and E(6) = 5/9.
Find E(10^18). Give your answer rounded to ourteen decimal places in the
orm 0.abcdeghijklmn.
Answer: 3c2b641262880db5b735ca4d4c957bc
Problem 470
===========

Consider a single game o Ramvok:

Let t represent the maximum number o turns the game lasts. I t = 0, then
the game ends immediately. Otherwise, on each turn i, the player rolls a
die. Ater rolling, i i < t the player can either stop the game and
receive a prize equal to the value o the current roll, or discard the
roll and try again next turn. I i = t, then the roll cannot be discarded
and the prize must be accepted. Beore the game begins, t is chosen by the
player, who must then pay an up-ront cost ct or some constant c. For c =
0, t can be chosen to be ininite (with an up-ront cost o 0). Let R(d,
c) be the expected proit (i.e. net gain) that the player receives rom a
single game o optimally-played Ramvok, given a air d-sided die and cost
constant c. For example, R(4, 0.2) = 2.65. Assume that the player has
suicient unds or paying any/all up-ront costs.
Now consider a game o Super Ramvok:
In Super Ramvok, the game o Ramvok is played repeatedly, but with a
slight modiication. Ater each game, the die is altered. The alteration
process is as ollows: The die is rolled once, and i the resulting ace
has its pips visible, then that ace is altered to be blank instead. I
the ace is already blank, then it is changed back to its original value.
Ater the alteration is made, another game o Ramvok can begin (and during
such a game, at each turn, the die is rolled until a ace with a value on
it appears). The player knows which aces are blank and which are not at
all times. The game o Super Ramvok ends once all aces o the die are
blank.
Let S(d, c) be the expected proit that the player receives rom an
optimally-played game o Super Ramvok, given a air d-sided die to start
(with all sides visible), and cost constant c. For example, S(6, 1) =
208.3.
Let F(n) = [4dn] [0cn] S(d, c).
Calculate F(20), rounded to the nearest integer.
Answer: ?
Problem 471
===========
The triangle ABC is inscribed in an ellipse with equation $\rac {x^2}
{a^2} + \rac {y^2} {b^2} = 1$, 0<2b<a, a and b integers.
Let r(a,b) be the radius o the incircle o ABC when the incircle has
center (2b, 0) and A has coordinates $\let( \rac a 2, \rac {\sqrt 3} 2
b\right)$.
For example, r(3,1)=, r(6,2)=1, r(12,3)=2.
Let $G(n) = \sum_{a=3}^n \sum_{b=1}^{\lloor \rac {a - 1} 2 \rloor} r(a,
b)$
You are given G(10) = 20.59722222, G(100) = 19223.60980 (rounded to 10

signiicant digits).
Find G(10^11).
Give your answer in scientiic notation rounded to 10 signiicant digits.
Use a lowercase e to separate mantissa and exponent.
For G(10) the answer would have been 2.059722222e1.
Answer: ?
Problem 472
===========
There are N seats in a row. N people come one ater another to ill the
seats according to the ollowing rules:
1.No person sits beside another.
2.The irst person chooses any seat.
3.Each subsequent person chooses the seat urthest rom anyone else
already seated, as long as it does not violate rule 1. I there is
more than one choice satisying this condition, then the person
chooses the letmost choice.
Note that due to rule 1, some seats will surely be let unoccupied, and
the maximum number o people that can be seated is less than N (or N >
1).
Here are the possible seating arrangements or N = 15:
We
up
We
o

see that i the irst person chooses correctly, the 15 seats can seat
to 7 people.
can also see that the irst person has 9 choices to maximize the number
people that may be seated.

Let (N) be the number o choices the irst person has to maximize the
number o occupants or N seats in a row. Thus, (1)=1, (15)=9,
(20)=6, and (500)=16.
Also, (N) = 83 or 1N20 and (N) = 13343 or 1N500.
Find (N) or 1N10^12. Give the last 8 digits o your answer.
Answer: ?
Problem 473
===========
Let $\varphi$ be the golden ratio: $\varphi=\rac{1+\sqrt{5}}{2}.$
Remarkably it is possible to write every positive integer as a sum o
powers o $\varphi$ even i we require that every power o $\varphi$ is
used at most once in this sum.
Even then this representation is not unique.
We can make it unique by requiring that no powers with consecutive

exponents are used and that the representation is inite.

E.g: $2=\varphi+\varphi^{-2}$ and $3=\varphi^{2}+\varphi^{-2}$
To represent this sum o powers o $\varphi$ we use a string o 0's and
1's with a point to indicate where the negative exponents start.
We call this the representation in the phigital numberbase.
So $1=1_{\varphi}$, $2=10.01_{\varphi}$, $3=100.01_{\varphi}$ and
$14=100100.001001_{\varphi}$.
The strings representing 1, 2 and 14 in the phigital number base are
palindromic, while the string representating 3 is not.
(the phigital point is not the middle character).
The sum o the positive integers not exceeding 1000 whose phigital
representation is palindromic is 4345.
Find the sum o the positive integers not exceeding $10^{10}$ whose
phigital representation is palindromic.
Answer: a4ea7a2040b6385b6d12863d693e434
Problem 474
===========
For
the
For
14,

a positive integer n and digits d, we deine F(n, d) as the number o

divisors o n whose last digits equal d.
example, F(84, 4) = 3. Among the divisors o 84 (1, 2, 3, 4, 6, 7, 12,
21, 28, 42, 84), three o them (4, 14, 84) have the last digit 4.

We can also veriy that F(12!, 12) = 11 and F(50!, 123) = 17888.
Find F(10^6!, 65432) modulo (10^16 + 61).
Answer: ?
Problem 475
===========
12n musicians participate at a music estival. On the irst day, they orm
3n quartets and practice all day.
It is a disaster. At the end o the day, all musicians decide they will
never again agree to play with any member o their quartet.
On the second day, they orm 4n trios, each musician avoiding his previous
quartet partners.
Let (12n) be the number o ways to organize the trios amongst the 12n
musicians.
You are given (12) = 576 and (24) mod 1 000 000 007 = 509089824.
Find (600) mod 1 000 000 007.

Answer: 6be2411783d9ca8e7ad174b269a85be5
Problem 476
===========
Let R(a, b, c) be the maximum area covered by three non-overlapping
circles inside a triangle with edge lengths a, b and c.
Let S(n) be the average value o R(a, b, c) over all integer triplets (a,
b, c) such that 1abc<a+bn
You are given S(2) = R(1, 1, 1) 0.31998, S(5) 1.25899.
Find S(1803) rounded to 5 decimal places behind the decimal point.
Answer: 4d6a99b2a022a561aeeb69c0126e