250 Problems in Elementary Number Theory
Author : Wacław Sierpiński
Publisher : Elsevier Publishing Company
Page : 142 pages
File Size : 50,78 MB
Release : 1970
Category : Mathematics
ISBN :
Author : Wacław Sierpiński
Publisher : Elsevier Publishing Company
Page : 142 pages
File Size : 50,78 MB
Release : 1970
Category : Mathematics
ISBN :
Author : Armel Mercier
Publisher : American Mathematical Soc.
Page : 358 pages
File Size : 44,83 MB
Release : 2007
Category : Mathematics
ISBN : 9780821886182
Author : W. Sierpinski
Publisher : Elsevier
Page : 527 pages
File Size : 35,68 MB
Release : 1988-02-01
Category : Mathematics
ISBN : 0080960197
Since the publication of the first edition of this work, considerable progress has been made in many of the questions examined. This edition has been updated and enlarged, and the bibliography has been revised.The variety of topics covered here includes divisibility, diophantine equations, prime numbers (especially Mersenne and Fermat primes), the basic arithmetic functions, congruences, the quadratic reciprocity law, expansion of real numbers into decimal fractions, decomposition of integers into sums of powers, some other problems of the additive theory of numbers and the theory of Gaussian integers.
Author : William Stein
Publisher : Springer Science & Business Media
Page : 173 pages
File Size : 50,33 MB
Release : 2008-10-28
Category : Mathematics
ISBN : 0387855254
This is a book about prime numbers, congruences, secret messages, and elliptic curves that you can read cover to cover. It grew out of undergr- uate courses that the author taught at Harvard, UC San Diego, and the University of Washington. The systematic study of number theory was initiated around 300B. C. when Euclid proved that there are in?nitely many prime numbers, and also cleverly deduced the fundamental theorem of arithmetic, which asserts that every positive integer factors uniquely as a product of primes. Over a thousand years later (around 972A. D. ) Arab mathematicians formulated the congruent number problem that asks for a way to decide whether or not a given positive integer n is the area of a right triangle, all three of whose sides are rational numbers. Then another thousand years later (in 1976), Di?e and Hellman introduced the ?rst ever public-key cryptosystem, which enabled two people to communicate secretely over a public communications channel with no predetermined secret; this invention and the ones that followed it revolutionized the world of digital communication. In the 1980s and 1990s, elliptic curves revolutionized number theory, providing striking new insights into the congruent number problem, primality testing, publ- key cryptography, attacks on public-key systems, and playing a central role in Andrew Wiles’ resolution of Fermat’s Last Theorem.
Author : Paul Pollack
Publisher : American Mathematical Soc.
Page : 322 pages
File Size : 47,8 MB
Release : 2009-10-14
Category : Mathematics
ISBN : 0821848801
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.
Author : James J. Tattersall
Publisher : Cambridge University Press
Page : 420 pages
File Size : 19,53 MB
Release : 1999-10-14
Category : Mathematics
ISBN : 9780521585316
This book is intended to serve as a one-semester introductory course in number theory. Throughout the book a historical perspective has been adopted and emphasis is given to some of the subject's applied aspects; in particular the field of cryptography is highlighted. At the heart of the book are the major number theoretic accomplishments of Euclid, Fermat, Gauss, Legendre, and Euler, and to fully illustrate the properties of numbers and concepts developed in the text, a wealth of exercises have been included. It is assumed that the reader will have 'pencil in hand' and ready access to a calculator or computer. For students new to number theory, whatever their background, this is a stimulating and entertaining introduction to the subject.
Author : Daniel Shanks
Publisher : American Mathematical Society
Page : 321 pages
File Size : 42,81 MB
Release : 2024-01-24
Category : Mathematics
ISBN : 1470476452
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.
Author : Heinrich Dörrie
Publisher : Courier Corporation
Page : 418 pages
File Size : 41,36 MB
Release : 2013-04-09
Category : Mathematics
ISBN : 0486318478
Problems that beset Archimedes, Newton, Euler, Cauchy, Gauss, Monge, Steiner, and other great mathematical minds. Features squaring the circle, pi, and similar problems. No advanced math is required. Includes 100 problems with proofs.
Author : Kenneth H. Rosen
Publisher :
Page : 109 pages
File Size : 14,96 MB
Release : 2007
Category : Computer science
ISBN : 9780071244749
The companion Web site -- To the student -- The foundations : logic, sets, and functions -- The fundamentals : algorithms, the integers, and matrices -- Mathematical reasoning -- Counting -- Advanced counting techniques -- Relations -- Graphs -- Trees -- Boolean algebra -- Modeling computation
Author : Kuldeep Singh
Publisher : Oxford University Press
Page : 398 pages
File Size : 44,69 MB
Release : 2020-10-08
Category : Mathematics
ISBN : 019258605X
Number theory is one of the oldest branches of mathematics that is primarily concerned with positive integers. While it has long been studied for its beauty and elegance as a branch of pure mathematics, it has seen a resurgence in recent years with the advent of the digital world for its modern applications in both computer science and cryptography. Number Theory: Step by Step is an undergraduate-level introduction to number theory that assumes no prior knowledge, but works to gradually increase the reader's confidence and ability to tackle more difficult material. The strength of the text is in its large number of examples and the step-by-step explanation of each topic as it is introduced to help aid understanding the abstract mathematics of number theory. It is compiled in such a way that allows self-study, with explicit solutions to all the set of problems freely available online via the companion website. Punctuating the text are short and engaging historical profiles that add context for the topics covered and provide a dynamic background for the subject matter.