The "Vertical" Generalization of Goldbach’s Conjecture – An Infinite Class of Conjectures Stronger than Goldbach’s


Book Description

This work proposes the generalization of the binary (strong) Goldbach’s Conjecture, briefly called “the Vertical Binary Goldbach’s Conjecture”, which is essentially a meta-conjecture because it states an infinite number of conjectures stronger than Goldbach’s, which all apply on “iterative” primes with recursive prime indexes, with many potential theoretical and practical applications in mathematics and physics) and a very special self-similar property of the primes subset of positive integers.




The “Vertical” Generalization of the Binary Goldbach’s Conjecture as Applied on “Iterative” Primes with (Recursive) Prime Indexes (i-primeths)


Book Description

This article proposes a synthesized classification of some Goldbach-like conjectures, including those which are “stronger” than the Binary Goldbach’s Conjecture (BGC) and launches a new generalization of BGC briefly called “the Vertical Binary Goldbach’s Conjecture” (VBGC), which is essentially a metaconjecture, as VBGC states an infinite number of conjectures stronger than BGC, which all apply on “iterative” primes with recursive prime indexes (i-primeths).




Solved and Unsolved Problems in Number Theory


Book Description

The investigation of three problems, perfect numbers, periodic decimals, and Pythagorean numbers, has given rise to much of elementary number theory. In this book, Daniel Shanks, past editor of Mathematics of Computation, shows how each result leads to further results and conjectures. The outcome is a most exciting and unusual treatment. This edition contains a new chapter presenting research done between 1962 and 1978, emphasizing results that were achieved with the help of computers.




The Riemann Hypothesis


Book Description

The Riemann Hypothesis has become the Holy Grail of mathematics in the century and a half since 1859 when Bernhard Riemann, one of the extraordinary mathematical talents of the 19th century, originally posed the problem. While the problem is notoriously difficult, and complicated even to state carefully, it can be loosely formulated as "the number of integers with an even number of prime factors is the same as the number of integers with an odd number of prime factors." The Hypothesis makes a very precise connection between two seemingly unrelated mathematical objects, namely prime numbers and the zeros of analytic functions. If solved, it would give us profound insight into number theory and, in particular, the nature of prime numbers. This book is an introduction to the theory surrounding the Riemann Hypothesis. Part I serves as a compendium of known results and as a primer for the material presented in the 20 original papers contained in Part II. The original papers place the material into historical context and illustrate the motivations for research on and around the Riemann Hypothesis. Several of these papers focus on computation of the zeta function, while others give proofs of the Prime Number Theorem, since the Prime Number Theorem is so closely connected to the Riemann Hypothesis. The text is suitable for a graduate course or seminar or simply as a reference for anyone interested in this extraordinary conjecture.




Book of Proof


Book Description

This book is an introduction to the language and standard proof methods of mathematics. It is a bridge from the computational courses (such as calculus or differential equations) that students typically encounter in their first year of college to a more abstract outlook. It lays a foundation for more theoretical courses such as topology, analysis and abstract algebra. Although it may be more meaningful to the student who has had some calculus, there is really no prerequisite other than a measure of mathematical maturity.




Not Always Buried Deep


Book Description

Number theory is one of the few areas of mathematics where problems of substantial interest can be fully described to someone with minimal mathematical background. Solving such problems sometimes requires difficult and deep methods. But this is not a universal phenomenon; many engaging problems can be successfully attacked with little more than one's mathematical bare hands. In this case one says that the problem can be solved in an elementary way. Such elementary methods and the problems to which they apply are the subject of this book. Not Always Buried Deep is designed to be read and enjoyed by those who wish to explore elementary methods in modern number theory. The heart of the book is a thorough introduction to elementary prime number theory, including Dirichlet's theorem on primes in arithmetic progressions, the Brun sieve, and the Erdos-Selberg proof of the prime number theorem. Rather than trying to present a comprehensive treatise, Pollack focuses on topics that are particularly attractive and accessible. Other topics covered include Gauss's theory of cyclotomy and its applications to rational reciprocity laws, Hilbert's solution to Waring's problem, and modern work on perfect numbers. The nature of the material means that little is required in terms of prerequisites: The reader is expected to have prior familiarity with number theory at the level of an undergraduate course and a first course in modern algebra (covering groups, rings, and fields). The exposition is complemented by over 200 exercises and 400 references.




The Poincare Conjecture


Book Description

Henri Poincaré was one of the greatest mathematicians of the late nineteenth and early twentieth century. He revolutionized the field of topology, which studies properties of geometric configurations that are unchanged by stretching or twisting. The Poincaré conjecture lies at the heart of modern geometry and topology, and even pertains to the possible shape of the universe. The conjecture states that there is only one shape possible for a finite universe in which every loop can be contracted to a single point. Poincaré's conjecture is one of the seven "millennium problems" that bring a one-million-dollar award for a solution. Grigory Perelman, a Russian mathematician, has offered a proof that is likely to win the Fields Medal, the mathematical equivalent of a Nobel prize, in August 2006. He also will almost certainly share a Clay Institute millennium award. In telling the vibrant story of The Poincaré Conjecture, Donal O'Shea makes accessible to general readers for the first time the meaning of the conjecture, and brings alive the field of mathematics and the achievements of generations of mathematicians whose work have led to Perelman's proof of this famous conjecture.




Prime Numbers


Book Description

Bridges the gap between theoretical and computational aspects of prime numbers Exercise sections are a goldmine of interesting examples, pointers to the literature and potential research projects Authors are well-known and highly-regarded in the field




The Millennium Prize Problems


Book Description

On August 8, 1900, at the second International Congress of Mathematicians in Paris, David Hilbert delivered his famous lecture in which he described twenty-three problems that were to play an influential role in mathematical research. A century later, on May 24, 2000, at a meeting at the Collège de France, the Clay Mathematics Institute (CMI) announced the creation of a US$7 million prize fund for the solution of seven important classic problems which have resisted solution. The prize fund is divided equally among the seven problems. There is no time limit for their solution. The Millennium Prize Problems were selected by the founding Scientific Advisory Board of CMI—Alain Connes, Arthur Jaffe, Andrew Wiles, and Edward Witten—after consulting with other leading mathematicians. Their aim was somewhat different than that of Hilbert: not to define new challenges, but to record some of the most difficult issues with which mathematicians were struggling at the turn of the second millennium; to recognize achievement in mathematics of historical dimension; to elevate in the consciousness of the general public the fact that in mathematics, the frontier is still open and abounds in important unsolved problems; and to emphasize the importance of working towards a solution of the deepest, most difficult problems. The present volume sets forth the official description of each of the seven problems and the rules governing the prizes. It also contains an essay by Jeremy Gray on the history of prize problems in mathematics.




An Invitation to Abstract Mathematics


Book Description

This undergraduate textbook promotes an active transition to higher mathematics. Problem solving is the heart and soul of this book: each problem is carefully chosen to demonstrate, elucidate, or extend a concept. More than 300 exercises engage the reader in extensive arguments and creative approaches, while exploring connections between fundamental mathematical topics. Divided into four parts, this book begins with a playful exploration of the building blocks of mathematics, such as definitions, axioms, and proofs. A study of the fundamental concepts of logic, sets, and functions follows, before focus turns to methods of proof. Having covered the core of a transition course, the author goes on to present a selection of advanced topics that offer opportunities for extension or further study. Throughout, appendices touch on historical perspectives, current trends, and open questions, showing mathematics as a vibrant and dynamic human enterprise. This second edition has been reorganized to better reflect the layout and curriculum of standard transition courses. It also features recent developments and improved appendices. An Invitation to Abstract Mathematics is ideal for those seeking a challenging and engaging transition to advanced mathematics, and will appeal to both undergraduates majoring in mathematics, as well as non-math majors interested in exploring higher-level concepts. From reviews of the first edition: Bajnok’s new book truly invites students to enjoy the beauty, power, and challenge of abstract mathematics. ... The book can be used as a text for traditional transition or structure courses ... but since Bajnok invites all students, not just mathematics majors, to enjoy the subject, he assumes very little background knowledge. Jill Dietz, MAA Reviews The style of writing is careful, but joyously enthusiastic.... The author’s clear attitude is that mathematics consists of problem solving, and that writing a proof falls into this category. Students of mathematics are, therefore, engaged in problem solving, and should be given problems to solve, rather than problems to imitate. The author attributes this approach to his Hungarian background ... and encourages students to embrace the challenge in the same way an athlete engages in vigorous practice. John Perry, zbMATH