almost immediately after posting about using gppf as a measure of roundness, another one of course crossed my mind. i've been calling it IFR, for Inner Factor Ratio. by "inner factor"(s), i mean the two factors closest to the number's square root. so, for instance, the factors of 12 are 1, 2, 3, 4, 6, 12. the two numbers closest to its square root are 3 and 4, so its IFR is 4/3.
i came to this measure while working on the gppf stuff, actually. making lists of factors of a number, i noticed that some numbers had lists with really large gaps in the middle (e.g. 57: 1, 3, 19, 57, the gap being between 3 and 19), and some didn't (e.g. 56: 1, 2, 4, 7, 8, 14, 28, 56, the gap being between 7 and 8), and that the round numbers tended to be the ones with small gaps. (remember that, as we're working multiplicatively, the "middle" of a list like this is necessarily the square root of the number.) of course (again with the multiplicative), it makes more sense to measure the size of this gap using a ratio instead of a difference. thus, Inner Factor Ratio.
an obvious concern is whether the IFR is well-defined for squares. if you consider something like 36: 1, 2, 3, 4, 6, 9, 12, 18, 36, the middle/square root is 6, which is actually in our list. so do we want the ratio of 6 and 4, or the ratio of 9 and 6? conveniently, these two ratios will always be the same. ( proofCollapse ). so the IFR is even well-defined in this situation.
by definition, the IFR is always greater than 1 (it being the ratio of two numbers, with the bigger one on top), and less than or equal to n (which upper bound is attained if n is a prime number). one could thus normalize the IFR by dividing by n, or by taking the logn, but i'm disinclined to do this. in at least some cases, the IFR has some nice scaling properties. IFR(k2n) ≤ IFR(n) because if a, b, are the inner factors of n, then ak, bk are candidates for the inner factors of k2n. we also note that if p is prime, the factors of pn are all the intermediate powers of p, and thus the IFR of pn for any n is necessarily p. so in some sense the IFR is scale-insensitive.
based on those results, it's tempting to make what i call the strong domination conjecture: IFR(mn) ≤ min(IFR(m),IFR(n)). this is false. consider, e.g., 606 = 6 * 101. IFR(6) = 3/2 = 1.5. but IFR(606) = 101/6 = 16.8333 is significantly larger than 1.5. a nerfed version, however, the weak domination conjecture IFR(m*n) ≤ max(IFR(m),IFR(n)) is true. ( proofCollapse )
the asymptotics of IFR are still somewhat vague. i've tabulated it up to 1753 so far. mean values will be dominated by primes and biprimes, so i've looked at medians instead. the median value of IFR(n) seems to stay fairly consistently around n0.26, but, as i say, that's still somewhat vague. minimal values are attained by numbers in the form n(n+1) (A002378). somewhat more problematic, lurking close to these are some biprimes, specifically those that are products of twin primes. my æsthetic has a problem calling a biprime "round", even one with a nice IFR like 41 × 43 = 1763.
of course, i'm posting about this now because just this morning, thinking about this biprime issue lead me to yet another way of measuring roundness, which i like better! but i'm gonna play with it a bit before writing it up. |