{
"type": "Article",
"authors": [
{
"type": "Person",
"familyNames": [
"Allouche"
],
"givenNames": [
"Jean-Paul"
]
}
],
"identifiers": [],
"title": "Book Review: “Number Theory” by Andrej Dujella",
"meta": {},
"content": [
{
"type": "Figure",
"id": "fig1",
"licenses": [
{
"type": "CreativeWork",
"content": [
{
"type": "Paragraph",
"content": [
"All rights reserved."
]
}
]
}
],
"content": [
{
"type": "ImageObject",
"contentUrl": "43-1.png",
"mediaType": "image/png",
"meta": {
"inline": false
}
}
]
},
{
"type": "Paragraph",
"id": "p1",
"content": [
"As a student of Number Theory, I really appreciated the famous book of G. H. Hardy and E. M. Wright, while some of my friends frequently mentioned the book of Z. I. Borevich and I. R. Shafarevich.\nOf course, even these two books did not cover the whole (huge) field of Number Theory, and several other excellent books could be cited as well.\nMore recently, many books have been devoted to (parts of) this vast field whose characteristic is to be both primary and not primary (pun intended).\nThe meaning of the expression “Number Theory” itself has changed over time – partly because the domain has exploded – to the point that some contemporary authors now refer to “Modern Number Theory” …"
]
},
{
"type": "Paragraph",
"id": "p2",
"content": [
"A very recent book, entitled ",
{
"type": "Emphasis",
"content": [
"Number Theory"
]
},
" and based on teaching materials, has been written by A. Dujella.\nDevoted to several subfields of this domain, this book is both extremely nice to read and to work from.\nIt starts from primary results given in the first three chapters, ranging from the Peano axioms to the principle of induction, from the Fibonacci numbers to Euclid’s algorithm, from prime numbers to congruences, and so on.\nChapter 3 ends with primitive roots, decimal representation of rationals, and pseudoprimes.\nChapters 4 and 5 then deal with quadratic residues (including the computation of square roots modulo a prime number) and quadratic forms (including the representation of integers as sums of ",
{
"type": "MathFragment",
"mathLanguage": "mathml",
"text": "2",
"meta": {
"altText": "2"
}
},
", ",
{
"type": "MathFragment",
"mathLanguage": "mathml",
"text": "4",
"meta": {
"altText": "4"
}
},
", or ",
{
"type": "MathFragment",
"mathLanguage": "mathml",
"text": "3",
"meta": {
"altText": "3"
}
},
" squares).\nChapters 6 and 7 are devoted to arithmetic functions (in particular, multiplicative functions, asymptotic behaviour of the summatory function of classical arithmetic functions, and the Dirichlet product), and to the distribution of primes (elementary estimates for the number of primes less than a given number, the Riemann function, Dirichlet characters, and a proof that an infinite number of primes are congruent to ",
{
"type": "MathFragment",
"mathLanguage": "mathml",
"text": "ℓ",
"meta": {
"altText": "\\ell"
}
},
" modulo ",
{
"type": "MathFragment",
"mathLanguage": "mathml",
"text": "k",
"meta": {
"altText": "k"
}
},
" when ",
{
"type": "MathFragment",
"mathLanguage": "mathml",
"text": "gcd(ℓ,k)=1",
"meta": {
"altText": "\\gcd(\\ell,k)=1"
}
},
").\nChapter 8 deals with first results on Diophantine approximation, from continued fractions to Newton approximations and the LLL algorithm, while Chapter 9 studies applications of Diophantine approximation to cryptography (RSA, attacks on RSA, etc.).\nActually two more chapters are devoted to Diophantine approximation, Chapter 10 (linear Diophantine approximation, Pythagorean triangles, Pellian equations, the Local-global principle, …) and Chapter 14 (Thue equations, the method of Tzanakis, linear forms in logarithms, Baker–Davenport reduction, …).\nChapters 11, 12, and 13 deal with polynomials, algebraic numbers, and approximation of algebraic numbers.\nThe book ends with Chapters 15 and 16 which cover elliptic curves and Diophantine problems."
]
},
{
"type": "Paragraph",
"id": "p3",
"content": [
"This quick and largely incomplete description clearly shows that this book addresses many jewels of number theory.\nThis is done in a particularly appealing way, mostly elementary when possible, with many well-chosen examples and attractive exercises.\nI arbitrarily choose two delightful examples, the kind of “elementary” statements that a beginner could attack, but whose proofs require some ingenuity, namely the unexpected statements 4.6 and 4.7:"
]
},
{
"type": "Claim",
"id": "S4.Thmexample6",
"label": "Example 4.6.",
"title": [
{
"type": "Strong",
"content": [
"Example 4.6"
]
},
{
"type": "Strong",
"content": [
"."
]
}
],
"content": [
{
"type": "Paragraph",
"id": "S4.Thmexample6.p1",
"content": [
"Let ",
{
"type": "MathFragment",
"mathLanguage": "mathml",
"text": "5\" display=\"inline\">p>5",
"meta": {
"altText": "p>5"
}
},
" be a prime number.\nProve that there are two consecutive positive integers that are both quadratic residues and two consecutive positive integers that are both quadratic nonresidues modulo ",
{
"type": "MathFragment",
"mathLanguage": "mathml",
"text": "p",
"meta": {
"altText": "p"
}
},
"."
]
}
]
},
{
"type": "Claim",
"id": "S4.Thmexample7",
"label": "Example 4.7.",
"title": [
{
"type": "Strong",
"content": [
"Example 4.7"
]
},
{
"type": "Strong",
"content": [
"."
]
}
],
"content": [
{
"type": "Paragraph",
"id": "S4.Thmexample7.p1",
"content": [
"Let ",
{
"type": "MathFragment",
"mathLanguage": "mathml",
"text": "n",
"meta": {
"altText": "n"
}
},
" be an integer of the form ",
{
"type": "MathFragment",
"mathLanguage": "mathml",
"text": "16k+12",
"meta": {
"altText": "16\\,k+12"
}
},
" and let ",
{
"type": "MathFragment",
"mathLanguage": "mathml",
"text": "{b1,b2,b3,b4}",
"meta": {
"altText": "\\{b_{1},b_{2},b_{3},b_{4}\\}"
}
},
" be a set of integers such that ",
{
"type": "MathFragment",
"mathLanguage": "mathml",
"text": "bi⋅bj+n",
"meta": {
"altText": "b_{i}\\cdot b_{j}+n"
}
},
" is a perfect square for all ",
{
"type": "MathFragment",
"mathLanguage": "mathml",
"text": "i,j",
"meta": {
"altText": "i,j"
}
},
" such that ",
{
"type": "MathFragment",
"mathLanguage": "mathml",
"text": "i≠j",
"meta": {
"altText": "i\\neq j"
}
},
".\nProve that all numbers ",
{
"type": "MathFragment",
"mathLanguage": "mathml",
"text": "bi",
"meta": {
"altText": "b_{i}"
}
},
" are even."
]
}
]
},
{
"type": "Paragraph",
"id": "p4",
"content": [
"The book also comprises short historical indications and 426 references.\nIt really made me think of my first reading of Hardy and Wright, and I almost felt regret that I cannot start studying Number Theory again from scratch, but using this book! I highly recommend it not only to neophytes, but also to more “established” scientists who would like to start learning Number Theory, or to refresh and increase their knowledge of the field in an entertaining and subtle way."
]
},
{
"type": "Paragraph",
"content": [
"Textbook of the University of Zagreb,\nŠkolska knjiga, Zagreb, 2021, 621 pages,\ntranslated by Petra Švob,\nISBN 978-953-0-30897-8\n"
]
},
{
"type": "Paragraph",
"id": "authorinfo",
"content": [
"\nJean-Paul Allouche is ",
{
"type": "Emphasis",
"content": [
"Directeur de recherche"
]
},
" emeritus at CNRS.\nHe is working at IMJ-PRG, Sorbonne, Paris on subjects relating number theory and theoretical computer science, including the so-called ",
{
"type": "Emphasis",
"content": [
"automatic sequences."
]
},
{
"type": "Link",
"target": "mailto:jean-paul.allouche@imj-prg.fr",
"content": [
"jean-paul.allouche@imj-prg.fr"
]
}
]
}
]
}