ParaMonte Fortran 2.0.0
Parallel Monte Carlo and Machine Learning Library
See the latest version documentation. |
This module contains procedures and generic interfaces for computing the prime factors of integers. More...
Data Types | |
interface | getFactoring |
Generate and return the factoring of the input positive integer. More... | |
Variables | |
character(*, SK), parameter | MODULE_NAME = "@pm_mathFactoring" |
This module contains procedures and generic interfaces for computing the prime factors of integers.
In mathematics, factorization or factoring consists of writing a number or another mathematical object as a product of several factors, usually smaller or simpler objects of the same kind.
For example, \(3 \times 5\) is a factorization of the integer \(15\).
The factoring of an integer number \(n\) is defined such that,
\begin{equation} \large n = \prod_{i=1}^{m} f_i ~, \end{equation}
where \(m\) is the number of factors of \(n\) and \(f_i\) are the prime factors.
real
or complex
data.
Final Remarks ⛓
If you believe this algorithm or its documentation can be improved, we appreciate your contribution and help to edit this page's documentation and source file on GitHub.
For details on the naming abbreviations, see this page.
For details on the naming conventions, see this page.
This software is distributed under the MIT license with additional terms outlined below.
This software is available to the public under a highly permissive license.
Help us justify its continued development and maintenance by acknowledging its benefit to society, distributing it, and contributing to it.
character(*, SK), parameter pm_mathFactoring::MODULE_NAME = "@pm_mathFactoring" |
Definition at line 57 of file pm_mathFactoring.F90.