project_euler.problem_073.sol1 ============================== .. py:module:: project_euler.problem_073.sol1 .. autoapi-nested-parse:: Project Euler Problem 73: https://projecteuler.net/problem=73 Consider the fraction, n/d, where n and d are positive integers. If n int Returns number of fractions lie between 1/3 and 1/2 in the sorted set of reduced proper fractions for d ≤ max_d >>> solution(4) 0 >>> solution(5) 1 >>> solution(8) 3