## An Introduction to the Theory of Numbers |

### What people are saying - Write a review

We haven't found any reviews in the usual places.

### Other editions - View all

AN INTRODUCTION TO THE THEORY OF NUMBERS, 5TH ED Ivan Niven,Herbert S. Zuckerman,Hugh L. Montgomery No preview available - 2008 |

AN INTRODUCTION TO THE THEORY OF NUMBERS, 5TH ED Ivan Niven,Herbert S. Zuckerman,Hugh L. Montgomery No preview available - 2008 |

### Common terms and phrases

addition chain admissible composition algebraic arithmetic functions arithmetic progression Brauer Chowla class will contain combinatorial number theory combinatorial principle congruences cos1 deﬁned deﬁnition diﬀerent diﬃcult Diophantine Equation Dirichlet series distinct a’s elementary elements ep(n Erdos estimate Euler example exist extended Riemann hypothesis Fermat prime Fermat’s ﬁeld ﬁnd ﬁnding ﬁnite number ﬁrst digit fundamental theorem Hence implies infinitely inﬁnitely many primes integer coefficients integral coeﬃcients irrational irreducible polynomial least nonresidue Lemma Let a1 log2 loglogn logn logp modp Moser nonaveraging number of compositions number of distinct number of integers number of partitions number of solutions obtain pn(c polynomial with integer positive integers prime factors Prime Number Theorem problem Prove Publisher’s note quadratic residues relatively prime representation result Schur’s theorem sequence Show Sn(m solvable square suﬃciently large sum of distinct Suppose theorem of Minkowski transcendental numbers unsolved visible lattice points Waerden’s yields

### Popular passages

Page 4 - The number of partitions of n into odd parts is equal to the number of partitions of n into distinct parts. For

Page 4 - where E(n) is the number of partitions of n into an even number of distinct parts and

Page 50 - classes in any manner whatsoever, at least one of the classes will contain an arithmetic progression of

Page 4 - 0(n) the number of partitions of n into an odd number of distinct parts. We

Page 4 - parts is equal to the number of partitions of n into parts

Page 55 - 2 it follows that m — 1 must have at least one prime divisor, so by (4) n is even. We now multiply together all congruences of the type (5) , that is one for each prime dividing m — 1. Since m — 1 is squarefree, the resulting modulus is

Page 55 - The only values of m ¿ 1000 which satisfy (8) are 3, 7, 43. We proceed to develop three more congruences, similar to (8) , which when combined with (8) lead to the main result. Equation (1) can be written in the form

Page 4 - of the graph. From C, the extreme north-east node, we draw the longest south-westerly line possible in the graph; this

Page 54 - and n. This is essentially our method, but the moduli are so chosen that we are able to combine the resulting congruences so as to obtain extremely large bounds for

Page 76 - the number of representations of n as the sum of one or more consecutive