Download PDF

prime signature∗
PrimeFan†
2013-03-22 2:43:22
The prime signature of an integer n is the list of nonzero exponents ai from
the integer factorization
∞
Y
n=
pi ai ,
i=1
(with pi being the ith prime) sorted in ascending order but with duplicates
retained. Three examples: the prime signature of 10368 is (4, 7), the prime
signature of 10369 is (1), the prime signature of 10370 is (1, 1, 1, 1).
The prime signature of a number is insufficient to uniquely identify it. Numbers like 34992 and 514714375 also have prime signatures of (4, 7). However,
prime signatures can identify some kinds of numbers: the primes have signature (1); the squares of primes have signature (2), while other semiprimes have
signature (1, 1); sphenic numbers have signature (1, 1, 1); etc. But while other
kinds of numbers have different signatures among their members, some generalizations can still be made, such as that highly composite numbers have prime
signatures in reverse order of the factorization as usually stated with the primes
from 2 up; or that Achilles numbers don’t have any 1s in their prime signature
but the greatest common divisor of the numbers in the prime signature is 1.
∗ hPrimeSignaturei created: h2013-03-2i by: hPrimeFani version: h41679i Privacy setting: h1i hDefinitioni h11A41i
† This text is available under the Creative Commons Attribution/Share-Alike License 3.0.
You can reuse this document or portions thereof only if you do so under terms that are
compatible with the CC-BY-SA license.
1