• This program finds the prime factorization of the specified number, X.
[It computes as many numbers as specified in "How many?" starting at X.]
• The upper limit of X is around 7,943,282,347,242,800; for a large X it might take more than a few seconds to finish computation.
• The upper limit of "How many?" is 1,000 for X smaller than 1,000,000, and it is 100 for larger X. And if X is really, really large, only few numbers following X are computed.
• This program is written in R (r-project.org).
The "brew" package is used to integrate R and HTML.
|• Magic square maker||• How many days|
|• Pythagorean triples finder||• Prime factorization|
|• Bivariate baseball score plots||• 3+3 designs|