A few ad hoc numeric alogrithms: `factors` and `primes`.
Project description
A few ad hoc numeric alogrithms: factors and primes.
Latest release 20220606: New intif(f): int(f) if that equals f, otherwise f.
Function factors(n)
Generator yielding the prime factors of n in order from lowest to highest.
Function intif(f: float)
Return int(f) if that equals f, otherwise f.
Function primes()
Generator yielding the primes in order starting at 2.
Release Log
Release 20220606: New intif(f): int(f) if that equals f, otherwise f.
Release 20190309: Superficial changes.
Release 20150311.2: Added RST doco for cs.numeric.
Release 20150311: Initial release with primes() and factors().
Release history Release notifications | RSS feed
Download files
Download the file for your platform. If you're not sure which to choose, learn more about installing packages.
Source Distribution
cs.numeric-20220606.tar.gz
(2.4 kB
view hashes)
Built Distribution
Close
Hashes for cs.numeric-20220606-py3-none-any.whl
| Algorithm | Hash digest | |
|---|---|---|
| SHA256 | d239b244a39e2537a512ffb352e607b11f17d80b8119d6d5b3be678d6704b1f1 |
|
| MD5 | c4bf4f487f55c0168f0ce46fa23d4758 |
|
| BLAKE2b-256 | 82fe5e516fd1cac449459c4acac3d502b6d218b9f45b4921aaeb4641056bbba0 |
