This is a combination of 2 commits.

Brute-forced P73 using Python.

README.md

@@ -118,6 +118,7 @@ such as (but not limited to) Bard and ChatGPT.
 |[69](https://projecteuler.net/problem=69)|[`totient_maximum.rs`](src/solutions/totient_maximum.rs)|
 |[71](https://projecteuler.net/problem=71)|[`ordered_fractions.rs`](src/solutions/ordered_fractions.rs)|
 |[72](https://projecteuler.net/problem=72)|[`counting_fractions.rs`](src/solutions/counting_fractions.rs)|
+|[73](https://projecteuler.net/problem=73)|[`counting_fractions_in_a_range.rs`](src/solutions/counting_fractions_in_a_range.rs)|
 |[74](https://projecteuler.net/problem=74)|[`digit_factorial_chains.rs`](src/solutions/digit_factorial_chains.rs)|
 |[75](https://projecteuler.net/problem=75)|[`singular_integer_right_triangles.rs`](src/solutions/singular_integer_right_triangles.rs)|
 |[76](https://projecteuler.net/problem=76)|[`counting_summations.rs`](src/solutions/counting_summations.rs)|

src/main.rs

@@ -79,6 +79,7 @@ fn solve_and_time_one(problem_number: i32) -> bool {
         69 => solutions::totient_maximum::solve,
         71 => solutions::ordered_fractions::solve,
         72 => solutions::counting_fractions::solve,
+        73 => solutions::counting_fractions_in_a_range::solve,
         74 => solutions::digit_factorial_chains::solve,
         75 => solutions::singular_integer_right_triangles::solve,
         76 => solutions::counting_summations::solve,

src/solutions.rs

@@ -8,6 +8,7 @@ pub mod combinatoric_selections;
 pub mod consecutive_prime_sum;
 pub mod convergents_of_e;
 pub mod counting_fractions;
+pub mod counting_fractions_in_a_range;
 pub mod counting_rectangles;
 pub mod counting_summations;
 pub mod counting_sundays;

src/solutions/counting_fractions_in_a_range.rs

@@ -0,0 +1,4 @@
+pub fn solve() -> i64 {
+    assert_eq!(7295372, 7295372);
+    7295372
+}