Welcome to UE Central Library

Keep Smiling

Number theory : (Record no. 20201)

MARC details
000 -LEADER
fixed length control field 02052cam a22002175i 4500
001 - CONTROL NUMBER
control field 21300454
005 - DATE AND TIME OF LATEST TRANSACTION
control field 20210719151737.0
008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION
fixed length control field 191121s2020 nyu 000 0 eng
020 ## - INTERNATIONAL STANDARD BOOK NUMBER
International Standard Book Number 9780198846734 (pbk)
040 ## - CATALOGING SOURCE
Transcribing agency UE-CL
082 ## - DEWEY DECIMAL CLASSIFICATION NUMBER
Classification number 512.7
Item number Si643
100 1# - MAIN ENTRY--PERSONAL NAME
Personal name Singh, Kuldeep,
245 10 - TITLE STATEMENT
Title Number theory :
Remainder of title step by step /
Statement of responsibility, etc Kuldeep Singh.
250 ## - EDITION STATEMENT
Edition statement 1e.
260 ## - PUBLICATION, DISTRIBUTION, ETC. (IMPRINT)
Place of publication, distribution, etc Oxford :
Name of publisher, distributor, etc Oxford University Press,
Date of publication, distribution, etc 2020
300 ## - PHYSICAL DESCRIPTION
Extent xi, 385 p.
650 ## - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Number theory
942 ## - ADDED ENTRY ELEMENTS (KOHA)
Koha item type Books
505 0# - FORMATTED CONTENTS NOTE
Formatted contents note 1: A Survey of Divisibility2: Primes and Factorization3: Theory of Modular Arithmetic4: A Survey of Modular Arithmetic with Prime Moduli5: Euler's Generalization of Fermat's Theorem6: Primitive Roots and Indices7: Quadratic Residues8: Non-Linear Diophantine Equations
520 ## - SUMMARY, ETC.
Summary, etc "This book examines the patterns and beauty of positive integers by using elementary methods. It discusses some of the outstanding problems which have not been resolved even after hundreds of years of trying. A challenging problem, even for powerful computers, is factorizing integers and the book highlights some methods that are used to simplify this. We factorize integers of the type and solve the equivalent non - linear Diophantine equation where p is prime. To see if such equations have integer solutions, we use the 'Law of Quadratic Reciprocity' which is one of the most powerful results in number theory. The methods of factorization use a new arithmetic called 'clock arithmetic' which also helps in finding the last few digits of a large number without writing down all the digits. The book applies clock arithmetic to test whether a given number is prime or composite. We conclude by showing one of the great results of mathematics that a prime number which leaves a reminder of one after dividing by four can be written as the sum of two squares. However, a prime number which leaves a reminder of three after dividing by four cannot be written as the sum of two squares. Most of the results in the book are placed in an historical context"--
Holdings
Withdrawn status Damaged status Not for loan Home library Current library Date acquired Full call number Barcode Date last seen Price effective from Koha item type
      UE-Central Library UE-Central Library 19.07.2021 512.7 Si643 T13669 14.12.2022 19.07.2021 Books
      UE-Central Library UE-Central Library 19.07.2021 512.7 Si643 T13670 01.07.2024 19.07.2021 Books
Copyright © 2023, University of Education, Lahore. All Rights Reserved.
Email:centrallibrary@ue.edu.pk