Additive Theory Of Prime Numbers

Loo-Keng Hua was a master mathematician, best known for his work using analytic methods in number theory. In particular, Hua is remembered for his contributions to Waring's Problem and his estimates of trigonometric sums. Additive Theory of Prime Numbers is an exposition of the classic methods as well as Hua's own techniques, many of which have now also become classic. An essential starting point is Vinogradov's mean-value theorem for trigonometric sums, which Hua usefully rephrases and improves. Hua states a generalized version of the Waring-Goldbach problem and gives asymptotic formulas for the number of solutions in Waring's Problem when the monomial $x^k$ is replaced by an arbitrary polynomial of degree $k$. The book is an excellent entry point for readers interested in additive number theory. It will also be of value to those interested in the development of the now classic methods of the subject.

[Hilbert's] style has not the terseness of many of our modem authors in mathematics, which is based on the assumption that printer's labor and paper are costly but the reader's effort and time are not. H. Weyl [143] The purpose of this book is to describe the classical problems in additive number theory and to introduce the circle method and the sieve method, which are the basic analytical and combinatorial tools used to attack these problems. This book is intended for students who want to lel?Ill additive number theory, not for experts who already know it. For this reason, proofs include many "unnecessary" and "obvious" steps; this is by design. The archetypical theorem in additive number theory is due to Lagrange: Every nonnegative integer is the sum of four squares. In general, the set A of nonnegative integers is called an additive basis of order h if every nonnegative integer can be written as the sum of h not necessarily distinct elements of A. Lagrange 's theorem is the statement that the squares are a basis of order four. The set A is called a basis offinite order if A is a basis of order h for some positive integer h. Additive number theory is in large part the study of bases of finite order. The classical bases are the squares, cubes, and higher powers; the polygonal numbers; and the prime numbers. The classical questions associated with these bases are Waring's problem and the Goldbach conjecture.

This book helps gather the sum of additive number theory.

This ENCYCLOPAEDIA OF MATHEMATICS aims to be a reference work for all parts of mathe matics. It is a translation with updates and editorial comments of the Soviet Mathematical Encyclopaedia published by 'Soviet Encyclopaedia Publishing House' in five volumes in 1977-1985. The annotated translation consists of ten volumes including a special index volume. There are three kinds of articles in this ENCYCLOPAEDIA. First of all there are survey-type articles dealing with the various main directions in mathematics (where a rather fine subdivi sion has been used). The main requirement for these articles has been that they should give a reasonably complete up-to-date account of the current state of affairs in these areas and that they should be maximally accessible. On the whole, these articles should be understandable to mathematics students in their first specialization years, to graduates from other mathematical areas and, depending on the specific subject, to specialists in other domains of science, en gineers and teachers of mathematics. These articles treat their material at a fairly general level and aim to give an idea of the kind of problems, techniques and concepts involved in the area in question. They also contain background and motivation rather than precise statements of precise theorems with detailed definitions and technical details on how to carry out proofs and constructions. The second kind of article, of medium length, contains more detailed concrete problems, results and techniques.

This collection of articles contains the proceedings of the two international conferences (on Number Theory and Cryptography) held at the Harish - Chandra Research Institute. In recent years the interest in number theory has increased due to its applications in areas like error-correcting codes and cryptography. These proceedings contain papers in various areas of number theory, such as combinatorial, algebraic, analytic and transcendental aspects, arithmetic algebraic geometry, as well as graph theory and cryptography. While some papers do contain new results, several of the papers are expository articles that mention open questions, which will be useful to young researchers.

This volume honors Professor Andrzej Grzegorczyk, the nestor of Polish logicians, on his 85th anniversary. The editors would like to express the respect and sympathy they have for him. His textbook The Outline of Mathematical Logic has been published in many editions and translated into several languages. It was this textbook that introduced many of us into the world of mathematical logic. Professor Grzegorczyk has made fundamental contributions to logic and to philosophy. His results, mainly on hierarchy of primitive recursive functions, known as the Grzegorczyk hierarchy, are of fundamental importance to theoretical computer science. In particular, they were precursory for the computational complexity theory. The editors would like to stress that this special publication celebrates a scientist who is still actively pursuing genuinely innovative directions of research. Quite recently, Andrzej Grzegorczyk gave a new proof of undecidability of the first order functional calculus. His proof does not use the arithmetization of Kurt Gödel. In recognition of his merits, the University of Clermont-Ferrand conferred to Professor Andrzej Grzegorczyk the Doctorat Honoris Causa. The work and life of Professor Andrzej Grzegorczyk is presented in the article by Professors Stanislaw Krajewski and Jan Wolenski. The papers in this collection have been submitted on invitational basis.