2018-09-30 22:01:58 +00:00
---
id: 5900f4ab1000cf542c50ffbd
title: 'Problem 318: 2011 nines'
2020-11-27 18:02:05 +00:00
challengeType: 5
2019-08-05 16:17:33 +00:00
forumTopicId: 301974
2021-01-13 02:31:00 +00:00
dashedName: problem-318-2011-nines
2018-09-30 22:01:58 +00:00
---
2020-11-27 18:02:05 +00:00
# --description--
2018-09-30 22:01:58 +00:00
Consider the real number √2+√3.
2020-11-27 18:02:05 +00:00
2018-09-30 22:01:58 +00:00
When we calculate the even powers of √2+√3
2020-11-27 18:02:05 +00:00
2018-09-30 22:01:58 +00:00
we get:
2020-11-27 18:02:05 +00:00
2018-09-30 22:01:58 +00:00
(√2+√3)2 = 9.898979485566356...
2020-11-27 18:02:05 +00:00
2018-09-30 22:01:58 +00:00
(√2+√3)4 = 97.98979485566356...
2020-11-27 18:02:05 +00:00
2018-09-30 22:01:58 +00:00
(√2+√3)6 = 969.998969071069263...
2020-11-27 18:02:05 +00:00
2018-09-30 22:01:58 +00:00
(√2+√3)8 = 9601.99989585502907...
2020-11-27 18:02:05 +00:00
2018-09-30 22:01:58 +00:00
(√2+√3)10 = 95049.999989479221...
2020-11-27 18:02:05 +00:00
(√2+√3)12 = 940897.9999989371855...
2018-09-30 22:01:58 +00:00
2020-11-27 18:02:05 +00:00
(√2+√3)14 = 9313929.99999989263...
2018-09-30 22:01:58 +00:00
2020-11-27 18:02:05 +00:00
(√2+√3)16 = 92198401.99999998915...
2018-09-30 22:01:58 +00:00
2020-11-27 18:02:05 +00:00
It looks like that the number of consecutive nines at the beginning of the fractional part of these powers is non-decreasing. In fact it can be proven that the fractional part of (√2+√3)2n approaches 1 for large n.
2018-09-30 22:01:58 +00:00
2020-11-27 18:02:05 +00:00
Consider all real numbers of the form √p+√q with p and q positive integers and p< q, such that the fractional part of (√p+√q)2n approaches 1 for large n.
2018-09-30 22:01:58 +00:00
2020-11-27 18:02:05 +00:00
Let C(p,q,n) be the number of consecutive nines at the beginning of the fractional part of (√p+√q)2n.
2018-09-30 22:01:58 +00:00
Let N(p,q) be the minimal value of n such that C(p,q,n) ≥ 2011.
Find ∑N(p,q) for p+q ≤ 2011.
2020-11-27 18:02:05 +00:00
# --hints--
2018-09-30 22:01:58 +00:00
2020-11-27 18:02:05 +00:00
`euler318()` should return 709313889.
2018-09-30 22:01:58 +00:00
2020-11-27 18:02:05 +00:00
```js
assert.strictEqual(euler318(), 709313889);
2018-09-30 22:01:58 +00:00
```
2020-11-27 18:02:05 +00:00
# --seed--
2018-09-30 22:01:58 +00:00
2020-11-27 18:02:05 +00:00
## --seed-contents--
2018-09-30 22:01:58 +00:00
```js
function euler318() {
2020-09-15 16:57:40 +00:00
2018-09-30 22:01:58 +00:00
return true;
}
euler318();
```
2020-11-27 18:02:05 +00:00
# --solutions--
2018-09-30 22:01:58 +00:00
```js
// solution required
```