freeCodeCamp/problem-337-totient-stairstep-sequences.english.md at 9e4583b1f36a4ecaabc48b51e1445bb992692676

Files

Valeriy 79d9012432 fix(curriculum): quotes in tests (#18828 )

* fix(curriculum): tests quotes

* fix(curriculum): fill seed-teardown

* fix(curriculum): fix tests and remove unneeded seed-teardown

2018-10-20 23:32:47 +05:30

1.1 KiB

Raw Blame History

id, challengeType, title

id	challengeType	title
5900f4be1000cf542c50ffd0	5	Problem 337: Totient Stairstep Sequences

Description

Let {a1, a2,..., an} be an integer sequence of length n such that: a1 = 6 for all 1 ≤ i < n : φ(ai) < φ(ai+1) < ai < ai+11 Let S(N) be the number of such sequences with an ≤ N. For example, S(10) = 4: {6}, {6, 8}, {6, 8, 9} and {6, 10}. We can verify that S(100) = 482073668 and S(10 000) mod 108 = 73808307.

Find S(20 000 000) mod 108.

1 φ denotes Euler's totient function.

Instructions

Tests

tests:
  - text: <code>euler337()</code> should return 85068035.
    testString: assert.strictEqual(euler337(), 85068035, '<code>euler337()</code> should return 85068035.');

Challenge Seed

function euler337() {
  // Good luck!
  return true;
}

euler337();

Solution

// solution required

1.1 KiB Raw Blame History