On highly factorable numbers (Q1273199)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1229755
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On highly factorable numbers |
scientific article; zbMATH DE number 1229755 |
Statements
On highly factorable numbers (English)
0 references
26 April 2000
0 references
Let \(f(n)\) denote the number of essentially different factorizations of \(n\), where all factors exceed 1. Then \(n\) is said to be highly factorable if \(f(m)< f(n)\) for all \(m\) such that \(1\leq m< n\). The author proves a conjecture of Canfield, Erdős, and Pomerance regarding the exponents in the prime factorization of a large highly factorable number.
0 references
prime factorization
0 references
large highly factorable number
0 references
0.8267236351966858
0 references
