First Occurrence Of Floor(m/d(m))
David Wilson
davidwwilson at comcast.net
Mon Jan 1 15:36:21 CET 2007
I wrote:
> I suggest you graph the number f(n) = |{m: floor(m/d(m)) = n}|. It may
> give you insight into what to think.
Well, I did it, I went and computed f(n) for 1 <= n <= 10000.
The warm fuzzy I get from this data is that f(n) trends slowly upward for
increasing n and rarely if ever falls below 3. Based solely on this
evidence, I think that the conjecture that for all n >= 1, there exists m
with n = floor(m/d(m)) is reasonable.
More information about the SeqFan
mailing list