Abstract
The method devised by Hardy and Littlewood for the solution of Waring's Problem, and further developed by Vinogradov, applies quite generally to Diophantine equations of an additive type. One particular result that can be proved by this method is that if a 1 , …, a s are integers not all of the same sign, and if s is greater than a certain number depending only on k , the Diophantine equation has infinitely many solutions in positive integers x 1 , …, x s , provided that the corresponding congruence has a non-zero solution to every prime power modulus. A result of a similar kind holds if on the right of (1) there stands an arbitrary integer in place of 0.
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
