素数.rar
(1.44 MB, 下载次数: 12)
Entries A to Z. % W2 q/ q2 `" q c8 Z
abc conjecture.
abundant number. 4 h$ \6 m% ^* J# p% j" H8 f
AKS algorithm for primality testing. ; y. j8 G; d4 H! [
aliquot sequences (sociable chains).
almost-primes.
amicable numbers. . a* \/ d9 g1 P! m/ N6 L* r
amicable curiosities. 5 `; P" X% i2 Q) X9 M/ y' s! |* x
Andrica’s conjecture. 1 X5 I+ B! ^0 Z5 W+ \
arithmetic progressions, of primes. . |& Q+ m: g7 L3 R+ f4 m3 L
Aurifeuillian factorization. 8 R: B* b' g9 f, _% d9 b/ X
average prime.
Bang’s theorem. 3 t9 f2 R% P4 C, p* c+ H
Bateman’s conjecture. # {! {: t3 ]3 r V5 ?
Beal’s conjecture, and prize.
Benford’s law. d+ s7 q6 {3 P2 x$ I
Bernoulli numbers.
Bernoulli number curiosities. % D" H- ]% P( v
Bertrand’s postulate.
Bonse’s inequality.
Brier numbers. 1 r3 o0 y0 f2 L) Y# o7 ]
Brocard’s conjecture. $ l% |$ B% C6 H/ _ e- ~9 T, h, i
Brun’s constant.
Buss’s function.
Carmichael numbers. , w( a: ~. ^( ^# U5 M2 i
Catalan’s conjecture.
Catalan’s Mersenne conjecture.
Champernowne’s constant.
champion numbers. ( ?, N6 k2 a3 X) \* b1 k
Chinese remainder theorem.
cicadas and prime periods. # K/ m2 u5 h( r7 W
circle, prime.
circular prime. 2 Z0 E3 J# C0 m8 @* ~, |& B
Clay prizes, the.
compositorial.
concatenation of primes. 3 O* N2 f+ }# i% ~: R- R
conjectures.
consecutive integer sequence. 4 F# @- B1 B: o: n
consecutive numbers. 6 \; `7 E& o* u4 }4 b
consecutive primes, sums of. / @1 ^* C7 O# E- p* v9 U# t0 ~
Conway’s prime-producing machine.
cousin primes. ) J6 T1 N. m. e' C4 G
Cullen primes. ! H/ t$ \1 `9 y& k
Cunningham project. 5 B. z" V5 k* h1 b- q J8 v# _4 v
Cunningham chains. & E$ y' c6 p! Q0 J, X3 j& Q
decimals, recurring (periodic).
the period of 1/13.
cyclic numbers.
Artin’s conjecture. ! n4 d8 P' d! |& W. T* U% j
the repunit connection.
magic squares.
deficient number. + x5 o! l7 z- ~
deletable and truncatable primes. / n* H" i2 l% Z7 ]
Demlo numbers.
descriptive primes.
Dickson’s conjecture.
digit properties.
Diophantus (c. AD 200; d. 284).
Dirichlet’s theorem and primes in arithmetic series.
primes in polynomials. , h w3 H3 F; Q
distributed computing.
divisibility tests.
divisors (factors). & E4 Z; k! p5 j* q1 T1 `
how many divisors? how big is d(n)? , T) k& f2 s; V& `- f! v. V
record number of divisors.
curiosities of d(n). 2 o. a$ A- B0 ` S5 q
divisors and congruences.
the sum of divisors function.
the size of σ(n). : I U, {2 k+ L
a recursive formula. & l- ^4 g P# N" y! y# } u" G
divisors and partitions.
curiosities of σ(n). : p+ p5 x. G) Y. P$ r7 u
prime factors.
divisor curiosities. 8 t5 f5 _) v' W5 ~( ^& U
economical numbers. , n5 I* H; V% t
Electronic Frontier Foundation.
elliptic curve primality proving. . B) _( M4 @" K5 _
emirp. 3 b2 n8 `: s) ? e w! h1 U, L
Eratosthenes of Cyrene, the sieve of.
Erd?s, Paul (1913–1996). 7 S5 g% N3 }1 L
his collaborators and Erd?s numbers.
errors.
Euclid (c. 330–270 BC).
unique factorization. 2 Z& w: G( W5 O* d. b
&Radic;2 is irrational. 2 S# U$ Z {) U ^5 K8 b' e
Euclid and the infinity of primes. 2 m, I* {0 O: d7 m9 U4 W0 \
consecutive composite numbers.
primes of the form 4n +3.
a recursive sequence. ) F3 l5 \% k* h- |4 Z7 g' a
Euclid and the first perfect number.
Euclidean algorithm.
Euler, Leonhard (1707–1783). 8 L) U) ]$ b6 k+ } L
Euler’s convenient numbers.
the Basel problem. / U U% \* ]' Z4 Q
Euler’s constant.
Euler and the reciprocals of the primes. $ X R0 @" ~) D/ D* ]; ]
Euler’s totient (phi) function.
Carmichael’s totient function conjecture.
curiosities of φ(n).
Euler’s quadratic. & b! W. W: Y m% F3 s8 }
the Lucky Numbers of Euler.
factorial.
factors of factorials.
factorial primes. . ~+ ~* l! h. J
factorial sums. 6 w/ w: @! C1 D; L! `: x6 e1 C" l
factorials, double, triple . . . .
factorization, methods of. 0 q" C9 X+ F# D, m0 G) T! R0 t
factors of particular forms.
Fermat’s algorithm. 2 x% D. {) O. F% q& r7 {2 ?
Legendre’s method.
congruences and factorization.
how difficult is it to factor large numbers? - t% c3 L; Y7 s% p3 T( @1 f6 K
quantum computation. 3 Q3 T; a, G# K1 y" `" T0 B
Feit-Thompson conjecture. : Y; M1 q: O/ f! B; h; |6 Y
Fermat, Pierre de (1607–1665). ! ]% p2 w p1 h
Fermat’s Little Theorem. 7 v9 w" L! \! V0 h1 q* ]
Fermat quotient. / J4 m; |9 E1 C; o3 D
Fermat and primes of the form x<sup>2</sup> + y<sup>2</sup>. $ x1 `4 Y5 a! X
Fermat’s conjecture, Fermat numbers, and Fermat primes. 2 c, o' o/ G& k* X3 z' }
Fermat factorization, from F<sub>5</sub> to F<sub>30</sub>.
Generalized Fermat numbers.
Fermat’s Last Theorem. , O; e8 J" u# \* S+ x
the first case of Fermat’s Last Theorem. " m" H P7 `2 {$ g
Wall-Sun-Sun primes.
Fermat-Catalan equation and conjecture. ' B- q8 P$ |" F8 J2 @3 z
Fibonacci numbers. & k/ ~0 m2 Y# V) Y: G
divisibility properties. $ v/ {! m" ^8 w$ M( @. j
Fibonacci curiosities.
édouard Lucas and the Fibonacci numbers.
Fibonacci composite sequences.
formulae for primes.
Fortunate numbers and Fortune’s conjecture. ! l/ g; R- f/ u+ Z; e
gaps between primes and composite runs. 9 k9 H9 ^0 o) c5 T
Gauss, Johann Carl Friedrich (1777–1855).
Gauss and the distribution of primes.
Gaussian primes.
Gauss’s circle problem. ) J w( a! b7 i$ X) r H. W
Gilbreath’s conjecture. 9 E. c9 ?" Q& V7 A" T4 r
GIMPS—Great Internet Mersenne Prime Search.
Giuga’s conjecture.
Giuga numbers.
Goldbach’s conjecture. ' T" E- _& S n
good primes. ( V1 X$ G. M: s' p
Grimm’s problem.
Hardy, G. H. (1877–1947). 1 o% V# J7 Q* O3 H6 q$ `+ q9 _
Hardy-Littlewood conjectures. 1 l1 T% D6 n* M* j
heuristic reasoning.
a heuristic argument by George Pólya. 5 h0 U2 K' c/ W6 b5 }/ _5 }( |
Hilbert’s 23 problems.
home prime. 5 o' _7 @$ n1 t; b! M: {
hypothesis H.
illegal prime.
inconsummate number.
induction. / [5 S+ F0 v5 e- z. X: k
jumping champion.
k-tuples conjecture, prime. ! P# r( o# X: J( c4 D
knots, prime and composite. 7 E& T$ o0 h) P4 r/ A. l
Landau, Edmund (1877–1938). + L) a4 i/ B$ U6 X
left-truncatable prime. $ H% U. p' F# H0 v' j9 @% I
Legendre, A. M. (1752–1833). & Q2 S4 d7 d. T: M1 V4 k8 ]
Lehmer, Derrick Norman (1867–1938).
Lehmer, Derrick Henry (1905–1991).
Linnik’s constant. & f5 t8 B5 C" Y0 \. C$ O/ K
Liouville, Joseph (1809–1882). . b# M! A( @* u- x+ J7 [4 [
Littlewood’s theorem.
the prime numbers race. 2 S2 Q( z: g. e+ o+ v
Lucas, édouard (1842–1891). . f1 w( _7 H/ Z1 r8 b; X
the Lucas sequence.
primality testing. ! r+ G1 S( ~2 U! `+ D V, r
Lucas’s game of calculation.
the Lucas-Lehmer test. 9 L: P, |, ]8 J, W \
lucky numbers.
the number of lucky numbers and primes.
“random” primes. 7 A8 p0 Z7 U3 O% n) ]) s4 j& A
magic squares. # W/ h# E* u) {5 V) w& p, ^
Matijasevic and Hilbert’s 10th problem.
Mersenne numbers and Mersenne primes.
Mersenne numbers.
hunting for Mersenne primes.
the coming of electronic computers.
Mersenne prime conjectures.
the New Mersenne conjecture.
how many Mersenne primes? 4 q3 u: t8 h3 o
Eberhart’s conjecture.
factors of Mersenne numbers. 0 z0 ^! h% ?" D) u2 b
Lucas-Lehmer test for Mersenne primes.
Mertens constant.
Mertens theorem. ( z$ b- e1 G! I; N& s9 U1 w% c
Mills’ theorem.
Wright’s theorem.
mixed bag. 1 a5 Q- K5 z1 N& E3 e
multiplication, fast.
Niven numbers. , _) h1 o7 T* e6 |
odd numbers as p + 2a<sup>2</sup>. 7 a6 K& |+ h ^# B' Z
Opperman’s conjecture.
palindromic primes.
pandigital primes.
Pascal’s ** and the binomial coefficients.
Pascal’s ** and Sierpinski’s gasket.
Pascal ** curiosities. 3 U( E3 }3 x5 z1 R' O2 k
patents on prime numbers.
Pépin’s test for Fermat numbers. ; h/ [" k) F/ b: V8 ]
perfect numbers.
odd perfect numbers.
perfect, multiply.
permutable primes. / M4 ?# H9 I1 h# S5 E
π, primes in the decimal expansion of. 0 L) E1 u) {8 f, d
Pocklington’s theorem.
Polignac’s conjectures. ' K; z6 d# Z n) G( h
Polignac or obstinate numbers.
powerful numbers. / C- O: I, f5 E* v* S4 [
primality testing.
probabilistic methods. ) f3 f) Y9 u8 D
prime number graph.
prime number theorem and the prime counting function. " D$ i; [& D, y% q, |
history. 2 [' `; h4 _+ h
elementary proof. " G) D, F) e6 M2 _
record calculations.
estimating p(n). & o3 p) G' }' F g# B
calculating p(n).
a curiosity. 9 I: z* T+ _ \: N# c- K) N9 N
prime pretender. 2 z7 h0 f8 r( y' a9 B
primitive prime factor. % o2 X! ]( C' B( r' H7 A( H
primitive roots.
Artin’s conjecture.
a curiosity. 1 s* l* N4 H5 J: F* E
primordial.
primorial primes.
Proth’s theorem.
pseudoperfect numbers. 1 w( l$ u4 u. a# D
pseudoprimes. 0 z9 q; `( j& {
bases and pseudoprimes. ( c! L* i; U+ I J! q" s
pseudoprimes, strong. 8 c( o2 \/ g7 I$ h
public key encryption.
pyramid, prime.
Pythagorean **s, prime.
quadratic residues.
residual curiosities. 4 j# r2 B) z2 q. C6 Z8 I# J- M/ V. d3 k
polynomial congruences.
quadratic reciprocity, law of. 8 K p: K* J5 ~, b) l9 r5 ]# c* x
Euler’s criterion.
Ramanujan, Srinivasa (1887–1920).
highly composite numbers.
randomness, of primes.
Von Sternach and a prime random walk. 9 _1 T9 h w' y% \5 m
record primes.
some records. ! {6 z, V2 A! n2 k& t3 F
repunits, prime.
Rhonda numbers.
Riemann hypothesis. 0 v0 s1 m# J5 }, M
the Farey sequence and the Riemann hypothesis.
the Riemann hypothesis and σ(n), the sum of divisors function.
squarefree and blue and red numbers. 4 `8 Z, X' O. v6 v, y1 ^
the Mertens conjecture. " U) K4 k( |; B0 s" U& ~8 E
Riemann hypothesis curiosities. " v) N- b8 j* H+ [' {
Riesel number.
right-truncatable prime.
RSA algorithm.
Martin Gardner’s challenge. 7 U$ H+ Y) f4 I
RSA Factoring Challenge, the New.
Ruth-Aaron numbers. 9 y- N- N; _) \, ]' V
Scherk’s conjecture.
semi-primes.
**y primes. y$ f4 w& o! G
Shank’s conjecture. 9 E. L7 B' Z3 n; R0 M' l( }
Siamese primes. 1 d4 y* j; ~7 l( J; }/ V
Sierpinski numbers.
Sierpinski strings.
Sierpinski’s quadratic.
Sierpinski’s φ(n) conjecture. 1 W/ ?( M9 T6 X% ^' ~5 E, D
Sloane’s On-Line Encyclopedia of Integer Sequences.
Smith numbers.
Smith brothers. 6 y* ?0 c" U! q" t) O
smooth numbers.
Sophie Germain primes. ' b$ [* Y: C; t [
safe primes.
squarefree numbers.
Stern prime.
strong law of small numbers.
triangular numbers.
trivia. 6 y7 V9 ^% j T) S8 ]; ~; Z
twin primes. # z1 z+ S4 I( `$ X5 k! s
twin curiosities.
Ulam spiral.
unitary divisors. 6 i3 t! u& Z) s; C
unitary perfect. + q8 v8 b* ?2 {$ q
untouchable numbers. , G3 F2 I) R# N, Y( ~
weird numbers. , m) }5 Q5 Q+ R) W5 n* y
Wieferich primes.
Wilson’s theorem.
twin primes.
Wilson primes. 1 A6 C) J$ q' ?1 o! E
Wolstenholme’s numbers, and theorems. ; C9 ~! b9 K0 {( D- b7 }
more factors of Wolstenholme numbers. 3 N( Y0 f2 J$ f1 P
Woodall primes. 2 C5 A* G& t' m$ @
zeta mysteries: the quantum connection.
素数.rar
(1.44 MB, 下载次数: 12)
| 欢迎光临 数学建模社区-数学中国 (http://www.madio.net/) | Powered by Discuz! X2.5 |