Welcome to Scribd, the world's digital library. Read, publish, and share books and documents. See more ➡
Standard view
Full view
of .
×

1.1 Polygonal numbers
1.2 Sequences of natural numbers
1.3 The principle of mathematical induction
1.4 Miscellaneous exercises
2.1 The division algorithm
2.2 The greatest common divisor
2.3 The Euclidean algorithm
2.4 Pythagorean triples
Pythagorean triples
2.5 Miscellaneous exercises
3.1 Euclid on primes
3.2 Number theoretic functions
3.3 Multiplicative functions
3.4 Factoring
3.5 The greatest integer function
3.6 Primes revisited
3.7 Miscellaneous exercises
4.1 Perfect numbers
4.2 Fermat numbers
4.3 Amicable numbers
4.4 Perfect-type numbers
5.1 Congruence
5.2 Divisibility criteria
5.3 Euler's phi-function
5.4 Conditional linear congruences
5.5 Miscellaneous exercises
6.1 Polynomial congruences
6.3 Primitive roots
6.4 Miscellaneous exercises
7.1 Monoalphabetic ciphers
7.2 Polyalphabetic ciphers
7.3 Knapsack and block ciphers
7.4 Exponential ciphers
8.1 Sums of squares
8.2 Pell's equation
8.4 Finite continued fractions
8.5 In®nite continued fractions
9.1 Generating functions
9.2 Partitions
9.3 Pentagonal Number Theorem
0 of .
Results for:
P. 1
Tattersall Elementary_number_theory_in in Nine Chapters

# Tattersall Elementary_number_theory_in in Nine Chapters

Ratings: (0)|Views: 318|Likes:
=
=

### Availability:

See More
See less

05/18/2013

pdf

text

original

Pages 9 to 65 are not shown in this preview.
Pages 74 to 123 are not shown in this preview.
Pages 132 to 250 are not shown in this preview.
Pages 259 to 339 are not shown in this preview.
Pages 348 to 417 are not shown in this preview.

## Activity (2)

### Showing

AllMost RecentReviewsAll NotesLikes