Prime Numbers: The Most Mysterious Figures in Math [NOOK Book]

Overview

"Before you can count from one to five, they turn simple arithmetic into difficult mathematics. The mysterious prime numbers, whose sequence starts 2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, and goes on literally forever, have intrigued and fascinated mathematicians for twenty-five centuries. Though seemingly irregular to the point of randomness, primes are, in fact, determinate. This tantalizing mix of randomness and pattern has prompted mathematicians great and small to make complex calculations, propose elegant conjectures, and imagine
... See more details below
Prime Numbers: The Most Mysterious Figures in Math

Available on NOOK devices and apps  
  • NOOK Devices
  • Samsung Galaxy Tab 4 NOOK 7.0
  • Samsung Galaxy Tab 4 NOOK 10.1
  • NOOK HD Tablet
  • NOOK HD+ Tablet
  • NOOK eReaders
  • NOOK Color
  • NOOK Tablet
  • Tablet/Phone
  • NOOK for Windows 8 Tablet
  • NOOK for iOS
  • NOOK for Android
  • NOOK Kids for iPad
  • PC/Mac
  • NOOK for Windows 8
  • NOOK for PC
  • NOOK for Mac
  • NOOK for Web

Want a NOOK? Explore Now

NOOK Book (eBook)
$13.99
BN.com price
(Save 43%)$24.95 List Price

Overview

"Before you can count from one to five, they turn simple arithmetic into difficult mathematics. The mysterious prime numbers, whose sequence starts 2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, and goes on literally forever, have intrigued and fascinated mathematicians for twenty-five centuries. Though seemingly irregular to the point of randomness, primes are, in fact, determinate. This tantalizing mix of randomness and pattern has prompted mathematicians great and small to make complex calculations, propose elegant conjectures, and imagine ever-more prime-number patterns. While some of these speculations have proved phenomenally successful, many have failed and scores, if not hundreds, remain unresolved." Prime Numbers: The Most Mysterious Figures in Math introduces these intriguing numbers and explores the many ways in which they combine utter simplicity with infinite depth and mystery. This comprehensive A-to-Z guide captures the strange attraction of primes that has entranced great minds for millennia and explains the roles that they have played in everything from Pythagorean triangles to public key cryptography.
Read More Show Less

Editorial Reviews

From the Publisher
"The book is nicely produced and is an easy read..." ("The Mathematical Gazette", November 2007)
Read More Show Less

Product Details

  • ISBN-13: 9780471718925
  • Publisher: Wiley, John & Sons, Incorporated
  • Publication date: 6/3/2005
  • Sold by: Barnes & Noble
  • Format: eBook
  • Edition number: 1
  • Pages: 288
  • File size: 3 MB

Meet the Author

DAVID WELLS is the author of numerous books of mathematical puzzles and general math, including You Are a Mathematician, also available from Wiley. He has contributed articles to The Mathematical Intelligencer and The Mathematical Gazette. Wells lives in London, England.

Read More Show Less

Table of Contents

Acknowledgments.

Author’s Note.

Introduction.

Entries A to Z.

abc conjecture.

abundant number.

AKS algorithm for primality testing.

aliquot sequences (sociable chains).

almost-primes.

amicable numbers.

amicable curiosities.

Andrica’s conjecture.

arithmetic progressions, of primes.

Aurifeuillian factorization.

average prime.

Bang’s theorem.

Bateman’s conjecture.

Beal’s conjecture, and prize.

Benford’s law.

Bernoulli numbers.

Bernoulli number curiosities.

Bertrand’s postulate.

Bonse’s inequality.

Brier numbers.

Brocard’s conjecture.

Brun’s constant.

Buss’s function.

Carmichael numbers.

Catalan’s conjecture.

Catalan’s Mersenne conjecture.

Champernowne’s constant.

champion numbers.

Chinese remainder theorem.

cicadas and prime periods.

circle, prime.

circular prime.

Clay prizes, the.

compositorial.

concatenation of primes.

conjectures.

consecutive integer sequence.

consecutive numbers.

consecutive primes, sums of.

Conway’s prime-producing machine.

cousin primes.

Cullen primes.

Cunningham project.

Cunningham chains.

decimals, recurring (periodic).

the period of 1/13.

cyclic numbers.

Artin’s conjecture.

the repunit connection.

magic squares.

deficient number.

deletable and truncatable primes.

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.

distributed computing.

divisibility tests.

divisors (factors).

how many divisors? how big is d(n)?

record number of divisors.

curiosities of d(n).

divisors and congruences.

the sum of divisors function.

the size of σ(n).

a recursive formula.

divisors and partitions.

curiosities of σ(n).

prime factors.

divisor curiosities.

economical numbers.

Electronic Frontier Foundation.

elliptic curve primality proving.

emirp.

Eratosthenes of Cyrene, the sieve of.

Erdös, Paul (1913–1996).

his collaborators and Erdös numbers.

errors.

Euclid (c. 330–270 BC).

unique factorization.

&Radic;2 is irrational.

Euclid and the infinity of primes.

consecutive composite numbers.

primes of the form 4n +3.

a recursive sequence.

Euclid and the first perfect number.

Euclidean algorithm.

Euler, Leonhard (1707–1783).

Euler’s convenient numbers.

the Basel problem.

Euler’s constant.

Euler and the reciprocals of the primes.

Euler’s totient (phi) function.

Carmichael’s totient function conjecture.

curiosities of φ(n).

Euler’s quadratic.

the Lucky Numbers of Euler.

factorial.

factors of factorials.

factorial primes.

factorial sums.

factorials, double, triple . . . .

factorization, methods of.

factors of particular forms.

Fermat’s algorithm.

Legendre’s method.

congruences and factorization.

how difficult is it to factor large numbers?

quantum computation.

Feit-Thompson conjecture.

Fermat, Pierre de (1607–1665).

Fermat’s Little Theorem.

Fermat quotient.

Fermat and primes of the form x2 + y2.

Fermat’s conjecture, Fermat numbers, and Fermat primes.

Fermat factorization, from F5 to F30.

Generalized Fermat numbers.

Fermat’s Last Theorem.

the first case of Fermat’s Last Theorem.

Wall-Sun-Sun primes.

Fermat-Catalan equation and conjecture.

Fibonacci numbers.

divisibility properties.

Fibonacci curiosities.

Édouard Lucas and the Fibonacci numbers.

Fibonacci composite sequences.

formulae for primes.

Fortunate numbers and Fortune’s conjecture.

gaps between primes and composite runs.

Gauss, Johann Carl Friedrich (1777–1855).

Gauss and the distribution of primes.

Gaussian primes.

Gauss’s circle problem.

Gilbreath’s conjecture.

GIMPS—Great Internet Mersenne Prime Search.

Giuga’s conjecture.

Giuga numbers.

Goldbach’s conjecture.

good primes.

Grimm’s problem.

Hardy, G. H. (1877–1947).

Hardy-Littlewood conjectures.

heuristic reasoning.

a heuristic argument by George Pólya.

Hilbert’s 23 problems.

home prime.

hypothesis H.

illegal prime.

inconsummate number.

induction.

jumping champion.

k-tuples conjecture, prime.

knots, prime and composite.

Landau, Edmund (1877–1938).

left-truncatable prime.

Legendre, A. M. (1752–1833).

Lehmer, Derrick Norman (1867–1938).

Lehmer, Derrick Henry (1905–1991).

Linnik’s constant.

Liouville, Joseph (1809–1882).

Littlewood’s theorem.

the prime numbers race.

Lucas, Édouard (1842–1891).

the Lucas sequence.

primality testing.

Lucas’s game of calculation.

the Lucas-Lehmer test.

lucky numbers.

the number of lucky numbers and primes.

“random” primes.

magic squares.

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?

Eberhart’s conjecture.

factors of Mersenne numbers.

Lucas-Lehmer test for Mersenne primes.

Mertens constant.

Mertens theorem.

Mills’ theorem.

Wright’s theorem.

mixed bag.

multiplication, fast.

Niven numbers.

odd numbers as p + 2a2.

Opperman’s conjecture.

palindromic primes.

pandigital primes.

Pascal’s triangle and the binomial coefficients.

Pascal’s triangle and Sierpinski’s gasket.

Pascal triangle curiosities.

patents on prime numbers.

Pépin’s test for Fermat numbers.

perfect numbers.

odd perfect numbers.

perfect, multiply.

permutable primes.

π, primes in the decimal expansion of.

Pocklington’s theorem.

Polignac’s conjectures.

Polignac or obstinate numbers.

powerful numbers.

primality testing.

probabilistic methods.

prime number graph.

prime number theorem and the prime counting function.

history.

elementary proof.

record calculations.

estimating p(n).

calculating p(n).

a curiosity.

prime pretender.

primitive prime factor.

primitive roots.

Artin’s conjecture.

a curiosity.

primordial.

primorial primes.

Proth’s theorem.

pseudoperfect numbers.

pseudoprimes.

bases and pseudoprimes.

pseudoprimes, strong.

public key encryption.

pyramid, prime.

Pythagorean triangles, prime.

quadratic residues.

residual curiosities.

polynomial congruences.

quadratic reciprocity, law of.

Euler’s criterion.

Ramanujan, Srinivasa (1887–1920).

highly composite numbers.

randomness, of primes.

Von Sternach and a prime random walk.

record primes.

some records.

repunits, prime.

Rhonda numbers.

Riemann hypothesis.

the Farey sequence and the Riemann hypothesis.

the Riemann hypothesis and σ(n), the sum of divisors function.

squarefree and blue and red numbers.

the Mertens conjecture.

Riemann hypothesis curiosities.

Riesel number.

right-truncatable prime.

RSA algorithm.

Martin Gardner’s challenge.

RSA Factoring Challenge, the New.

Ruth-Aaron numbers.

Scherk’s conjecture.

semi-primes.

sexy primes.

Shank’s conjecture.

Siamese primes.

Sierpinski numbers.

Sierpinski strings.

Sierpinski’s quadratic.

Sierpinski’s φ(n) conjecture.

Sloane’s On-Line Encyclopedia of Integer Sequences.

Smith numbers.

Smith brothers.

smooth numbers.

Sophie Germain primes.

safe primes.

squarefree numbers.

Stern prime.

strong law of small numbers.

triangular numbers.

trivia.

twin primes.

twin curiosities.

Ulam spiral.

unitary divisors.

unitary perfect.

untouchable numbers.

weird numbers.

Wieferich primes.

Wilson’s theorem.

twin primes.

Wilson primes.

Wolstenholme’s numbers, and theorems.

more factors of Wolstenholme numbers.

Woodall primes.

zeta mysteries: the quantum connection.

Appendix A: The First 500 Primes.

Appendix B: Arithmetic Functions.

Glossary.

Bibliography.

Index.

Read More Show Less

Customer Reviews

Be the first to write a review
( 0 )
Rating Distribution

5 Star

(0)

4 Star

(0)

3 Star

(0)

2 Star

(0)

1 Star

(0)

Your Rating:

Your Name: Create a Pen Name or

Barnes & Noble.com Review Rules

Our reader reviews allow you to share your comments on titles you liked, or didn't, with others. By submitting an online review, you are representing to Barnes & Noble.com that all information contained in your review is original and accurate in all respects, and that the submission of such content by you and the posting of such content by Barnes & Noble.com does not and will not violate the rights of any third party. Please follow the rules below to help ensure that your review can be posted.

Reviews by Our Customers Under the Age of 13

We highly value and respect everyone's opinion concerning the titles we offer. However, we cannot allow persons under the age of 13 to have accounts at BN.com or to post customer reviews. Please see our Terms of Use for more details.

What to exclude from your review:

Please do not write about reviews, commentary, or information posted on the product page. If you see any errors in the information on the product page, please send us an email.

Reviews should not contain any of the following:

  • - HTML tags, profanity, obscenities, vulgarities, or comments that defame anyone
  • - Time-sensitive information such as tour dates, signings, lectures, etc.
  • - Single-word reviews. Other people will read your review to discover why you liked or didn't like the title. Be descriptive.
  • - Comments focusing on the author or that may ruin the ending for others
  • - Phone numbers, addresses, URLs
  • - Pricing and availability information or alternative ordering information
  • - Advertisements or commercial solicitation

Reminder:

  • - By submitting a review, you grant to Barnes & Noble.com and its sublicensees the royalty-free, perpetual, irrevocable right and license to use the review in accordance with the Barnes & Noble.com Terms of Use.
  • - Barnes & Noble.com reserves the right not to post any review -- particularly those that do not follow the terms and conditions of these Rules. Barnes & Noble.com also reserves the right to remove any review at any time without notice.
  • - See Terms of Use for other conditions and disclaimers.
Search for Products You'd Like to Recommend

Recommend other products that relate to your review. Just search for them below and share!

Create a Pen Name

Your Pen Name is your unique identity on BN.com. It will appear on the reviews you write and other website activities. Your Pen Name cannot be edited, changed or deleted once submitted.

 
Your Pen Name can be any combination of alphanumeric characters (plus - and _), and must be at least two characters long.

Continue Anonymously
Sort by: Showing all of 2 Customer Reviews
  • Anonymous

    Posted February 21, 2012

    No text was provided for this review.

  • Anonymous

    Posted June 22, 2009

    No text was provided for this review.

Sort by: Showing all of 2 Customer Reviews

If you find inappropriate content, please report it to Barnes & Noble
Why is this product inappropriate?
Comments (optional)