國立虎尾科技大學 |

Number theory with computations

Record Type:	Language materials, printed : Monograph/item
Title/Author:	Number theory with computations/ by Peter Shiu.
Author:	Shiu, Peter.
Published:	Cham :Springer Nature Switzerland : : 2024.,
Description:	xvi, 442 p. :ill. (chiefly col.), digital ; : 24 cm.;
Contained By:	Springer Nature eBook
Subject:	Number theory. -
Online resource:	https://doi.org/10.1007/978-3-031-63814-5
ISBN:	9783031638145

Number theory with computations
Shiu, Peter.

Number theory with computations[electronic resource] /by Peter Shiu. - Cham :Springer Nature Switzerland :2024. - xvi, 442 p. :ill. (chiefly col.), digital ;24 cm. - Springer undergraduate mathematics series,2197-4144. - Springer undergraduate mathematics series..

Part I Elementary Number Theory -- 1 Basics -- 2 Arithmetic functions I -- 3 Prime numbers: Euclid and Eratosthenes -- 4 Quadratic residues and congruences -- 5 Primitive roots -- 6 Sums of squares -- 7 Continued fractions -- Part II Analytic Number Theory -- 8 Diophantine approximations -- 9 Distribution of prime numbers -- 10 Arithmetic functions II -- 11 Prime number theorem -- 12 Primes in arithmetic progressions -- 13 Smooth numbers -- 14 Circle method.

This introductory text is designed for undergraduate courses in number theory, covering both elementary number theory and analytic number theory. The book emphasises computational aspects, including algorithms and their implementation in Python. The book is divided into two parts. The first part, on elementary number theory, deals with concepts such as induction, divisibility, congruences, primitive roots, cryptography, and continued fractions. The second part is devoted to analytic number theory and includes chapters on Dirichlet's theorem on primes in arithmetic progressions, the prime number theorem, smooth numbers, and the famous circle method of Hardy and Littlewood. The book contains many topics not often found in introductory textbooks, such as Aubry's theorem, the Tonelli-Shanks algorithm, factorisation methods, continued fraction representations of e, and the irrationality of (3) Each chapter concludes with a summary and notes, as well as numerous exercises. Assuming only basic calculus for the first part of the book, the second part assumes some knowledge of complex analysis. Familiarity with basic coding syntax will be helpful for the computational exercises.

ISBN: 9783031638145

Standard No.: 10.1007/978-3-031-63814-5doiSubjects--Topical Terms:

527883
Number theory.

LC Class. No.: QA241

Dewey Class. No.: 512.7

Number theory with computations
LDR:02715nam a22003495a 4500 001 1135228
003 DE-He213
005 20240903130528.0
006 m d
007 cr nn 008maaau
008 241213s2024 sz s 0 eng d
020 $a 9783031638145 $q (electronic bk.)
020 $a 9783031638138 $q (paper)
024 7 $a 10.1007/978-3-031-63814-5 $2 doi
035 $a 978-3-031-63814-5
040 $a GP $c GP
041 0 $a eng
050 4 $a QA241
072 7 $a PBH $2 bicssc
072 7 $a MAT022000 $2 bisacsh
072 7 $a PBH $2 thema
082 0 4 $a 512.7 $2 23
090 $a QA241 $b .S558 2024
100 1 $a Shiu, Peter. $3 1456878
245 1 0 $a Number theory with computations $h [electronic resource] / $c by Peter Shiu.
260 $a Cham : $c 2024. $b Springer Nature Switzerland : $b Imprint: Springer,
300 $a xvi, 442 p. : $b ill. (chiefly col.), digital ; $c 24 cm.
347 $a text file $b PDF $2 rda
490 1 $a Springer undergraduate mathematics series, $x 2197-4144
505 0 $a Part I Elementary Number Theory -- 1 Basics -- 2 Arithmetic functions I -- 3 Prime numbers: Euclid and Eratosthenes -- 4 Quadratic residues and congruences -- 5 Primitive roots -- 6 Sums of squares -- 7 Continued fractions -- Part II Analytic Number Theory -- 8 Diophantine approximations -- 9 Distribution of prime numbers -- 10 Arithmetic functions II -- 11 Prime number theorem -- 12 Primes in arithmetic progressions -- 13 Smooth numbers -- 14 Circle method.
520 $a This introductory text is designed for undergraduate courses in number theory, covering both elementary number theory and analytic number theory. The book emphasises computational aspects, including algorithms and their implementation in Python. The book is divided into two parts. The first part, on elementary number theory, deals with concepts such as induction, divisibility, congruences, primitive roots, cryptography, and continued fractions. The second part is devoted to analytic number theory and includes chapters on Dirichlet's theorem on primes in arithmetic progressions, the prime number theorem, smooth numbers, and the famous circle method of Hardy and Littlewood. The book contains many topics not often found in introductory textbooks, such as Aubry's theorem, the Tonelli-Shanks algorithm, factorisation methods, continued fraction representations of e, and the irrationality of (3) Each chapter concludes with a summary and notes, as well as numerous exercises. Assuming only basic calculus for the first part of the book, the second part assumes some knowledge of complex analysis. Familiarity with basic coding syntax will be helpful for the computational exercises.
650 0 $a Number theory. $3 527883
650 1 4 $a Number Theory. $3 672023
710 2 $a SpringerLink (Online service) $3 593884
773 0 $t Springer Nature eBook
830 0 $a Springer undergraduate mathematics series. $3 839247
856 4 0 $u https://doi.org/10.1007/978-3-031-63814-5
950 $a Mathematics and Statistics (SpringerNature-11649)