
Number Theory
Structures, Examples, and Problems
By: Titu Andreescu, Dorin Andrica
Hardcover | 2 April 2009
At a Glance
404 Pages
24.13 x 15.88 x 2.54
Hardcover
$139.00
or 4 interest-free payments of $34.75 with
orShips in 5 to 7 business days
Industry Reviews
| Preface | p. xiii |
| Acknowledgments | p. xv |
| Notation | p. xvii |
| Fundamentals | p. 1 |
| Divisibility | p. 3 |
| Divisibility | p. 3 |
| Prime Numbers | p. 9 |
| The Greatest Common Divisor and Least Common Multiple | p. 17 |
| Odd and Even | p. 27 |
| Modular Arithmetic | p. 29 |
| Chinese Remainder Theorem | p. 34 |
| Numerical Systems | p. 36 |
| Representation of Integers in an Arbitrary Base | p. 36 |
| Divisibility Criteria in the Decimal System | p. 38 |
| Powers of Integers | p. 47 |
| Perfect Squares | p. 47 |
| Perfect Cubes | p. 56 |
| kth Powers of Integers, k at least 4 | p. 57 |
| Floor Function and Fractional Part | p. 61 |
| General Problems | p. 61 |
| Floor Function and Integer Points | p. 68 |
| A Useful Result | p. 73 |
| Digits of Numbers | p. 77 |
| The Last Digits of a Number | p. 77 |
| The Sum of the Digits of a Number | p. 79 |
| Other Problems Involving Digits | p. 85 |
| Basic Principles in Number Theory | p. 89 |
| Two Simple Principles | p. 89 |
| Extremal Arguments | p. 89 |
| The Pigeonhole Principle | p. 91 |
| Mathematical Induction | p. 93 |
| Infinite Descent | p. 98 |
| Inclusion-Exclusion | p. 99 |
| Arithmetic Functions | p. 105 |
| Multiplicative Functions | p. 105 |
| Number of Divisors | p. 112 |
| Sum of Divisors | p. 115 |
| Euler's Totient Function | p. 118 |
| Exponent of a Prime and Legendre's Formula | p. 122 |
| More on Divisibility | p. 129 |
| Congruences Modulo a Prime: Fermat's Little Theorem | p. 129 |
| Euler's Theorem | p. 135 |
| The Order of an Element | p. 138 |
| Wilson's Theorem | p. 141 |
| Diophantine Equations | p. 145 |
| Linear Diophantine Equations | p. 145 |
| Quadratic Diophantine Equations | p. 148 |
| The Pythagorean Equation | p. 148 |
| Pell's Equation | p. 151 |
| Other Quadratic Equations | p. 157 |
| Nonstandard Diophantine Equations | p. 159 |
| Cubic Equations | p. 159 |
| High-Order Polynomial Equations | p. 161 |
| Exponential Diophantine Equations | p. 163 |
| Some Special Problems in Number Theory | p. 167 |
| Quadratic Residues; the Legendre Symbol | p. 167 |
| Special Numbers | p. 176 |
| Fermat Numbers | p. 178 |
| Mersenne Numbers | p. 178 |
| Perfect Numbers | p. 179 |
| Sequences of Integers | p. 180 |
| Fibonacci and Lucas Sequences | p. 180 |
| Problems Involving Linear Recursive Relations | p. 184 |
| Nonstandard Sequences of Integers | p. 191 |
| Problems Involving Binomial Coefficients | p. 197 |
| Binomial Coefficients | p. 197 |
| Lucas's and Kummer's Theorems | p. 203 |
| Miscellaneous Problems | p. 207 |
| Solutions to Additional Problems | p. 213 |
| Divisibility | p. 215 |
| Divisibility | p. 215 |
| Prime Numbers | p. 220 |
| The Greatest Common Divisor and Least Common Multiple | p. 227 |
| Odd and Even | p. 231 |
| Modular Arithmetic | p. 233 |
| Chinese Remainder Theorem | p. 236 |
| Numerical Systems | p. 238 |
| Powers of Integers | p. 245 |
| Perfect Squares | p. 245 |
| Perfect Cubes | p. 253 |
| kth Powers of Integers, k at least 4 | p. 256 |
| Floor Function and Fractional Part | p. 259 |
| General Problems | p. 259 |
| Floor Function and Integer Points | p. 263 |
| A Useful Result | p. 264 |
| Digits of Numbers | p. 267 |
| The Last Digits of a Number | p. 267 |
| The Sum of the Digits of a Number | p. 268 |
| Other Problems Involving Digits | p. 272 |
| Basic Principles in Number Theory | p. 275 |
| Two Simple Principles | p. 275 |
| Mathematical Induction | p. 278 |
| Infinite Descent | p. 284 |
| Inclusion-Exclusion | p. 284 |
| Arithmetic Functions | p. 287 |
| Multiplicative Functions | p. 287 |
| Number of Divisors | p. 289 |
| Sum of Divisors | p. 291 |
| Euler's Totient Function | p. 292 |
| Exponent of a Prime and Legendre's Formula | p. 294 |
| More on Divisibility | p. 299 |
| Congruences Modulo a Prime: Fermat's Little Theorem | p. 299 |
| Euler's Theorem | p. 305 |
| The Order of an Element | p. 306 |
| Wilson's Theorem | p. 309 |
| Diophantine Equations | p. 311 |
| Linear Diophantine Equations | p. 311 |
| Quadratic Diophantine Equations | p. 313 |
| Pythagorean Equations | p. 313 |
| Pell's Equation | p. 315 |
| Other Quadratic Equations | p. 318 |
| Nonstandard Diophantine Equations | p. 320 |
| Cubic Equations | p. 320 |
| High-Order Polynomial Equations | p. 323 |
| Exponential Diophantine Equations | p. 325 |
| Some Special Problems in Number Theory | p. 329 |
| Quadratic Residues; the Legendre Symbol | p. 329 |
| Special Numbers | p. 332 |
| Fermat Numbers | p. 332 |
| Mersenne Numbers | p. 333 |
| Perfect Numbers | p. 334 |
| Sequences of Integers | p. 335 |
| Fibonacci and Lucas Sequences | p. 335 |
| Problems Involving Linear Recursive Relations | p. 338 |
| Nonstandard Sequences of Integers | p. 342 |
| Problems Involving Binomial Coefficients | p. 355 |
| Binomial Coefficients | p. 355 |
| Lucas's and Kummer's Theorems | p. 360 |
| Miscellaneous Problems | p. 363 |
| Glossary | p. 369 |
| Bibliography | p. 377 |
| Index of Authors | p. 381 |
| Subject Index | p. 383 |
| Table of Contents provided by Ingram. All Rights Reserved. |
ISBN: 9780817632458
ISBN-10: 081763245X
Published: 2nd April 2009
Format: Hardcover
Language: English
Number of Pages: 404
Audience: Professional and Scholarly
Publisher: Springer Nature B.V.
Country of Publication: US
Dimensions (cm): 24.13 x 15.88 x 2.54
Weight (kg): 0.73
Shipping
| Standard Shipping | Express Shipping | |
|---|---|---|
| Metro postcodes: | $9.99 | $14.95 |
| Regional postcodes: | $9.99 | $14.95 |
| Rural postcodes: | $9.99 | $14.95 |
Orders over $79.00 qualify for free shipping.
How to return your order
At Booktopia, we offer hassle-free returns in accordance with our returns policy. If you wish to return an item, please get in touch with Booktopia Customer Care.
Additional postage charges may be applicable.
Defective items
If there is a problem with any of the items received for your order then the Booktopia Customer Care team is ready to assist you.
For more info please visit our Help Centre.
























