{"text_format":"2","workbook":"xls","n_sheets":1,"sheets":["report2"],"not_rendered":{"charts":0,"images":0,"macros":0,"external_links":1,"defined_names":1,"comments":0,"pivot_tables":0},"unopened":[],"bounds":{"document_bytes":16777216,"sheet_cells":100000,"run_cost":"one","rows_first":2000,"rows_last":500,"rows_between":2000,"halvings":0,"cell_chars":16384,"cell_head_chars":4096},"cells_cut":0,"cells_raw":0,"read":"whole","date_system":"1900","formulas":"cached_only"}

{"sheet":"report2","index":0,"n_rows":22,"n_cols":5,"rows_kept":22,"cut":false,"hidden":false,"merged":[[0,2,0,3],[0,4,0,5],[1,2,1,3],[1,4,1,5],[2,2,2,3],[2,4,2,5],[3,2,3,3],[4,2,4,3],[5,2,5,3],[6,2,6,3],[7,2,7,3],[8,2,8,3],[9,2,9,3],[16,2,16,3],[17,2,17,3],[19,2,19,3]],"flags":["formulas_cached_only"]}
[null,"1.","Record Nr.",null,"UNINA9911015860403321"]
[null,null,"Autore",null,"Roettger Eric L. F"]
[null,null,"Titolo",null,"The Enchantment of Numbers / / by Eric L. F. Roettger, Hugh C. Williams"]
[null,null,"Pubbl/distr/stampa",null,"Cham : , : Springer Nature Switzerland : , : Imprint : Springer, , 2025"]
[null,null,"ISBN",null,"3-031-76568-0"]
[null,null,"Edizione",null,"[1st ed. 2025.]"]
[null,null,"Descrizione fisica",null,"1 online resource (550 pages)"]
[null,null,"Collana",null,"CMS/CAIMS Books in Mathematics, , 2730-6518 ; ; 16"]
[null,null,"Disciplina",null,"510"]
[null,null,"Soggetti",null,"Mathematics"]
[{"$nulls":4},"Number theory"]
[{"$nulls":4},"General Mathematics and Education"]
[{"$nulls":4},"Number Theory"]
[{"$nulls":4},"Teoria de nombres"]
[{"$nulls":4},"Estadística matemàtica"]
[{"$nulls":4},"Llibres electrònics"]
[null,null,"Lingua di pubblicazione",null,"Inglese"]
[null,null,"Formato",null,"Materiale a stampa"]
[null,null,null,"Livello bibliografico","Monografia"]
[null,null,"Nota di contenuto",null,"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 √𝑫 -- Formulas for Primes -- The Pell Equation -- Some Diophantine Equations -- Conclusion."]
[null,null,null,"Sommario/riassunto","Inspired by the classic Recreations in the Theory of Numbers—The 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 Beiler’s 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 Beiler’s "]
[{"$nulls":4},"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."]