Atnaujinkite slapukų nuostatas

Unsolved Problems in Number Theory 2nd Revised edition, v. 1 [Kietas viršelis]

4.62/5 (15 ratings by Goodreads)
  • Formatas: Hardback, 301 pages, 18fig.
  • Serija: Problem Books in Mathematics
  • Išleidimo metai: 01-Aug-1994
  • Leidėjas: Springer-Verlag New York Inc.
  • ISBN-10: 0387942890
  • ISBN-13: 9780387942896
Kitos knygos pagal šią temą:
  • Formatas: Hardback, 301 pages, 18fig.
  • Serija: Problem Books in Mathematics
  • Išleidimo metai: 01-Aug-1994
  • Leidėjas: Springer-Verlag New York Inc.
  • ISBN-10: 0387942890
  • ISBN-13: 9780387942896
Kitos knygos pagal šią temą:
Unsolved Problems in Number Theory contains discussions of hundreds of open questions, organized into 185 different topics. They represent numerous aspects of number theory and are organized into six categories: prime numbers, divisibility, additive number theory, Diophantine equations, sequences of integers, and miscellaneous. To prevent repetition of earlier efforts or duplication of previously known results, an extensive and up-to-date collection of references follows each problem. In the second edition, not only extensive new material has been added, but corrections and additions have been included throughout the book.
Preface to the First Edition v
Preface to the Second Edition vii
Glossary of Symbols xiii
Introduction 1(2)
Prime Numbers
3(41)
Prime values of quadratic functions
4(3)
Primes connected with factorials
7(1)
Mersenne primes. Repunits. Fermat numbers. Primes of shape k . 2n + 2
8(5)
The prime number race
13(2)
Arithmetic progressions of primes
15(2)
Consecutive primes in A.P.
17(1)
Cunningham chains
18(1)
Gaps between primes. Twin primes
19(4)
Patterns of primes
23(2)
Gilbreath's conjecture
25(1)
Increasing and decreasing gaps
26(1)
Pseudoprimes. Euler pseudoprimes. Strong pseudoprimes
26(4)
Carmichael numbers
30(2)
``Good'' primes and the prime number graph
32(1)
Congruent products of consecutive numbers
33(1)
Gaussian primes. Eisenstein-Jacobi primes
33(3)
Formulas for primes
36(5)
The Erdos-Selfridge classification of primes
41(1)
Values of n making n -- 2k prime. Odd numbers not of the form ±pa ± 2b
42(2)
Divisibility
44(61)
Perfect numbers
44(1)
Almost perfect, quasi-perfect, pseudoperfect, harmonic, weird, multiperfect and hyperperfect numbers
45(8)
Unitary perfect numbers
53(2)
Amicable numbers
55(4)
Quasi-amicable or betrothed numbers
59(1)
Aliquot sequences
60(2)
Aliquot cycles or sociable numbers
62(1)
Unitary aliquot sequences
63(2)
Superperfect numbers
65(1)
Untouchable numbers
66(1)
Solutions of mσ(m) = nσ(n)
67(1)
Analogs with d(n), σk(n)
67(1)
Solutions of σ(n) = σ(n + 1)
68(1)
Some irrational series
69(1)
Solutions of σ(q) + σ(r) = σ(q + r)
69(1)
Powerful numbers
70(3)
Exponential-perfect numbers
73(1)
Solutions of d(n) = d(n + 1)
73(2)
(m,n + 1) and (m + 1,n) with same set of prime factors
75(2)
Cullen numbers
77(1)
k . 2n + 1 composite for all n
77(2)
Factorial n as the product of n large factors
79(1)
Equal products of factorials
79(1)
The largest set with no member dividing two others
80(1)
Equal sums of geometic progressions with prime ratios
81(1)
Densest set with no l pairwise coprime
81(1)
The number of prime factors of n + k which don't divide n + i, 0 ≤ i < k
82(1)
Consecutive numbers with distinct prime factors
83(1)
Is x determined by the prime divisors of x + 1, x + 2, ..., x + k?
83(1)
A small set whose product is square
84(1)
Binomial coefficients
84(1)
Grimm's conjecture
85(2)
Largest divisor of a binomial coefficient
87(2)
If there's an i such that n - i divides (nk)
89(1)
Products of consecutive numbers with the same prime factors
89(1)
Euler's totient function
90(2)
Does &phis;(n) properly divide n -- 1?
92(1)
Solutions of &phis;(m) = σ(n)
93(1)
Carmichael's conjecture
94(1)
Gaps between totatives
95(1)
Iterations of &phis; and σ
96(3)
Behavior of &phis;(σ(n)) and σ(&phis;(n))
99(1)
Alternating sums of factorials
99(1)
Sums of factorials
100(1)
Euler numbers
101(1)
The largest prime factor of n
101(1)
When does 2a -- 2b divide na -- nb?
102(1)
Products taken over primes
102(1)
Smith numbers
103(2)
Additive Number Theory
105(34)
Goldbach's conjecture
105(2)
Sums of consecutive primes
107(1)
Lucky numbers
108(1)
Ulam numbers
109(1)
Sums determining members of a set
110(1)
Addition chains. Brauer chains. Hansen chains
111(2)
The money-changing problem
113(1)
Sets with distinct sums of subsets
114(1)
Packing sums of pairs
115(3)
Modular difference sets and error correcting codes
118(3)
Three-subsets with distinct sums
121(2)
The postage stamp problem
123(4)
The corresponding modular covering problem. Harmonious labelling of graphs
127(1)
Maximal sum-free sets
128(1)
Maximal zero-sum-free sets
129(2)
Nonaveraging sets. Nondividing sets
131(1)
The minimum overlap problem
132(1)
The n queens problem
133(2)
Is a weakly independent sequence the finite union of strongly independent ones?
135(1)
Sums of squares
136(3)
Diophantine Equations
139(60)
Sums of like powers. Euler's conjecture
139(5)
The Fermat problem
144(2)
Figurate numbers
146(4)
Sums of l kth powers
150(1)
Sum of four cubes
151(1)
An elementary solution of x2 = 2y4 -- 1
152(1)
Sum of consecutive powers made a power
153(1)
A pyramidal diophantine equation
154(1)
Difference of two powers
155(2)
Exponential diophantine equations
157(1)
Egyptian fractions
158(8)
Markoff numbers
166(2)
The equation xxyy = zz
168(1)
ai + bj made squares
169(1)
Numbers whose sums in pairs make squares
170(1)
Triples with the same sum and same product
171(1)
Product of blocks of consecutive integers not a power
172(1)
Is there a perfect cuboid? Four squares whose sums in pairs are square. Four squares whose differences are square
173(8)
Rational distances from the corners of a square
181(4)
Six general points at rational distances
185(3)
Triangles with integer sides, medians and area
188(2)
Simplexes with rational contents
190(1)
Some quartic equations
191(2)
Sum equals product
193(1)
Equations involving factorial n
193(1)
Fibonacci numbers of various shapes
194(1)
Congruent numbers
195(2)
A reciprocal diophantine equation
197(2)
Sequences of Integers
199(41)
A thin sequence with all numbers equal to a member plus a prime
199(1)
Density of a sequence with l.c.m. of each pair less than x
200(1)
Density of integers with two comparable divisors
201(1)
Sequence with no member dividing the product of r others
201(1)
Sequence with members divisible by at least one of a given set
202(1)
Sequence with sums of pairs not members of a given sequence
203(1)
A series and a sequence involving primes
203(1)
Sequence with no sum of a pair a square
203(1)
Partitioning the integers into classes with numerous sums of pairs
204(1)
Theorem of van der Waerden. Szemeredi's theorem. Partitioning the integers into classes; at least one contains an A.P.
204(5)
Schur's problem. Partitioning integers into sum-free classes
209(2)
The modular version of Schur's problem
211(2)
Partitioning into strongly sum-free classes
213(1)
Rado's generalizations of van der Waerden's and Schur's problems
213(1)
A recursion of Gobel
214(1)
Collatz's sequence
215(3)
Permutation sequences
218(1)
Mahler's Z-numbers
219(1)
Are the integer parts of the powers of a fraction infinitely often prime?
220(1)
Davenport-Schinzel sequences
220(2)
Thue sequences
222(2)
Cycles and sequences containing all permutations as subsequences
224(1)
Covering the integers with A.P.s
224(1)
Irrationality sequences
225(1)
Silverman's sequence
225(1)
Epstein's Put-or-Take-a-Square game
226(1)
Max and mex sequences
227(1)
B2-sequences
228(1)
Sequence with sums and products all in one of two classes
229(1)
MacMahon's prime numbers of measurement
230(1)
Three sequences of Hofstadter
231(1)
B2-sequences formed by the greedy algorithm
232(1)
Sequences containing no monotone A.P.s
233(1)
Happy numbers
234(1)
The Kimberling shuffle
235(2)
Klarner-Rado sequences
237(1)
Mousetrap
237(1)
Odd sequences
238(2)
None of the Above
240(28)
Gauß's lattice point problem
240(1)
Lattice points with distinct distances
241(1)
Lattice points, no four on a circle
241(1)
The no-three-in-line problem
242(2)
Quadratic residues. Schur's conjecture
244(1)
Patterns of quadratic residues
245(3)
A cubic analog of a Pell equation
248(1)
Quadratic residues whose differences are quadratic residues
248(1)
Primitive roots
248(1)
Residues of powers of two
249(1)
Distribution of residues of factorials
250(1)
How often are a number and its inverse of opposite parity?
251(1)
Covering systems of congruences
251(2)
Exact covering systems
253(3)
A problem of R.L. Graham
256(1)
Products of small prime powers dividing n
256(1)
Series associated with the ζ-function
257(1)
Size of the set of sums and products of a set
258(1)
Partitions into distinct primes with maximum product
258(1)
Continued fractions
259(1)
All partial quotients one or two
259(1)
Algebraic numbers with unbounded partial quotients
260(1)
Small differences between powers of 2 and 3
261(1)
Squares with just two different decimal digits
262(1)
The persistence of a number
262(1)
Expressing numbers using just ones
263(1)
Mahler's generalization of Farey series
263(2)
A determinant of value one
265(1)
Two congruences, one of which is always solvable
266(1)
A polynomial whose sums of pairs of values are all distinct
266(1)
An unusual digital problem
266(2)
Index of Authors Cited 268(12)
General Index 280