Prime-Factor Sum Collisions among Composite Divisors: Primitive Cases and Additive Generalizations
This paper investigates collisions of prime-factor sums among composite divisors of positive integers. A number is called primitive if it has two distinct composite divisors with equal sums of prime factors, counted with multiplicity, but no proper divisor has this property. We prove that every primitive number has at most two such collision pairs. We characterize the equality case, establish connections with three-term arithmetic progressions of primes, and construct infinite families attaining the bound. The results are extended to completely additive arithmetic functions with prescribed prime weights. In particular, we establish general bounds on the number of collisions and investigate the functions obtained by summing powers of prime factors, including a connection to the theorem of Darmon and Merel. The paper also provides theoretical foundations for the integer sequences OEIS A402108 and A402109.
Authors
- Felix Huber (ORCID: https://orcid.org/0009-0005-1568-1579)
Publication Details
- Journal
- Zenodo (CERN European Organization for Nuclear Research)
- Published
- 2026-11-13
- DOI
- https://doi.org/10.5281/zenodo.24196196
- Primary Topic
- Analytic Number Theory Research
- Type
- preprint