If n is a positive integer, we say the integers a and b are congruent modulo n, and write a. Universityofillinois,1914 thesis submittedinpartialfulfillmentoftherequirementsforthe degreeof masterofarts. Introduction to congruences mathematics libretexts. Recall that a prime number is an integer greater than 1 whose only positive factors are 1 and the number itself. As with so many concepts we will see, congruence is simple, perhaps familiar to you, yet enormously useful and powerful in the study of number theory. Congruence problems of number theory in mathematical. Number theory is a branch of mathematics concerned with properties of the integers. Congruences satisfy a number of important properties, and are extremely useful in many areas of number theory. Subsequent chapters present proofs of fermats and wilsons theorems, introduce number theoretic functions, and explore the quadratic reciprocity theorem. This notation, and much of the elementary theory of congruence, is due. The systematic study of number theory was initiated around 300b.
Number theory using congruence to find the remainder for large values. An introduction to the theory of numbers open textbook. This book, which presupposes familiarity only with the most elementary concepts of arithmetic divisibility properties, greatest common divisor, etc. This is a book about prime numbers, congruences, secret messages, and. On principal congruences and the number of congruences of a lattice with more ideals than filters. This free course, introduction to number theory, is a branch of mathematics concerned with the properties of integers. The libretexts libraries are powered by mindtouch and are supported by the department of education open textbook pilot project, the uc davis office of the provost, the uc davis library, the california state university affordable learning solutions program, and merlot. This is a book about prime numbers, congruences, secret messages, and elliptic curves that you can read cover to cover. There are many useful facts about congruences some of. For example, here are some problems in number theory that remain unsolved. From the elementary theory of numbers it is known that if the congruences. We say that \a\ is congruent to \b\ modulo \m\ if \m \mid ab\ where \a\ and \b \ are integers, i. Pages in category theorems in number theory the following 109 pages are in this category, out of 109 total.
It grew out of undergr uate courses that the author taught at harvard, uc san diego, and the university of washington. Congruence is an important concept in number theory. It grew out of undergraduate courses that the author taught at harvard, uc san diego, and the university of washington. We also acknowledge previous national science foundation support under grant numbers 1246120, 1525057, and 14739.
From the division algorithm, q and r are uniquely determined. It is well kno wn from the theory of congruence varieties and. Section 1 introduces euclids algorithm, which is used to find the hcf of two integers, and the idea of congruences, mathematical statements used to compare remainders when two integers are each divided by another integer. As we mentioned in the introduction, the theory of congruences was developed by gauss at the beginning of the nineteenth century. This book was written as a text for the learning of number theory, not as a referente. By remainder, of course, we mean the unique number r defined by the division algorithm. The opening chapters offer sound explanations of the basics of elementary number theory and develop the fundamental properties of integers and congruences.
823 343 645 1361 151 1185 948 1016 476 131 1341 6 627 1518 403 4 899 71 1161 664 284 6 1260 686 647 599 1313 882 879 566 290 1366 1006 1410 1308 1132 546 1345 273 1158 1349 1379 865 1074 79 1283 64