On highly factorable numbers (Q1273199): Difference between revisions
From MaRDI portal
Removed claim: reviewed by (P1447): Item:Q927713 |
Changed an Item |
||
| Property / reviewed by | |||
| Property / reviewed by: Neville Robbins / rank | |||
Normal rank | |||
Revision as of 20:01, 21 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On highly factorable numbers |
scientific article |
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
