6cfd0fc503
* fix: improve Project Euler descriptions and test case Improve formatting of Project Euler test descriptions. Also add poker hands array and new test case for problem 54 * feat: add typeof tests and gave functions proper names for first 100 challenges * fix: continue fixing test descriptions and adding "before test" sections * fix: address review comments * fix: adjust grids in 18 and 67 and fix some text that reference files rather than the given arrays * fix: implement bug fixes and improvements from review * fix: remove console.log statements from seed and solution
2.1 KiB
2.1 KiB
id, challengeType, title, forumTopicId
| id | challengeType | title | forumTopicId |
|---|---|---|---|
| 5900f3861000cf542c50fe99 | 5 | Problem 26: Reciprocal cycles | 301908 |
Description
A unit fraction contains 1 in the numerator. The decimal representation of the unit fractions with denominators 2 to 10 are given:
1/2 = 0.5
1/3 = 0.(3)
1/4 = 0.25
1/5 = 0.2
1/6 = 0.1(6)
1/7 = 0.(142857)
1/8 = 0.125
1/9 = 0.(1)
1/10 = 0.1
Where 0.1(6) 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 < n for which 1/d contains the longest recurring cycle in its decimal fraction part.
Instructions
Tests
tests:
- text: <code>reciprocalCycles(700)</code> should return a number.
testString: assert(typeof reciprocalCycles(700) === 'number');
- text: <code>reciprocalCycles(700)</code> should return 659.
testString: assert(reciprocalCycles(700) == 659);
- text: <code>reciprocalCycles(800)</code> should return 743.
testString: assert(reciprocalCycles(800) == 743);
- text: <code>reciprocalCycles(900)</code> should return 887.
testString: assert(reciprocalCycles(900) == 887);
- text: <code>reciprocalCycles(1000)</code> should return 983.
testString: assert(reciprocalCycles(1000) == 983);
Challenge Seed
function reciprocalCycles(n) {
// Good luck!
return n;
}
reciprocalCycles(1000);
Solution
// solution required