Number Theory: Structures, Examples, and Problems
Springer Science & Business Media, Jun 12, 2009 - Mathematics - 402 pages
Number theory, an ongoing rich area of mathematical exploration, is noted for its theoretical depth, with connections and applications to other fields from representation theory, to physics, cryptography, and more. While the forefront of number theory is replete with sophisticated and famous open problems, at its foundation are basic, elementary ideas that can stimulate and challenge beginning students. This lively introductory text focuses on a problem-solving approach to the subject. Key features of Number Theory: Structures, Examples, and Problems: * A rigorous exposition starts with the natural numbers and the basics. * Important concepts are presented with an example, which may also emphasize an application. The exposition moves systematically and intuitively to uncover deeper properties. * Topics include divisibility, unique factorization, modular arithmetic and the Chinese Remainder Theorem, Diophantine equations, quadratic residues, binomial coefficients, Fermat and Mersenne primes and other special numbers, and special sequences. Sections on mathematical induction and the pigeonhole principle, as well as a discussion of other number systems are covered. * Unique exercises reinforce and motivate the reader, with selected solutions to some of the problems. * Glossary, bibliography, and comprehensive index round out the text. Written by distinguished research mathematicians and renowned teachers, this text is a clear, accessible introduction to the subject and a source of fascinating problems and puzzles, from advanced high school students to undergraduates, their instructors, and general readers at all levels.
What people are saying - Write a review
We haven't found any reviews in the usual places.
1999 Russian Mathematical Additional Problems Problem an+1 Andreescu Andrica arithmetic function assume Balkan Mathematical Olympiad Birkhäuser Boston Bulgarian Mathematical Olympiad Chinese remainder theorem City Mathematical Olympiad conclusion follows congruent consider contradiction coprime defined denote digits distinct primes divides divisible equal equation Euler’s exactly exists Fermat’s little theorem Find all positive formula gcd(a,b gcd(m gcd(p greatest common divisor Hence implies inequality infinitely International Mathematical Olympiad least lemma Mathematical Olympiad Team mod q modulo multiple natural numbers nonnegative integers nonzero Number Theory obtain odd number odd prime Olympiad Team Selection perfect square Petersburg City Mathematical pigeonhole principle polynomial positive integers prime divisor prime factor prime number Proof Pythagorean triple quadratic residue rational numbers real number relatively prime Romanian International Mathematical Romanian Mathematical Olympiad Russian Mathematical Olympiad satisfies Second solution Show subset Suppose Team Selection Test triples write