2018-10-10 22:03:03 +00:00
---
id: 5900f4421000cf542c50ff55
2021-02-06 04:42:36 +00:00
title: 'Problem 214: Totient Chains'
2018-10-10 22:03:03 +00:00
challengeType: 5
2021-02-06 04:42:36 +00:00
forumTopicId: 301856
2021-01-13 02:31:00 +00:00
dashedName: problem-214-totient-chains
2018-10-10 22:03:03 +00:00
---
2020-12-16 07:37:30 +00:00
# --description--
2018-10-10 22:03:03 +00:00
2021-02-06 04:42:36 +00:00
Let φ be Euler's totient function, i.e. for a natural number n,
2018-10-10 22:03:03 +00:00
2021-02-06 04:42:36 +00:00
φ(n) is the number of k, 1 ≤ k ≤ n, for which gcd(k,n) = 1.
2018-10-10 22:03:03 +00:00
2021-02-06 04:42:36 +00:00
By iterating φ, each positive integer generates a decreasing chain of numbers ending in 1. E.g. if we start with 5 the sequence 5,4,2,1 is generated. Here is a listing of all chains with length 4:
2018-10-10 22:03:03 +00:00
2021-02-06 04:42:36 +00:00
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
2018-10-10 22:03:03 +00:00
2021-02-06 04:42:36 +00:00
Only two of these chains start with a prime, their sum is 12.
What is the sum of all primes less than 40000000 which generate a chain of length 25?
2018-10-10 22:03:03 +00:00
2020-12-16 07:37:30 +00:00
# --hints--
2018-10-10 22:03:03 +00:00
2021-02-06 04:42:36 +00:00
`euler214()` should return 1677366278943.
2018-10-10 22:03:03 +00:00
```js
2020-12-16 07:37:30 +00:00
assert.strictEqual(euler214(), 1677366278943);
2018-10-10 22:03:03 +00:00
```
2021-01-13 02:31:00 +00:00
# --seed--
## --seed-contents--
```js
function euler214() {
return true;
}
euler214();
```
2020-12-16 07:37:30 +00:00
# --solutions--
2020-08-13 15:24:35 +00:00
2021-01-13 02:31:00 +00:00
```js
// solution required
```