Function templates to decompose a natural number into its unique prime decomposition.
More...
|
template<Integer T, std::ranges::input_range R>
requires std::convertible_to<std::ranges::range_value_t<R>, T> |
| constexpr prime_factors< T > | ntlib::prime_decomposition_list (T n, R &&list) |
| | Computes a prime decomposition of a given number using a provided list of potential prime divisors.
|
| template<Integer T> |
| constexpr T | ntlib::find_factor (T n) noexcept |
| | Finds a non-trivial factor of a given composite number.
|
| template<Integer T> |
| constexpr prime_factors< T > | ntlib::prime_decomposition (T n) |
| | Computes the prime decomposition of a given number.
|
Function templates to decompose a natural number into its unique prime decomposition.