Home Page Icon
Home Page
Table of Contents for
Elementary Number Theory with Programming
Close
Elementary Number Theory with Programming
by Jeanine Meyer, Marty Lewinter
Elementary Number Theory with Programming
COVER
TITLE PAGE
PREFACE
WORDS
NOTATION IN MATHEMATICAL WRITING AND IN PROGRAMMING
1 SPECIAL NUMBERS: TRIANGULAR, OBLONG, PERFECT, DEFICIENT, AND ABUNDANT
TRIANGULAR NUMBERS
OBLONG NUMBERS AND SQUARES
DEFICIENT, ABUNDANT, AND PERFECT NUMBERS
EXERCISES
2 FIBONACCI SEQUENCE, PRIMES, AND THE PELL EQUATION
PRIME NUMBERS AND PROOF BY CONTRADICTION
PROOF BY CONSTRUCTION
SUMS OF TWO SQUARES
BUILDING A PROOF ON PRIOR ASSERTIONS
SIGMA NOTATION
SOME SUMS
FINDING ARITHMETIC FUNCTIONS
FIBONACCI NUMBERS
AN INFINITE PRODUCT
THE PELL EQUATION
GOLDBACH’S CONJECTURE
EXERCISES
3 PASCAL’S TRIANGLE
FACTORIALS
THE COMBINATORIAL NUMBERS n CHOOSE k
PASCAL’S TRIANGLE
BINOMIAL COEFFICIENTS
EXERCISES
4 DIVISORS AND PRIME DECOMPOSITION
DIVISORS
GREATEST COMMON DIVISOR
DIOPHANTINE EQUATIONS
LEAST COMMON MULTIPLE
PRIME DECOMPOSITION
SEMIPRIME NUMBERS
WHEN IS A NUMBER AN mTH POWER?
TWIN PRIMES
FERMAT PRIMES
ODD PRIMES ARE DIFFERENCES OF SQUARES
WHEN IS n A LINEAR COMBINATION OF a AND b?
PRIME DECOMPOSITION OF n!
NO NONCONSTANT POLYNOMIAL WITH INTEGER COEFFICIENTS ASSUMES ONLY PRIME VALUES
EXERCISES
5 MODULAR ARITHMETIC
CONGRUENCE CLASSES MOD k
LAWS OF MODULAR ARITHMETIC
MODULAR EQUATIONS
FERMAT’S LITTLE THEOREM
FERMAT’S LITTLE THEOREM
MULTIPLICATIVE INVERSES
WILSON’S THEOREM
WILSON’S THEOREM
WILSON’S THEOREM (2ND VERSION)
SQUARES AND QUADRATIC RESIDUES
LAGRANGE’S THEOREM
LAGRANGE’S THEOREM
REDUCED PYTHAGOREAN TRIPLES
CHINESE REMAINDER THEOREM
CHINESE REMAINDER THEOREM
EXERCISES
6 NUMBER THEORETIC FUNCTIONS
THE TAU FUNCTION
THE SIGMA FUNCTION
MULTIPLICATIVE FUNCTIONS
PERFECT NUMBERS REVISITED
MERSENNE PRIMES
F(n) = ∑) = ∑f(d) WHERE d IS A DIVISOR OF n
THE MÖBIUS FUNCTION
THE RIEMANN ZETA FUNCTION
EXERCISES
7 THE EULER PHI FUNCTION
THE PHI FUNCTION
EULER’S GENERALIZATION OF FERMAT’S LITTLE THEOREM
PHI OF A PRODUCT OF m AND n WHEN gcd(m,n) > 1) > 1
THE ORDER OF a (mod n)
PRIMITIVE ROOTS
THE INDEX OF m (mod p) RELATIVE TO a
TO BE OR NOT TO BE A QUADRATIC RESIDUE
THE LEGENDRE SYMBOL
QUADRATIC RECIPROCITY
LAW OF QUADRATIC RECIPROCITY
WHEN DOES x2 = a (mod n) HAVE A SOLUTION?
EXERCISES
8 SUMS AND PARTITIONS
AN nTH POWER IS THE SUM OF TWO SQUARES
SOLUTIONS TO THE DIOPHANTINE EQUATION a2 + b2 + c2 = d2
ROW SUMS OF A TRIANGULAR ARRAY OF CONSECUTIVE ODD NUMBERS
PARTITIONS
WHEN IS A NUMBER THE SUM OF TWO SQUARES?
SUMS OF FOUR OR FEWER SQUARES
EXERCISES
9 CRYPTOGRAPHY
INTRODUCTION AND HISTORY
PUBLIC-KEY CRYPTOGRAPHY
FACTORING LARGE NUMBERS
THE KNAPSACK PROBLEM
SUPERINCREASING SEQUENCES
EXERCISES
ANSWERS OR HINTS TO SELECTED EXERCISES
CHAPTER 1
CHAPTER 2
CHAPTER 3
CHAPTER 4
CHAPTER 5
CHAPTER 6
CHAPTER 7
CHAPTER 8
CHAPTER 9
INDEX
END USER LICENSE AGREEMENT
Search in book...
Toggle Font Controls
Playlists
Add To
Create new playlist
Name your new playlist
Playlist description (optional)
Cancel
Create playlist
Sign In
Email address
Password
Forgot Password?
Create account
Login
or
Continue with Facebook
Continue with Google
Sign Up
Full Name
Email address
Confirm Email Address
Password
Login
Create account
or
Continue with Facebook
Continue with Google
Prev
Previous Chapter
COVER
Next
Next Chapter
TITLE PAGE
CONTENTS
COVER
TITLE PAGE
PREFACE
WORDS
NOTATION IN MATHEMATICAL WRITING AND IN PROGRAMMING
1 SPECIAL NUMBERS: TRIANGULAR, OBLONG, PERFECT, DEFICIENT, AND ABUNDANT
TRIANGULAR NUMBERS
OBLONG NUMBERS AND SQUARES
DEFICIENT, ABUNDANT, AND PERFECT NUMBERS
EXERCISES
2 FIBONACCI SEQUENCE, PRIMES, AND THE PELL EQUATION
PRIME NUMBERS AND PROOF BY CONTRADICTION
PROOF BY CONSTRUCTION
SUMS OF TWO SQUARES
BUILDING A PROOF ON PRIOR ASSERTIONS
SIGMA NOTATION
SOME SUMS
FINDING ARITHMETIC FUNCTIONS
FIBONACCI NUMBERS
AN INFINITE PRODUCT
THE PELL EQUATION
GOLDBACH’S CONJECTURE
EXERCISES
3 PASCAL’S TRIANGLE
FACTORIALS
THE COMBINATORIAL NUMBERS
n
CHOOSE
k
PASCAL’S TRIANGLE
BINOMIAL COEFFICIENTS
EXERCISES
4 DIVISORS AND PRIME DECOMPOSITION
DIVISORS
GREATEST COMMON DIVISOR
DIOPHANTINE EQUATIONS
LEAST COMMON MULTIPLE
PRIME DECOMPOSITION
SEMIPRIME NUMBERS
WHEN IS A NUMBER AN
m
TH POWER?
TWIN PRIMES
FERMAT PRIMES
ODD PRIMES ARE DIFFERENCES OF SQUARES
WHEN IS
n
A LINEAR COMBINATION OF
a
AND
b
?
PRIME DECOMPOSITION OF
n
!
NO NONCONSTANT POLYNOMIAL WITH INTEGER COEFFICIENTS ASSUMES ONLY PRIME VALUES
EXERCISES
5 MODULAR ARITHMETIC
CONGRUENCE CLASSES MOD
k
LAWS OF MODULAR ARITHMETIC
MODULAR EQUATIONS
FERMAT’S LITTLE THEOREM
FERMAT’S LITTLE THEOREM
MULTIPLICATIVE INVERSES
WILSON’S THEOREM
WILSON’S THEOREM
WILSON’S THEOREM (2ND VERSION)
SQUARES AND QUADRATIC RESIDUES
LAGRANGE’S THEOREM
LAGRANGE’S THEOREM
REDUCED PYTHAGOREAN TRIPLES
CHINESE REMAINDER THEOREM
CHINESE REMAINDER THEOREM
EXERCISES
6 NUMBER THEORETIC FUNCTIONS
THE
TAU
FUNCTION
THE
SIGMA
FUNCTION
MULTIPLICATIVE FUNCTIONS
PERFECT NUMBERS REVISITED
MERSENNE PRIMES
F
(
n
) = ∑
f
(
d
) WHERE
d
IS A DIVISOR OF
n
THE MÖBIUS FUNCTION
THE RIEMANN ZETA FUNCTION
EXERCISES
7 THE EULER PHI FUNCTION
THE
PHI
FUNCTION
EULER’S GENERALIZATION OF FERMAT’S LITTLE THEOREM
PHI OF A PRODUCT OF
m
AND
n
WHEN
gcd
(
m
,
n
) > 1
THE ORDER OF
a
(
mod n
)
PRIMITIVE ROOTS
THE INDEX OF
m
(
mod p
) RELATIVE TO
a
TO BE OR NOT TO BE A QUADRATIC RESIDUE
THE LEGENDRE SYMBOL
QUADRATIC RECIPROCITY
LAW OF QUADRATIC RECIPROCITY
WHEN DOES
x
2
=
a
(
mod n
) HAVE A SOLUTION?
EXERCISES
8 SUMS AND PARTITIONS
AN
n
TH POWER IS THE SUM OF TWO SQUARES
SOLUTIONS TO THE DIOPHANTINE EQUATION
a
2
+
b
2
+
c
2
=
d
2
ROW SUMS OF A TRIANGULAR ARRAY OF CONSECUTIVE ODD NUMBERS
PARTITIONS
WHEN IS A NUMBER THE SUM OF TWO SQUARES?
SUMS OF FOUR OR FEWER SQUARES
EXERCISES
9 CRYPTOGRAPHY
INTRODUCTION AND HISTORY
PUBLIC-KEY CRYPTOGRAPHY
FACTORING LARGE NUMBERS
THE KNAPSACK PROBLEM
SUPERINCREASING SEQUENCES
EXERCISES
ANSWERS OR HINTS TO SELECTED EXERCISES
CHAPTER 1
CHAPTER 2
CHAPTER 3
CHAPTER 4
CHAPTER 5
CHAPTER 6
CHAPTER 7
CHAPTER 8
CHAPTER 9
INDEX
END USER LICENSE AGREEMENT
List of Tables
Chapter 09
Table 9.1
Table 9.2
List of Illustrations
Chapter 08
Figure 8.1 A matrix representation of the partition 3 + 3 + 2 + 1 of 9.
Figure 8.2 The transpose of the matrix of Figure 8.1.
Guide
Cover
Table of Contents
Begin Reading
Pages
iii
iv
v
xi
xii
xiii
xiv
xv
xvi
xvii
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
114
115
116
117
118
119
120
121
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
Add Highlight
No Comment
..................Content has been hidden....................
You can't read the all page of ebook, please click
here
login for view all page.
Day Mode
Cloud Mode
Night Mode
Reset