pollardrho: Implementation of Pollard's rho algorithm for factorizing an...
In aschleg/numberr: Numberr is a package containing number-theoretic algorithms and functions primarily written in C++ using Rcpp
Description
Usage
Arguments
Value
References
Examples
Description
Implementation of Pollard's rho algorithm for factorizing an
integer n into two non-trivial prime numbers.
Usage
1
pollardrho(n)
Arguments
n
Integer to be factored into product of smaller integers.
Value
Vector containing the two prime factors of n, should they exist.
References
Barnes, C. (2004). Integer Factorization Algorithms (1st ed.).
Corvallis, OR: Department of Physics, Oregon State University. Fermat's
factorization method. (2017, January 31). In Wikipedia, The Free
Encyclopedia. From
https://en.wikipedia.org/w/index.php?title=Fermat
Examples
1
2
pollardrho(9)
pollardrho(7799)
aschleg/numberr documentation built on May 14, 2019, 10:31 a.m.
R Package Documentation
Browse R Packages
We want your feedback!
Note that we can't provide technical support on individual packages. You should contact the package authors for that.
Description Usage Arguments Value References Examples
Description
Implementation of Pollard's rho algorithm for factorizing an integer n into two non-trivial prime numbers.
Usage
1 | pollardrho(n)
|
Arguments
n |
Integer to be factored into product of smaller integers. |
Value
Vector containing the two prime factors of n, should they exist.
References
Barnes, C. (2004). Integer Factorization Algorithms (1st ed.). Corvallis, OR: Department of Physics, Oregon State University. Fermat's factorization method. (2017, January 31). In Wikipedia, The Free Encyclopedia. From https://en.wikipedia.org/w/index.php?title=Fermat
Examples
1 2 | pollardrho(9)
pollardrho(7799)
|
R Package Documentation
Browse R Packages
We want your feedback!
Note that we can't provide technical support on individual packages. You should contact the package authors for that.
Embedding an R snippet on your website
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.