IT WORKS! The proving can now continue!
Aug. 19th, 2009 06:45 pm![[personal profile]](https://www.dreamwidth.org/img/silk/identity/user.png){kind=small}
sniffnoyAnd, according to the program, for 3 not dividing k, k≥16, g5(k)=... 7/9g(k) !
OK, I haven't technically verified that absolutely everything is working properly, but, it is giving me actual results for r>2, and that's new. And I have checked a lot. And all its low results match up with my hand computations.
Man, each of these computations took me, like, hours before. Computers are so great. Now to start making a table of results! Later I'll see what these actually allow me to prove.
(Basically, so far, there's never been a constant term; and what I want is for that to remain the case, and for the size of the linear term to get small faster than the number of 2s in its numerator gets large. I don't think the second part should be a problem, but I suspect that eventually a constant term will appear, and then I won't be able to make use of it (or at least not in the same way).)
-Harry
OK, I haven't technically verified that absolutely everything is working properly, but, it is giving me actual results for r>2, and that's new. And I have checked a lot. And all its low results match up with my hand computations.
Man, each of these computations took me, like, hours before. Computers are so great. Now to start making a table of results! Later I'll see what these actually allow me to prove.
(Basically, so far, there's never been a constant term; and what I want is for that to remain the case, and for the size of the linear term to get small faster than the number of 2s in its numerator gets large. I don't think the second part should be a problem, but I suspect that eventually a constant term will appear, and then I won't be able to make use of it (or at least not in the same way).)
-Harry
no subject
Date: 2009-08-20 03:16 am (UTC)no subject
Date: 2009-08-20 03:34 am (UTC)