Files
freeCodeCamp/curriculum/challenges/english/10-coding-interview-prep/project-euler/problem-71-ordered-fractions.english.md
Oliver Eyton-Williams bd68b70f3d Feat: hide blocks not challenges (#39504)
* fix: remove isHidden flag from frontmatter

* fix: add isUpcomingChange

Co-authored-by: Ahmad Abdolsaheb <ahmad.abdolsaheb@gmail.com>

* feat: hide blocks not challenges

Co-authored-by: Ahmad Abdolsaheb <ahmad.abdolsaheb@gmail.com>

Co-authored-by: Ahmad Abdolsaheb <ahmad.abdolsaheb@gmail.com>
2020-09-03 15:07:40 -07:00

1.5 KiB

id, challengeType, title, forumTopicId
id challengeType title forumTopicId
5900f3b31000cf542c50fec6 5 Problem 71: Ordered fractions 302184

Description

Consider the fraction, n/d, where n and d are positive integers. If n<d and HCF(n,d)=1, it is called a reduced proper fraction.

If we list the set of reduced proper fractions for d ≤ 8 in ascending order of 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 fraction immediately to the left of 3/7.

By listing the set of reduced proper fractions for d ≤ 1,000,000 in ascending order of size, find the numerator of the fraction immediately to the left of 3/7.

Instructions

Tests

tests:
  - text: <code>orderedFractions()</code> should return a number.
    testString: assert(typeof orderedFractions() === 'number');
  - text: <code>orderedFractions()</code> should return 428570.
    testString: assert.strictEqual(orderedFractions(), 428570);

Challenge Seed

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

orderedFractions();

Solution

// solution required