Muutke küpsiste eelistusi

E-raamat: Enchantment of Numbers

  • Formaat: PDF+DRM
  • Sari: CMS/CAIMS Books in Mathematics 16
  • Ilmumisaeg: 01-Jul-2025
  • Kirjastus: Springer International Publishing AG
  • Keel: eng
  • ISBN-13: 9783031765681
Teised raamatud teemal:
  • Formaat - PDF+DRM
  • Hind: 159,93 €*
  • * hind on lõplik, st. muud allahindlused enam ei rakendu
  • Lisa ostukorvi
  • Lisa soovinimekirja
  • See e-raamat on mõeldud ainult isiklikuks kasutamiseks. E-raamatuid ei saa tagastada.
  • Formaat: PDF+DRM
  • Sari: CMS/CAIMS Books in Mathematics 16
  • Ilmumisaeg: 01-Jul-2025
  • Kirjastus: Springer International Publishing AG
  • Keel: eng
  • ISBN-13: 9783031765681
Teised raamatud teemal:

DRM piirangud

  • Kopeerimine (copy/paste):

    ei ole lubatud

  • Printimine:

    ei ole lubatud

  • Kasutamine:

    Digitaalõiguste kaitse (DRM)
    Kirjastus on väljastanud selle e-raamatu krüpteeritud kujul, mis tähendab, et selle lugemiseks peate installeerima spetsiaalse tarkvara. Samuti peate looma endale  Adobe ID Rohkem infot siin. E-raamatut saab lugeda 1 kasutaja ning alla laadida kuni 6'de seadmesse (kõik autoriseeritud sama Adobe ID-ga).

    Vajalik tarkvara
    Mobiilsetes seadmetes (telefon või tahvelarvuti) lugemiseks peate installeerima selle tasuta rakenduse: PocketBook Reader (iOS / Android)

    PC või Mac seadmes lugemiseks peate installima Adobe Digital Editionsi (Seeon tasuta rakendus spetsiaalselt e-raamatute lugemiseks. Seda ei tohi segamini ajada Adober Reader'iga, mis tõenäoliselt on juba teie arvutisse installeeritud )

    Seda e-raamatut ei saa lugeda Amazon Kindle's. 

Inspired by the classic Recreations in the Theory of NumbersThe Queen of Mathematics Entertains by Albert H. Beiler, this book brings the excitement of recreational number theory into the 21st century through the lens of computational techniques. While Beilers work, originally published in 1964, captivated readers with its breadth and charm, some sections have become dated. Here, we re-examine most of the key topics Beiler covered, while introducing fresh updates and insights rooted in computational number theory.





The authors aim to present efficient computer algorithms to tackle various problems that arise in the theory of numbers, providing a deeper and more modern perspective on these timeless puzzles. Though we cannot rival Beilers exuberant prose, we hope our enduring fascination with these topics cultivated over decades of study and teaching will shine through and resonate with readers.





The book is structured into 21 chapters, each focusing on different facets of number theory with which the authors have extensive expertise. From ancient problems to contemporary computational challenges, this volume will reignite the joy and wonder found in numbers while incorporating the power of modern computation. Whether you're a seasoned mathematician or a curious learner, this book promises a journey through the rich and playful landscape of number theory, making both historical and new discoveries accessible to all.

Introduction.- Division, factors, primes, congruences, gcd, etc.- Representations of Integers.- Integer Powers.- The Binomial Congruence.- The Binomial Coe?cients.- Public-Key Cryptography.- Fibonacci and Lucas Numbers.- Sociable Numbers.- Lucas and Lehmer Sequences.- Primality.- Prime Curios.- Linear Recurrence Sequences.- Simple Continued Fractions.- Integer Factorization.- Sieve Devices.- Simple Continued Fraction of v.- Formulas for Primes.- The Pell Equation.- Some Diophantine Equations.- Conclusion.

Eric completed his undergraduate work in 2002 from the University of Regina receiving bachelor degrees in both mathematics and computer science. He remained in Regina for his masters work, doing research on Lucas functions under the supervision of Dr. Richard McIntosh. He went on to complete his doctorate at the University of Calgary, with a dissertation titled, A Cubic Extension of the Lucas Functions, under the supervision of Dr. Hugh Williams and Dr. Siguna Muller.



Eric is an Associate Professor cross appointed between the departments of General Education and Mathematics and Computing. Eric works in the area of elementary number theory, in particular with Lucas functions and other divisibility sequences.



 Dr. Hugh Williams is internationally recognized as an expert in computational number theory and its applications to cryptography.  He has authored over 150 refereed journal papers, 30 refereed conference papers and 20 books or book chapters.  After a university career of 46 years, he was appointed Professor Emeritus in Mathematics and Statistics at the University of Calgary.