Skip to content

Problem 70. #128

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Draft
wants to merge 6 commits into
base: main
Choose a base branch
from
Draft
Show file tree
Hide file tree
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
1 change: 1 addition & 0 deletions README.md
Original file line number Diff line number Diff line change
Expand Up @@ -116,6 +116,7 @@ such as (but not limited to) Bard and ChatGPT.
|[67](https://projecteuler.net/problem=67)|[`maximum_path_sum_ii.rs`](src/solutions/maximum_path_sum_ii.rs)|
|[68](https://projecteuler.net/problem=68)|[`magic_5_gon_ring.rs`](src/solutions/magic_5_gon_ring.rs)|
|[69](https://projecteuler.net/problem=69)|[`totient_maximum.rs`](src/solutions/totient_maximum.rs)|
|[70](https://projecteuler.net/problem=70)|[`totient_permutation.rs`](src/solutions/totient_permutation.rs)|
|[71](https://projecteuler.net/problem=71)|[`ordered_fractions.rs`](src/solutions/ordered_fractions.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)|
Expand Down
1 change: 1 addition & 0 deletions src/main.rs
Original file line number Diff line number Diff line change
Expand Up @@ -77,6 +77,7 @@ fn solve_and_time_one(problem_number: i32) -> bool {
67 => solutions::maximum_path_sum_ii::solve,
68 => solutions::magic_5_gon_ring::solve,
69 => solutions::totient_maximum::solve,
70 => solutions::totient_permutation::solve,
71 => solutions::ordered_fractions::solve,
74 => solutions::digit_factorial_chains::solve,
75 => solutions::singular_integer_right_triangles::solve,
Expand Down
1 change: 1 addition & 0 deletions src/solutions.rs
Original file line number Diff line number Diff line change
Expand Up @@ -75,6 +75,7 @@ pub mod summation_of_primes;
pub mod ten_thousand_and_first_prime;
pub mod thousand_digit_fibonacci_number;
pub mod totient_maximum;
pub mod totient_permutation;
pub mod triangular_pentagonal_and_hexagonal;
pub mod truncatable_primes;
pub mod xor_decryption;
Expand Down
4 changes: 4 additions & 0 deletions src/solutions/totient_permutation.rs
Original file line number Diff line number Diff line change
@@ -0,0 +1,4 @@
pub fn solve() -> i64 {
assert_eq!(8319823, 8319823);
8319823
}
5 changes: 5 additions & 0 deletions src/utils.rs
Original file line number Diff line number Diff line change
Expand Up @@ -234,6 +234,11 @@ pub fn isqrt(mut num: i64) -> i64 {
result
}

///
pub fn totient(num: i64) -> i64 {
PrimeDivisors::new(num).fold(1, |product, (prime, exp)| product * prime.pow(exp - 1) * (prime - 1))
}

/******************************************************************************
* Objects.
*****************************************************************************/
Expand Down