Talk:Waring's problem
From Wikipedia, the free encyclopedia
Removed this:
- Using the Hardy-Littlewood method?, g(k) can now readily be computed for all other values of k as well.
Really ? If we had to wait till 1986 to prove g(4)=19, I don't think we can readily compute g(k) yet. And if so, how ? Hardy & Littlewood died long before 1986. FvdP 20:06 Oct 23, 2002 (UTC)
I think this is simply wrong; no such method is known. Thanks for the catch. AxelBoldt 22:27 Oct 23, 2002 (UTC)
- I guess we have to wait some more time, yes. Axel thank you too for catching the link to wrong Langrange's theorem. --XJamRastafire 00:48 Oct 24, 2002 (UTC)
This seems self-contradictory (emphasis is mine):
- All other values of g are now also known, as a result of work by Dickson, Pillai, Rubugunday and Niven. Their formula contains two cases, and it is conjectured that the second case never occurs; in the first case, the formula reads g(k) = [...]
So is g known or only conjectured ? If it is known, what is Dickson (etc)'s second case about ? --FvdP 20:03 Feb 17, 2003 (UTC)
The exact value for g(k) is known for every k, in the sense that, if you give me k, I can give you g(k). Dickson's formula has two cases. In order to figure out which case of the formula to use for a particular k, I have to check a certain thing about the number k. If the outcome of that check is "YES", I pick the first case of the formula, if the outcome of the test is "NO", I pick the second case of the formula. Nobody has ever seen a value for k where the outcome was "NO". It is conjectured that there are no such values. Therefore I didn't list the second case of the formula in the article.
Maybe the sentence in the article should be reformulated somehow. AxelBoldt 21:46 Feb 17, 2003 (UTC)
OK, I understand it now. Thanks. My mathematical mind looks a bit rusty. Sad thing. --FvdP
[edit] Waring's problem really solved? I think not!
Shouldn't this page be fixed? I really really doubt that g(k) is known for all k now. Dickson's formula only gives conjectured values for g(k). His formula indeed has two cases, one of which is conjectured not to occur, but in any case the outcome of Dickson's formula can be easily computer for arbitrary k. This outcome however is *not* known to be the exact value of g(k). See http://mathworld.wolfram.com/WaringsProblem.html for more information about the condition to be checked in Dickson's formula.
To repeat once more, the statement on this talk page that "The exact value for g(k) is known for every k, in the sense that, if you give me k, I can give you g(k)" is NOT true. What is true is that "if you give me k, I can give you the outcome of Dickson's formula". Dickson's formula gives only a conjectural value for g(k). Dickson's formula is from 1936. The value of g(4) was only proved to be 19 in 1986!
As this page is now, it gives the impression that the real values of g(k) are almost all known by Dickson's formula, and that only an unimportant secondary condition is left to be checked. This is the impression also when you search for Waring's problem on the web, since most information on the problem is now coming from this wikipedia article. So a fix is in order. I could probably do it, but I'd like to hear first what the original authors think of this.
- The anonymous poster in this section obviously missed the requirement for k to be greater than or equal to 6 in Dickson, et. al.'s formula. In my opinion AxelBoldt's explanation above is correct. Does that mean that the anonymous comment above is "patent nonsense" and should be removed? TheGoblin 16:49, 26 January 2006 (UTC)
- - - Vinogradov's bound was improved upon several times according to Ian Stewart (Game, Set and Math). J.R. Chen showed g(n)<= n(3logn+5.2). A more complicated improvement later by Mozzochi and Balasubramanian. Of more interest are the best known individual bounds for G(n) <=g(n), which from Stewart are for n=4,5,6...15: 3,4,7,8,34,32,102,51,135,150,166 and 181.Billymac00 13:49, 31 January 2006 (UTC)
- Since G(4) is exactly 16 I think Billymac00's list of upper bounds for G(n) seems questionable. He is correct in that Vinogradov's bound has been improved several times... TheGoblin 22:09, 1 March 2006 (UTC)
[edit] formula for g(k)
the formula for g(k) is actually based on a very basic inequality. It is definitely a lower bound always, and the conjecture states that it also is enough. I changed it just before we discuss the formula.Evilbu 15:14, 4 February 2006 (UTC)
Everything is explained clearly here: http://www.mathpages.com/home/kmath316.htm
[edit] Who writes this stuff?
- "Lagrange's four-square theorem was conjectured by Fermat in 1640"
as a special case of his Polygonal Number Theorem? That was 1638. When he proved it I don't know, perhaps two years later is correct, since it wasn't published. Relevant? Barely.
- "and was first stated in 1621."
Really? Not by Diophantus?
- "Apart from a certain ambiguity, all the other values of g are now also known, as a result of work by Dickson, Pillai, Rubugunday and Ivan M. Niven."
I have no idea if this is true or not. Mathworld states "Dickson (1936), Pillai (1936), and Niven also conjectured an explicit formula for g(s) for s>6". 59.112.47.213 18:58, 2 September 2006 (UTC)
