# CHAPTER 6. Prime Numbers. Definition and Fundamental Results

Size: px
Start display at page:

Download "CHAPTER 6. Prime Numbers. Definition and Fundamental Results"

Transcription

1 CHAPTER 6 Prime Numbers Part VI of PJE. Definition and Fundamental Results 6.1. Definition. (PJE definition ) An integer p is prime if p > 1 and the only positive divisors of p are 1 and p. If n > 1 and n is not prime, n is said to be composite. The integer 1 is neither prime nor composite Remark. The definition implies that n is composite if, and only if, n = ab for some integers a, b with 1 < a, b < n. (Proof If n = ab where a, b > 1, then n > 1 and n is not prime since a n, a 1, a n; thus, n is composite. Vice versa, if n is composite, then n > 1 and n has a positive divisor a other than 1 and n; this means that 1 < a < n and that n = ab with 1 < b = n/a < n.) Example. The first few prime numbers are 2, 3, 5, 7, 11, 13, 17, 19,... Aside It is a hard problem to prove that a given large integer (say with 150 digits) is prime. But some very large primes are known, such as 2 74,207,281 1 with more than 22 million decimal digits, found on 7 January 2016 by the Great Internet Mersenne Prime Search. At the time of its discovery, this was the largest known prime number. End of aside Question. What is the connection with the earlier definition of coprime? 6.3. Lemma. If p is prime and p a then p and a are coprime. Proof. PJE p.279 The only positive divisors of p are 1 and p. Out of these, p is not a divisor of a by assumption, so the only common positive divisor of p and a is 1. Hence gcd(p, a) = 1. 51

2 Prime Numbers Proposition. (PJE proposition ) Every integer n > 1 is a product of primes. (With the convention that a product can be of just one prime!) Proof PJE p.278. We prove this by strong induction. Base case: n = 2 which is a product of one prime. Indictive step: Assume that for all n such that 2 n k, n is a product of primes. Our goal is to prove that k + 1 is a product of primes. Indeed, if k + 1 is a prime, it is a product of one prime. Otherwise, k + 1 is not a prime, hence k + 1 is composite and k + 1 = ab with 1 < a, b < k + 1. But then 2 a, b k so by Inductive Hypothesis, a, b are products of primes. But then k + 1 = ab is also a product of primes. Conclusion: by strong induction, every integer n 2 is a product of primes Theorem. Euclid s property of a prime If p is a prime, then for all integers a, b, if p divides ab then p a or p b. Proof (PJE theorem but we do not assume a, b to be positive) Let a, b Z. It is enough to assume that p a and then to show that that p b. By Lemma 6.3, p is coprime to a; but p ab, so by Corollary 2.22 p b, as required. Aside This result motivates the definition of a prime in more advanced work. End of aside Example. The number 6 is not prime, because 6 has positive divisors 2, 3 which are neither 1 nor 6. Another way to prove that 6 is not prime would be to show that 6 does not possess Euclid s property of a prime. For example, 6 24, yet 24 = 3 8 and 6 3 and 6 8; hence by Theorem 6.5, 6 is not prime Corollary. If a prime p divides the product a 1 a 2... a n of integers a 1,..., a n, then p a i for some 1 i n. Proof Induction in n, see PJE proposition (proof not given in class). Now we can prove that the product of primes guaranteed by Theorem 6.4 is unique (up to ordering).

3 Prime Numbers Theorem. Fundamental Theorem of Arithmetic (PJE theorem ) Every integer greater than 1 can be written as a product of primes unique up to ordering, i.e. for all n 2 there exist unique r and unique primes p 1 p 2 p r such that n = p 1 p 2... p r. Proof PJE p.283 Existence of prime factorisation is by Proposition 6.4. To prove uniqueness, assume for contradiction that two different products of primes give the same result. Cancel all primes which appear in both products, obtaining (*) p 1 p 2... p r = q 1 q 2... q s where p i q j for all i, j. Then p 1 q 1 q 2... q s so by Corollary 6.6 p 1 q j for some j. But since q j is prime, the only divisor of q j greater than one is q j. So p 1 = q j, contradicting (*). Primality testing: how to check if n is a prime number? From the definition of a prime number, it appears that we have to check each number from 2 to n 1 to see if it is a divisor of n. The process is made more efficient by the following result Proposition. (PJE proposition ) If m is composite then m has a prime divisor not exceeding m. That is, composite m, prime p: p m and p m. Proof PJE p.280 but I give an alternative proof here. Let m = p 1 p 2... p r be the prime factorisation of m with p 1 p 2 p r. Note that r 2 since m is not a prime. Then m p 1 p 1... p 1 = p r 1 p2 1. Hence m p Application: Sieve of Eratosthenes. The following algorithm will test whether N is prime. Write out the list of natural numbers from 2 up to N. Strike out all multiples of 2, except for 2. Strike out all multiples of the next remaining number except that number itself (this will be 3). Continue, at each step striking out all multiples of the next remaining number except that number itself. Stop when the next remaining number is > N.

4 Prime Numbers 54 Since we are striking out multiples we are only striking out composite numbers. Since every composite number m N has, by Proposition 6.8, a (prime) divisor m N, we will strike out every composite number N. Thus what will remain will be the non-composite numbers, i.e. the primes, between 2 and N. So, for example, if we look for primes up to 100 we need only check for divisibility by primes up to 100 = 10, i.e. 2, 3, 5 and 7. See PJE example where this is done for N = 100. How many primes are there? Euclid was probably the first to prove, in his Elements, that there exist infinitely many prime numbers Theorem. (PJE theorem ) There are infinitely many primes. Proof. PJE p.285 seems to say that Euclid proved this by contradiction this is not the case. Euclid s proof is closer to the following. Let p 1,..., p r be any finite list of primes. We will show that there is a prime not in this list. Let N = p 1 p 2... p r + 1. By the Fundamental Theorem of Arithmetic, N has a prime divisor, say q. Note that N is not divisible by any of p 1,..., p r, since N leaves remainder 1 when divided by p i ; yet N is divisible by q. Hence q is a prime not equal to any of p 1,..., p r. Note It needs to be stressed that this N may well not be prime. The first few N are N = = 3, prime N = = 7, prime, N = = 31, prime N = = 211, prime N = = 2311, prime N = = = , composite. The point of the proof is that the prime divisors of N will be previously unseen primes. Fermat s Little Theorem and applications Lemma. If p is prime then p divides the binomial coefficient p 1. ( ) p for 1 r r

5 Proof. Recall that, whenever r is between 1 and p 1, Prime Numbers 55 ( ) ( ) p p 1 r = p r r 1 ( ) p (see Homework, Q10). Hence p r. But since 1 r < p, p does not divide r, so by r ( ) p Euclid s property of a prime (Theorem 6.5), p. r Remark. In your homework you were asked to show that n 5 n is divisibe by 5 for all n 1. The hint was to use induction and the Binomial Theorem on (k + 1) 5 which gives ( ) (k + 1) 5 = k 5 + 5k k k 2 + 5k + 1 k + 1 mod 5. The next Theorem generalises this Proposition. Freshman s Dream For all a, b Z and all primes p we have (a + b) p a p + b p mod p. p 1 ( ) p Proof By the Binomial Theorem, (a+b) p (a p +b p ) = a p r b r. By Lemma 6.11, r r=1 p divides every term on the right, hence p divides the whole sum, hence p (a + b) p (a p + b p ) as required. Now, just as ( ) can be used to prove n 5 n mod 5 for all n 1, Freshman s Dream can be used to prove the following general result Theorem. Fermat s Little Theorem (variant of PJE theorem ) For all n Z, and all primes p, n p n mod p. If gcd (p, n) = 1 then n p 1 1 mod p.

6 Prime Numbers 56 Proof. We fix a prime p. We first prove that n p n mod p for non-negative n by induction in n. Base case: n = 0, 0 p 0 trivially. Inductive step: assume that k p k mod p. We need to prove (k + 1) p k + 1. Indeed, by Freshman s Dream, (k + 1) p k p + 1 mod p, which by inductive hypothesis is k + 1 mod p as required. So by induction n p n mod p for all n 0. Observe now that the result holds for all n Z: indeed, we proved that the congruence n p n mod p holds for n = 0, 1, 2,..., p 1 hence, by Modular Arithmetic, it holds for every n congruent, modulo p, to one of the numbers 0, 1, 2,..., p 1; but every integer is congruent, modulo p, to one of these residues. Now, to prove the second part of the theorem, write it as n n p 1 n 1 and assume that n is coprime to p. Then by Proposition 3.5 we can cancel n on both sides of the congruence to obtain n p 1 1 mod p Application: finding and using inverses. Fermat s Little Theorem has numerous applications, including simplifying the calculation of powers in modular arithmetic. From the theorem we see that if p is prime and p a then a p 1 1 mod p, or equivalently a p 2 a 1 mod p. This means that a p 2 is the inverse of a modulo p or, in the language of congruence classes, [a] 1 p = [ a p 2] p in Z p. Aside An interesting question is with which method is it quickest to calculate the modular inverse an integer modulo a prime. Is it by Euclid s Algorithm or by calculating a p 2 using, for example, the method of successive squaring? In fact, both methods have running time proportional to the number of decimal digits of a. For Euclid s algorithm this result on the running time is the content of Lame s Theorem, PJE p.226. End of aside We have seen before that a use of inverses is to solve linear congruences Example. Invert 5 mod 19. Hence solve the congruence 5x 6 mod 19. Solution 19 is prime so Fermat s Little theorem implies mod 19. So mod 19, i.e is the inverse of 5 mod 19. Thus multiplying both sides of the equation by 5 17 gives 5 18 x mod 19, i.e. x mod 19. Though this is an answer to the question we normally give x as the least positive residue. Successive squaring gives 5 2 6, , and mod 19.

7 Prime Numbers 57 Thus x mod 19, which should still be checked by substitution Application: Calculating powers. With p = 13 and a = 4 we see that mod 13. Thus = ( 4 12) 8 ( 4 2 ) ( 3) 2 9 mod 13, as we have seen before in Chapter 3, using the method of successive squaring. Aside Fermat s Little Theorem may appear wonderful in that it helps us solve congruences and simplifies substantially the calculation of large powers modulo p. But the result has one weakness, you need to know that the modulus is prime. It should be stressed that it is a difficult problem showing that a large number is prime (primality testing). End of aside Application: Fermat pseudoprimes. Testing whether n is a prime using Sieve of Eratosthenes may cost up to n operations. This is prohibitively expensive for large n. A approach is known as Fermat pseudoprime test, but unfortunately it is randomised and may give a false prime with non-zero probability: Pick a random integer a between 2 and n; Use Euclid s algorithm to find d = gcd(a, n). If d > 1, n is composite (divisible by d) and we are done; otherwise, calculate a n 1 mod n using successive squaring; if a n 1 1 mod n, then by Fermat s Little Theorem n is not prime. Unfortunately, if we discover that a n 1 1 mod n, we will not know if n is prime or composite. Indeed, a n 1 1 mod n holds for all prime n but holds also for some composite n and some a coprime to n. The number of steps in Euclid s Algorithm and successive squaring is only of order log n which is much smaller than n. But it can happen that, even after picking several a, no contradiction is found, but n is still composite. See your homework for an example.

8 Prime Numbers 58 Euler s phi-function and Euler s Theorem Recall from the previous chapter that Z n is the set of invertible classes in Z n and that it can be written as {[r] n : 0 r n 1, gcd (r, n) = 1} Definition. Euler s phi-function is, for all n 1, given by φ (n) = Z n = {0 r n 1 : gcd (r, n) = 1}. Examples Simply by checking we see that φ (5) = 4 and φ (7) = 6. In general φ (p) = p 1 for all primes p since all positive integers strictly less than p are coprime to p. Also by checking, we find that φ (8) = 4 and φ (16) = 8. In general φ (2 n ) = 2 n 1 for all n 1, since in these cases we are counting the integers coprime to 2 n, i.e. the odd integers. And half of the integers up to 2 n are odd. And you can easily check by hand that φ (6) = 2, φ (9) = 6 and φ (10) = Proposition. a) Multiplicativity of φ: If gcd(m, n) = 1 then φ(mn) = φ(m)φ(n). b) If p is prime then for all r 1 φ (p r ) = p r 1 (p 1). Proof Warning: although the result is designated here as a proposition, the proof of a) is one of the most difficult proofs in the course. Idea of proof of part a): the set of integers a such that 0 a m 1 and a is coprime to m has cardinality φ(m), see the definition of φ(m). Likewise, there are φ(n) integers b coprime to n such that 0 b n 1. Hence there are φ(m)φ(n) pairs (a, b) where a and b satisfy the given constraints. We show that such pairs (a, b) are in bijection with the set of integers x such that 0 x mn 1 and x is coprime to mn. Since the latter set has φ(mn) elements, the existence of a bijection implies that φ(m)φ(n) = φ(mn). Most of the proof below is a formal argument showing that there is indeed a bijection. Crucially, we use the Chinese Remainder Theorem which assumes that m and n are coprime. End of idea.

9 Prime Numbers 59 Proof of a). In this proof, we will use the following sets of non-negative integers: M = {0, 1,..., m 1}, N = {0, 1,..., n 1}, MN = {0, 1,..., mn 1}. Assume that gcd(m, n) = 1. Then by Chinese Remainder Theorem 3.18, for each a M and b N there exists a unique integer in MN denote it x 0 (a, b) such that x 0 (a, b) a mod m and x 0 (a, b) b mod n. Hence we have a function x 0 : M N MN, (a, b) x 0 (a, b). The function x 0 is surjective: indeed, take x MN and let c the remainder of x modulo m (so that c M) and d be the remainder of x modulo n (so that d N). Then x c mod m and x d mod n, and x MN, which means that x = x 0 (c, d). Surjectivity of the function x 0 is proved. The set M N has cardinality m n, and the set MN has cardinality mn. A surjective function between two finite sets of the same cardinality is bijective. Hence the function x 0 is bijective. We will now restrict both the domain and the codomain of the function x 0 to obtain a bijective function between two non-trivial sets. The domain of the function x 0 is restricted to the set of pairs (a, b) M N such that a is coprime to m and b is coprime to n. The codomain of the function x 0 is restricted to the set of integers x MN such that x is coprime to mn. Of course we need to check that the function x 0 maps the new domain to the new codomain; that is, assuming that (a, b) M N is such that a is coprime to m and b is coprime to n, we need to show that x 0 (a, b) is coprime to mn. Indeed, since x 0 (a, b) a mod m and a is invertible mod m, we conclude that x 0 (a, b) is invertible mod m, i.e., is coprime to m. The same argument for b and n instead of a and m shows that x 0 (a, b) is coprime to n. Finally, if x 0 (a, b) is coprime to both m and n, then by homework question Q15, x 0 (a, b) is coprime to mn. Hence the resriction of x 0 is indeed a function (*) x 0 : {a : 0 a m 1, gcd(a, m) = 1} {b : 0 b n 1, gcd(b, n) = 1} {x : 0 x mn 1, gcd(x, mn) = 1}. Now, since the function x 0 is injective, its restriction (*) is injective. We claim that (*) is also surjective. To verify this claim, we assume that x = x 0 (a, b) is coprime to mn. We need to show that a is coprime to m and b is coprime to n. Indeed, if x is coprime to mn, then x is

10 Prime Numbers 60 coprime to m: any common divisor of x and m is also a common divisor of x and mn, the largest of which is 1. Hence x is invertible mod m, and since x = x 0 (a, b) a mod m, it follows that a is also invertible mod m, meanign that a is coprime to m. In the same way b is coprime to n. Thus, the function given by (*) is both injective and surjective, hence bijective. If a bijection exists between two sets, then the two sets have the same cardinality. It remains to observe that {a : 0 a m 1, gcd(a, m) = 1} {b : 0 b n 1, gcd(b, n) = 1} and = φ(m) φ(n) {x : 0 x mn 1, gcd(x, mn) = 1} = φ(mn). The two cardinalities are equal, so φ(m)φ(n) = φ(mn). b) See the homework questions for Week 12. Example. φ (100) = 40. Indeed, using Proposition 6.19, 100 = , 2 2 is coprime to 5 2 hence φ(100) = φ(2 2 )φ(5 2 ), φ(2 2 ) = = 2, φ(5 2 ) = = 20. The following is a generalization of Fermat s Little Theorem to composite moduli Theorem. Euler s Theorem If gcd (a, n) = 1 then a φ(n) 1 mod n. Proof is not in PJE s book, but the idea is to be found on p.290. Let us list the elements of Z n (i.e., invertible congruence classes mod n) as (List1) C 1, C 2,..., C φ(n) in some order. (Recall that Z n contains exactly φ(n) elements.) By Theorem 4.17, the product of elements of Z n is again an element of Z n, hence if X = C 1 C 2... C φ(n), then X Z n. By assumption, a is coprime to n, hence the residue class [a] n of a mod n belongs to the set Z n and is listed above as C i for some index i. Consider the following elements of Z n: (List2) C i C 1, C i C 2,..., C i C φ(n). This list is obtained by multiplying each entry of (List1) by C i.

11 Prime Numbers 61 We claim that all the entries in (List2) are distinct. Indeed, taking (List2) and multiplying all entries by Ci 1 gives (List1) which has φ(n) distinct entries. Hence (List2) also has φ(n) distinct entries, which means that the entries of (List2) are still all the elements of Z n, but possibly written in a different order. In particular, since multiplication on Z n is commutative (i.e., the product does not depend on the order in which the factors are written) the product of all the entries of (List2) is again X: X = (C i C 1 )(C i C 2 )... (C i C φ(n) ). Again using commutativity of multiplication, we rewrite this as X = C φ(n) i C 1 C 2... C φ(n). But this equation reads X = C φ(n) i X, which implies (multiplying through by X 1 ) that = [1] n. Recall that C i was the congruence class of a mod n, so that C φ(n) i [a φ(n) ] n = [1] n which merely means a φ(n) 1 mod n, as required Remark. Taking n = p, prime, in the Theorem we recover Fermat s Little Theorem. Indeed, φ(p) = p Example. Given φ (100) = 40 from above, find the last two digits in the decimal expansion of Solution We have to calculate mod 100 which is congruent to mod 100. Euler s Theorem tells us that 13 φ(100) = mod 100. Thus Now use successive squaring Hence = ( 13 40) mod , , , mod = mod 100. So the last two digits of are 77, as already found earlier.

12 Prime Numbers 62 Aside you may now think that Euler s Theorem has none of the problems of Fermat s Little Theorem as we do not need to know that the modulus m is prime; Euler s Theorem holds for all integers m. But unfortunately it has another problem, how to calculate φ (m)? In general this is very difficult for large m. Together, φ (st) = φ (s) φ (t) if gcd (s, t) = 1 and φ (p r ) = p r 1 (p 1) if p is prime, allow you to calculate φ (m) for any m provided you can factor m. Unfortunately, this is a very difficult problem for large m. Applications of Euler s and Fermat s Theorem. Not given in lectures Example. Find a solution to x 12 3 mod 11. Solution Any solution of this must satisfy gcd (x, 11) = 1 so Fermat s Little Theorem gives x 10 1 mod 11. Thus our equation becomes 3 x 12 x 2 x 10 x 2 mod 11. Now check. x x 2 mod Note that if x 6 then 11 x 5 and x 2 (11 x) 2 mod 11 so all possible values of x 2 mod 11 will be seen in the table. From the table we see an answer is x 5 mod Example. Show that x 5 3 mod 11 has no solutions. Solution by contradiction. Assume x 5 3 mod 11 has solutions. Any solution of this must satisfy gcd (x, 11) = 1 so Fermat s Little Theorem gives x 10 1 mod 11. Since 5 10 we square both sides of the original congruence to get 1 x 10 ( x 5) mod 11. This is false and so the assumption is false and thus the congruence has no solution.

13 Prime Numbers Example. Find a solution to x 7 3 mod 11. Solution Again x 10 1 mod 11 by Fermat s Little Theorem but this time 7 10, in fact gcd (7, 10) = 1. From Euclid s Algorithm we get (3) = 1. Raise both sides of the original congruence to the third power to get 3 3 ( x 7) 3 x 3 7 x by (3), x ( x 10) 2 x mod 11. Hence a solution is x mod 11. Don t forget to check your answer (by successive squaring of 5). iv) Is divisible by 11? Here we look at mod 11. Because 11 is prime we could use Fermat s Little Theorem to say mod 11. Thus = 33 0 mod 11, i.e is divisible by 11. Question for students. Show that is divisible by 65. Interesting problems concerning primes Not given in lectures. The following are conjectures and are all examples of problems that can be simply stated yet for which the answers are as yet unknown. 1) Goldbach s Conjecture, Is every even integer n 4 the sum of two primes? 4 = 2 + 2, 6 = 3 + 3, 8 = 3 + 5, 10 = 3 + 7, 12 = 5 + 7, 14 = , 16 = , 18 = , 20 = ,... Has been checked for all even numbers up to by Tomás Oliveira e Silva (as of 2017). Goldbach s Conjecture is a difficult problem because primes are multiplicative objects, defined in terms of divisibility, and yet this is an additive question. 2) Do there exist infinitely many Twin Primes, i.e. pairs of primes p and p such that p p = 2? The first few examples are (3, 5), (5, 7), (11, 13), (17, 19), (29, 31), (41, 43), (59, 61), (71, 73), (101, 103), (107, 109), (137, 139), (149, 151), (179, 181), (191, 193), (197, 199), (227, 229), (239, 241),....

14 Prime Numbers 64 A large prime pair is ± 1, with 388,342 decimal digits. It was discovered in September It has recently been proved (2014) that there are infinitely many pairs of primes p < p (not necessarily consecutive) with p p < ) Is n prime infinitely often? = 5, = 17, = 37, = 101, = 197,... It has been shown that n is either a prime or the product of two primes infinitely often. 4) For all m 1 does there exists a prime p : m 2 p (m + 1) 2? What is known is Theorem Bertrand s postulate: For all N 1 there exists a prime p : N p 2N. Proof. not given in course Definition. The Prime Counting Function If N Z, we define π(n) = {p Z : p N, p is prime}.

### An integer p is prime if p > 1 and p has exactly two positive divisors, 1 and p.

Chapter 6 Prime Numbers Part VI of PJE. Definition and Fundamental Results Definition. (PJE definition 23.1.1) An integer p is prime if p > 1 and p has exactly two positive divisors, 1 and p. If n > 1

### Definition 6.1 (p.277) A positive integer n is prime when n > 1 and the only positive divisors are 1 and n. Alternatively

6 Prime Numbers Part VI of PJE 6.1 Fundamental Results Definition 6.1 (p.277) A positive integer n is prime when n > 1 and the only positive divisors are 1 and n. Alternatively D (p) = { p 1 1 p}. Otherwise

### 7. Prime Numbers Part VI of PJE

7. Prime Numbers Part VI of PJE 7.1 Definition (p.277) A positive integer n is prime when n > 1 and the only divisors are ±1 and +n. That is D (n) = { n 1 1 n}. Otherwise n > 1 is said to be composite.

### 7.2 Applications of Euler s and Fermat s Theorem.

7.2 Applications of Euler s and Fermat s Theorem. i) Finding and using inverses. From Fermat s Little Theorem we see that if p is prime and p a then a p 1 1 mod p, or equivalently a p 2 a 1 mod p. This

### CHAPTER 3. Congruences. Congruence: definitions and properties

CHAPTER 3 Congruences Part V of PJE Congruence: definitions and properties Definition. (PJE definition 19.1.1) Let m > 0 be an integer. Integers a and b are congruent modulo m if m divides a b. We write

### Lecture notes: Algorithms for integers, polynomials (Thorsten Theobald)

Lecture notes: Algorithms for integers, polynomials (Thorsten Theobald) 1 Euclid s Algorithm Euclid s Algorithm for computing the greatest common divisor belongs to the oldest known computing procedures

### Lecture 4: Number theory

Lecture 4: Number theory Rajat Mittal IIT Kanpur In the next few classes we will talk about the basics of number theory. Number theory studies the properties of natural numbers and is considered one of

### A SURVEY OF PRIMALITY TESTS

A SURVEY OF PRIMALITY TESTS STEFAN LANCE Abstract. In this paper, we show how modular arithmetic and Euler s totient function are applied to elementary number theory. In particular, we use only arithmetic

### The Chinese Remainder Theorem

Chapter 5 The Chinese Remainder Theorem 5.1 Coprime moduli Theorem 5.1. Suppose m, n N, and gcd(m, n) = 1. Given any remainders r mod m and s mod n we can find N such that N r mod m and N s mod n. Moreover,

### 1 Overview and revision

MTH6128 Number Theory Notes 1 Spring 2018 1 Overview and revision In this section we will meet some of the concerns of Number Theory, and have a brief revision of some of the relevant material from Introduction

### LECTURE 4: CHINESE REMAINDER THEOREM AND MULTIPLICATIVE FUNCTIONS

LECTURE 4: CHINESE REMAINDER THEOREM AND MULTIPLICATIVE FUNCTIONS 1. The Chinese Remainder Theorem We now seek to analyse the solubility of congruences by reinterpreting their solutions modulo a composite

### Math 324, Fall 2011 Assignment 7 Solutions. 1 (ab) γ = a γ b γ mod n.

Math 324, Fall 2011 Assignment 7 Solutions Exercise 1. (a) Suppose a and b are both relatively prime to the positive integer n. If gcd(ord n a, ord n b) = 1, show ord n (ab) = ord n a ord n b. (b) Let

### All variables a, b, n, etc are integers unless otherwise stated. Each part of a problem is worth 5 points.

Math 152, Problem Set 2 solutions (2018-01-24) All variables a, b, n, etc are integers unless otherwise stated. Each part of a problem is worth 5 points. 1. Let us look at the following equation: x 5 1

### MATH 2200 Final Review

MATH 00 Final Review Thomas Goller December 7, 01 1 Exam Format The final exam will consist of 8-10 proofs It will take place on Tuesday, December 11, from 10:30 AM - 1:30 PM, in the usual room Topics

### 2.3 In modular arithmetic, all arithmetic operations are performed modulo some integer.

CHAPTER 2 INTRODUCTION TO NUMBER THEORY ANSWERS TO QUESTIONS 2.1 A nonzero b is a divisor of a if a = mb for some m, where a, b, and m are integers. That is, b is a divisor of a if there is no remainder

### A Guide to Arithmetic

A Guide to Arithmetic Robin Chapman August 5, 1994 These notes give a very brief resumé of my number theory course. Proofs and examples are omitted. Any suggestions for improvements will be gratefully

### Chapter 5. Modular arithmetic. 5.1 The modular ring

Chapter 5 Modular arithmetic 5.1 The modular ring Definition 5.1. Suppose n N and x, y Z. Then we say that x, y are equivalent modulo n, and we write x y mod n if n x y. It is evident that equivalence

### a = mq + r where 0 r m 1.

8. Euler ϕ-function We have already seen that Z m, the set of equivalence classes of the integers modulo m, is naturally a ring. Now we will start to derive some interesting consequences in number theory.

### SOLUTIONS Math 345 Homework 6 10/11/2017. Exercise 23. (a) Solve the following congruences: (i) x (mod 12) Answer. We have

Exercise 23. (a) Solve the following congruences: (i) x 101 7 (mod 12) Answer. We have φ(12) = #{1, 5, 7, 11}. Since gcd(7, 12) = 1, we must have gcd(x, 12) = 1. So 1 12 x φ(12) = x 4. Therefore 7 12 x

### 2 Arithmetic. 2.1 Greatest common divisors. This chapter is about properties of the integers Z = {..., 2, 1, 0, 1, 2,...}.

2 Arithmetic This chapter is about properties of the integers Z = {..., 2, 1, 0, 1, 2,...}. (See [Houston, Chapters 27 & 28]) 2.1 Greatest common divisors Definition 2.16. If a, b are integers, we say

### Number Theory Proof Portfolio

Number Theory Proof Portfolio Jordan Rock May 12, 2015 This portfolio is a collection of Number Theory proofs and problems done by Jordan Rock in the Spring of 2014. The problems are organized first by

### Know the Well-ordering principle: Any set of positive integers which has at least one element contains a smallest element.

The first exam will be on Monday, June 8, 202. The syllabus will be sections. and.2 in Lax, and the number theory handout found on the class web site, plus the handout on the method of successive squaring

### NUMBER SYSTEMS. Number theory is the study of the integers. We denote the set of integers by Z:

NUMBER SYSTEMS Number theory is the study of the integers. We denote the set of integers by Z: Z = {..., 3, 2, 1, 0, 1, 2, 3,... }. The integers have two operations defined on them, addition and multiplication,

### 1. multiplication is commutative and associative;

Chapter 4 The Arithmetic of Z In this chapter, we start by introducing the concept of congruences; these are used in our proof (going back to Gauss 1 ) that every integer has a unique prime factorization.

### M381 Number Theory 2004 Page 1

M81 Number Theory 2004 Page 1 [[ Comments are written like this. Please send me (dave@wildd.freeserve.co.uk) details of any errors you find or suggestions for improvements. ]] Question 1 20 = 2 * 10 +

### CS 5319 Advanced Discrete Structure. Lecture 9: Introduction to Number Theory II

CS 5319 Advanced Discrete Structure Lecture 9: Introduction to Number Theory II Divisibility Outline Greatest Common Divisor Fundamental Theorem of Arithmetic Modular Arithmetic Euler Phi Function RSA

### Basic elements of number theory

Cryptography Basic elements of number theory Marius Zimand 1 Divisibility, prime numbers By default all the variables, such as a, b, k, etc., denote integer numbers. Divisibility a 0 divides b if b = a

### Basic elements of number theory

Cryptography Basic elements of number theory Marius Zimand By default all the variables, such as a, b, k, etc., denote integer numbers. Divisibility a 0 divides b if b = a k for some integer k. Notation

### PRIME NUMBERS YANKI LEKILI

PRIME NUMBERS YANKI LEKILI We denote by N the set of natural numbers: 1,2,..., These are constructed using Peano axioms. We will not get into the philosophical questions related to this and simply assume

### MATH 361: NUMBER THEORY FOURTH LECTURE

MATH 361: NUMBER THEORY FOURTH LECTURE 1. Introduction Everybody knows that three hours after 10:00, the time is 1:00. That is, everybody is familiar with modular arithmetic, the usual arithmetic of the

### MATH 310: Homework 7

1 MATH 310: Homework 7 Due Thursday, 12/1 in class Reading: Davenport III.1, III.2, III.3, III.4, III.5 1. Show that x is a root of unity modulo m if and only if (x, m 1. (Hint: Use Euler s theorem and

### Euler s, Fermat s and Wilson s Theorems

Euler s, Fermat s and Wilson s Theorems R. C. Daileda February 17, 2018 1 Euler s Theorem Consider the following example. Example 1. Find the remainder when 3 103 is divided by 14. We begin by computing

### Part IA Numbers and Sets

Part IA Numbers and Sets Theorems Based on lectures by A. G. Thomason Notes taken by Dexter Chua Michaelmas 2014 These notes are not endorsed by the lecturers, and I have modified them (often significantly)

### Homework 3, solutions

Homework 3, solutions Problem 1. Read the proof of Proposition 1.22 (page 32) in the book. Using simialr method prove that there are infinitely many prime numbers of the form 3n 2. Solution. Note that

### 4 PRIMITIVE ROOTS Order and Primitive Roots The Index Existence of primitive roots for prime modulus...

PREFACE These notes have been prepared by Dr Mike Canfell (with minor changes and extensions by Dr Gerd Schmalz) for use by the external students in the unit PMTH 338 Number Theory. This booklet covers

### Chapter 9 Mathematics of Cryptography Part III: Primes and Related Congruence Equations

Chapter 9 Mathematics of Cryptography Part III: Primes and Related Congruence Equations Copyright The McGraw-Hill Companies, Inc. Permission required for reproduction or display. 9.1 Chapter 9 Objectives

### CPSC 467b: Cryptography and Computer Security

CPSC 467b: Cryptography and Computer Security Michael J. Fischer Lecture 8 February 1, 2012 CPSC 467b, Lecture 8 1/42 Number Theory Needed for RSA Z n : The integers mod n Modular arithmetic GCD Relatively

### 10 Problem 1. The following assertions may be true or false, depending on the choice of the integers a, b 0. a "

Math 4161 Dr. Franz Rothe December 9, 2013 13FALL\4161_fall13f.tex Name: Use the back pages for extra space Final 70 70 Problem 1. The following assertions may be true or false, depending on the choice

### ALGEBRA. 1. Some elementary number theory 1.1. Primes and divisibility. We denote the collection of integers

ALGEBRA CHRISTIAN REMLING 1. Some elementary number theory 1.1. Primes and divisibility. We denote the collection of integers by Z = {..., 2, 1, 0, 1,...}. Given a, b Z, we write a b if b = ac for some

### Fermat s Little Theorem. Fermat s little theorem is a statement about primes that nearly characterizes them.

Fermat s Little Theorem Fermat s little theorem is a statement about primes that nearly characterizes them. Theorem: Let p be prime and a be an integer that is not a multiple of p. Then a p 1 1 (mod p).

### Lecture 5: Arithmetic Modulo m, Primes and Greatest Common Divisors Lecturer: Lale Özkahya

BBM 205 Discrete Mathematics Hacettepe University http://web.cs.hacettepe.edu.tr/ bbm205 Lecture 5: Arithmetic Modulo m, Primes and Greatest Common Divisors Lecturer: Lale Özkahya Resources: Kenneth Rosen,

### A Few Primality Testing Algorithms

A Few Primality Testing Algorithms Donald Brower April 2, 2006 0.1 Introduction These notes will cover a few primality testing algorithms. There are many such, some prove that a number is prime, others

### Part II. Number Theory. Year

Part II Year 2017 2016 2015 2014 2013 2012 2011 2010 2009 2008 2007 2006 2005 2017 Paper 3, Section I 1G 70 Explain what is meant by an Euler pseudoprime and a strong pseudoprime. Show that 65 is an Euler

### MATH FINAL EXAM REVIEW HINTS

MATH 109 - FINAL EXAM REVIEW HINTS Answer: Answer: 1. Cardinality (1) Let a < b be two real numbers and define f : (0, 1) (a, b) by f(t) = (1 t)a + tb. (a) Prove that f is a bijection. (b) Prove that any

### SOLUTIONS TO PROBLEM SET 1. Section = 2 3, 1. n n + 1. k(k + 1) k=1 k(k + 1) + 1 (n + 1)(n + 2) n + 2,

SOLUTIONS TO PROBLEM SET 1 Section 1.3 Exercise 4. We see that 1 1 2 = 1 2, 1 1 2 + 1 2 3 = 2 3, 1 1 2 + 1 2 3 + 1 3 4 = 3 4, and is reasonable to conjecture n k=1 We will prove this formula by induction.

### CPSC 467: Cryptography and Computer Security

CPSC 467: Cryptography and Computer Security Michael J. Fischer Lecture 9 September 30, 2015 CPSC 467, Lecture 9 1/47 Fast Exponentiation Algorithms Number Theory Needed for RSA Elementary Number Theory

### 5: The Integers (An introduction to Number Theory)

c Oksana Shatalov, Spring 2017 1 5: The Integers (An introduction to Number Theory) The Well Ordering Principle: Every nonempty subset on Z + has a smallest element; that is, if S is a nonempty subset

### Part IA Numbers and Sets

Part IA Numbers and Sets Definitions Based on lectures by A. G. Thomason Notes taken by Dexter Chua Michaelmas 2014 These notes are not endorsed by the lecturers, and I have modified them (often significantly)

### EULER S THEOREM KEITH CONRAD

EULER S THEOREM KEITH CONRAD. Introduction Fermat s little theorem is an important property of integers to a prime modulus. Theorem. (Fermat). For prime p and any a Z such that a 0 mod p, a p mod p. If

### PREPARATION NOTES FOR NUMBER THEORY PRACTICE WED. OCT. 3,2012

PREPARATION NOTES FOR NUMBER THEORY PRACTICE WED. OCT. 3,2012 0.1. Basic Num. Th. Techniques/Theorems/Terms. Modular arithmetic, Chinese Remainder Theorem, Little Fermat, Euler, Wilson, totient, Euclidean

### Beautiful Mathematics

Beautiful Mathematics 1. Principle of Mathematical Induction The set of natural numbers is the set of positive integers {1, 2, 3,... } and is denoted by N. The Principle of Mathematical Induction is a

### Corollary 4.2 (Pepin s Test, 1877). Let F k = 2 2k + 1, the kth Fermat number, where k 1. Then F k is prime iff 3 F k 1

4. Primality testing 4.1. Introduction. Factorisation is concerned with the problem of developing efficient algorithms to express a given positive integer n > 1 as a product of powers of distinct primes.

### 2x 1 7. A linear congruence in modular arithmetic is an equation of the form. Why is the solution a set of integers rather than a unique integer?

Chapter 3: Theory of Modular Arithmetic 25 SECTION C Solving Linear Congruences By the end of this section you will be able to solve congruence equations determine the number of solutions find the multiplicative

### Q 2.0.2: If it s 5:30pm now, what time will it be in 4753 hours? Q 2.0.3: Today is Wednesday. What day of the week will it be in one year from today?

2 Mod math Modular arithmetic is the math you do when you talk about time on a clock. For example, if it s 9 o clock right now, then it ll be 1 o clock in 4 hours. Clearly, 9 + 4 1 in general. But on a

### 8 Primes and Modular Arithmetic

8 Primes and Modular Arithmetic 8.1 Primes and Factors Over two millennia ago already, people all over the world were considering the properties of numbers. One of the simplest concepts is prime numbers.

### Number Theory Homework.

Number Theory Homewor. 1. The Theorems of Fermat, Euler, and Wilson. 1.1. Fermat s Theorem. The following is a special case of a result we have seen earlier, but as it will come up several times in this

### Introduction to Number Theory

INTRODUCTION Definition: Natural Numbers, Integers Natural numbers: N={0,1,, }. Integers: Z={0,±1,±, }. Definition: Divisor If a Z can be writeen as a=bc where b, c Z, then we say a is divisible by b or,

### Lecture Notes. Advanced Discrete Structures COT S

Lecture Notes Advanced Discrete Structures COT 4115.001 S15 2015-01-13 Recap Divisibility Prime Number Theorem Euclid s Lemma Fundamental Theorem of Arithmetic Euclidean Algorithm Basic Notions - Section

### Instructor: Bobby Kleinberg Lecture Notes, 25 April The Miller-Rabin Randomized Primality Test

Introduction to Algorithms (CS 482) Cornell University Instructor: Bobby Kleinberg Lecture Notes, 25 April 2008 The Miller-Rabin Randomized Primality Test 1 Introduction Primality testing is an important

### Summary Slides for MATH 342 June 25, 2018

Summary Slides for MATH 342 June 25, 2018 Summary slides based on Elementary Number Theory and its applications by Kenneth Rosen and The Theory of Numbers by Ivan Niven, Herbert Zuckerman, and Hugh Montgomery.

### Introduction to Public-Key Cryptosystems:

Introduction to Public-Key Cryptosystems: Technical Underpinnings: RSA and Primality Testing Modes of Encryption for RSA Digital Signatures for RSA 1 RSA Block Encryption / Decryption and Signing Each

### Discrete Mathematics with Applications MATH236

Discrete Mathematics with Applications MATH236 Dr. Hung P. Tong-Viet School of Mathematics, Statistics and Computer Science University of KwaZulu-Natal Pietermaritzburg Campus Semester 1, 2013 Tong-Viet

### p = This is small enough that its primality is easily verified by trial division. A candidate prime above 1000 p of the form p U + 1 is

LARGE PRIME NUMBERS 1. Fermat Pseudoprimes Fermat s Little Theorem states that for any positive integer n, if n is prime then b n % n = b for b = 1,..., n 1. In the other direction, all we can say is that

### * 8 Groups, with Appendix containing Rings and Fields.

* 8 Groups, with Appendix containing Rings and Fields Binary Operations Definition We say that is a binary operation on a set S if, and only if, a, b, a b S Implicit in this definition is the idea that

### MATH 433 Applied Algebra Lecture 4: Modular arithmetic (continued). Linear congruences.

MATH 433 Applied Algebra Lecture 4: Modular arithmetic (continued). Linear congruences. Congruences Let n be a postive integer. The integers a and b are called congruent modulo n if they have the same

### 2 More on Congruences

2 More on Congruences 2.1 Fermat s Theorem and Euler s Theorem definition 2.1 Let m be a positive integer. A set S = {x 0,x 1,,x m 1 x i Z} is called a complete residue system if x i x j (mod m) whenever

### Discrete Mathematics and Probability Theory Summer 2014 James Cook Note 5

CS 70 Discrete Mathematics and Probability Theory Summer 2014 James Cook Note 5 Modular Arithmetic In several settings, such as error-correcting codes and cryptography, we sometimes wish to work over a

### Discrete Mathematics and Probability Theory Fall 2018 Alistair Sinclair and Yun Song Note 6

CS 70 Discrete Mathematics and Probability Theory Fall 2018 Alistair Sinclair and Yun Song Note 6 1 Modular Arithmetic In several settings, such as error-correcting codes and cryptography, we sometimes

### Chapter 5. Number Theory. 5.1 Base b representations

Chapter 5 Number Theory The material in this chapter offers a small glimpse of why a lot of facts that you ve probably nown and used for a long time are true. It also offers some exposure to generalization,

### The Chinese Remainder Theorem

The Chinese Remainder Theorem R. C. Daileda February 19, 2018 1 The Chinese Remainder Theorem We begin with an example. Example 1. Consider the system of simultaneous congruences x 3 (mod 5), x 2 (mod

### Exercises Exercises. 2. Determine whether each of these integers is prime. a) 21. b) 29. c) 71. d) 97. e) 111. f) 143. a) 19. b) 27. c) 93.

Exercises Exercises 1. Determine whether each of these integers is prime. a) 21 b) 29 c) 71 d) 97 e) 111 f) 143 2. Determine whether each of these integers is prime. a) 19 b) 27 c) 93 d) 101 e) 107 f)

### Elementary Number Theory Review. Franz Luef

Elementary Number Theory Review Principle of Induction Principle of Induction Suppose we have a sequence of mathematical statements P(1), P(2),... such that (a) P(1) is true. (b) If P(k) is true, then

### Math 109 HW 9 Solutions

Math 109 HW 9 Solutions Problems IV 18. Solve the linear diophantine equation 6m + 10n + 15p = 1 Solution: Let y = 10n + 15p. Since (10, 15) is 5, we must have that y = 5x for some integer x, and (as we

### Chapter 1 : The language of mathematics.

MAT 200, Logic, Language and Proof, Fall 2015 Summary Chapter 1 : The language of mathematics. Definition. A proposition is a sentence which is either true or false. Truth table for the connective or :

### Ma/CS 6a Class 2: Congruences

Ma/CS 6a Class 2: Congruences 1 + 1 5 (mod 3) By Adam Sheffer Reminder: Public Key Cryptography Idea. Use a public key which is used for encryption and a private key used for decryption. Alice encrypts

### Number Theory and Algebra: A Brief Introduction

Number Theory and Algebra: A Brief Introduction Indian Statistical Institute Kolkata May 15, 2017 Elementary Number Theory: Modular Arithmetic Definition Let n be a positive integer and a and b two integers.

### Winter Camp 2009 Number Theory Tips and Tricks

Winter Camp 2009 Number Theory Tips and Tricks David Arthur darthur@gmail.com 1 Introduction This handout is about some of the key techniques for solving number theory problems, especially Diophantine

### NOTES ON SIMPLE NUMBER THEORY

NOTES ON SIMPLE NUMBER THEORY DAMIEN PITMAN 1. Definitions & Theorems Definition: We say d divides m iff d is positive integer and m is an integer and there is an integer q such that m = dq. In this case,

### MATH 4400 SOLUTIONS TO SOME EXERCISES. 1. Chapter 1

MATH 4400 SOLUTIONS TO SOME EXERCISES 1.1.3. If a b and b c show that a c. 1. Chapter 1 Solution: a b means that b = na and b c that c = mb. Substituting b = na gives c = (mn)a, that is, a c. 1.2.1. Find

### Chapter 5: The Integers

c Dr Oksana Shatalov, Fall 2014 1 Chapter 5: The Integers 5.1: Axioms and Basic Properties Operations on the set of integers, Z: addition and multiplication with the following properties: A1. Addition

### Algorithmic number theory. Questions/Complaints About Homework? The division algorithm. Division

Questions/Complaints About Homework? Here s the procedure for homework questions/complaints: 1. Read the solutions first. 2. Talk to the person who graded it (check initials) 3. If (1) and (2) don t work,

### Math Circle Beginners Group February 28, 2016 Euclid and Prime Numbers Solutions

Math Circle Beginners Group February 28, 2016 Euclid and Prime Numbers Solutions Warm-up Problems 1. What is a prime number? Give an example of an even prime number and an odd prime number. A prime number

### LARGE PRIME NUMBERS (32, 42; 4) (32, 24; 2) (32, 20; 1) ( 105, 20; 0).

LARGE PRIME NUMBERS 1. Fast Modular Exponentiation Given positive integers a, e, and n, the following algorithm quickly computes the reduced power a e % n. (Here x % n denotes the element of {0,, n 1}

### Course MA2C02, Hilary Term 2013 Section 9: Introduction to Number Theory and Cryptography

Course MA2C02, Hilary Term 2013 Section 9: Introduction to Number Theory and Cryptography David R. Wilkins Copyright c David R. Wilkins 2000 2013 Contents 9 Introduction to Number Theory 63 9.1 Subgroups

### MATH 2112/CSCI 2112, Discrete Structures I Winter 2007 Toby Kenney Homework Sheet 5 Hints & Model Solutions

MATH 11/CSCI 11, Discrete Structures I Winter 007 Toby Kenney Homework Sheet 5 Hints & Model Solutions Sheet 4 5 Define the repeat of a positive integer as the number obtained by writing it twice in a

### Number Theory Alex X. Liu & Haipeng Dai

Number Theory Alex X. Liu & Haipeng Dai haipengdai@nju.edu.cn 313 CS Building Department of Computer Science and Technology Nanjing University How to compute gcd(x,y) Observation: gcd(x,y) = gcd(x-y, y)

### COMP239: Mathematics for Computer Science II. Prof. Chadi Assi EV7.635

COMP239: Mathematics for Computer Science II Prof. Chadi Assi assi@ciise.concordia.ca EV7.635 The Euclidean Algorithm The Euclidean Algorithm Finding the GCD of two numbers using prime factorization is

### NONABELIAN GROUPS WITH PERFECT ORDER SUBSETS

NONABELIAN GROUPS WITH PERFECT ORDER SUBSETS CARRIE E. FINCH AND LENNY JONES Abstract. Let G be a finite group and let x G. Define the order subset of G determined by x to be the set of all elements in

### I Foundations Of Divisibility And Congruence 1

Contents I Foundations Of Divisibility And Congruence 1 1 Divisibility 3 1.1 Definitions............................. 3 1.2 Properties Of Divisibility..................... 5 1.3 Some Basic Combinatorial

### 0 Sets and Induction. Sets

0 Sets and Induction Sets A set is an unordered collection of objects, called elements or members of the set. A set is said to contain its elements. We write a A to denote that a is an element of the set

### Theory of Numbers Problems

Theory of Numbers Problems Antonios-Alexandros Robotis Robotis October 2018 1 First Set 1. Find values of x and y so that 71x 50y = 1. 2. Prove that if n is odd, then n 2 1 is divisible by 8. 3. Define

### 2x 1 7. A linear congruence in modular arithmetic is an equation of the form. Why is the solution a set of integers rather than a unique integer?

Chapter 3: Theory of Modular Arithmetic 25 SECTION C Solving Linear Congruences By the end of this section you will be able to solve congruence equations determine the number of solutions find the multiplicative

### 2301 Assignment 1 Due Friday 19th March, 2 pm

Show all your work. Justify your solutions. Answers without justification will not receive full marks. Only hand in the problems on page 2. Practice Problems Question 1. Prove that if a b and a 3c then

### The group (Z/nZ) February 17, In these notes we figure out the structure of the unit group (Z/nZ) where n > 1 is an integer.

The group (Z/nZ) February 17, 2016 1 Introduction In these notes we figure out the structure of the unit group (Z/nZ) where n > 1 is an integer. If we factor n = p e 1 1 pe, where the p i s are distinct

### This is a recursive algorithm. The procedure is guaranteed to terminate, since the second argument decreases each time.

8 Modular Arithmetic We introduce an operator mod. Let d be a positive integer. For c a nonnegative integer, the value c mod d is the remainder when c is divided by d. For example, c mod d = 0 if and only

### 4 Number Theory and Cryptography

4 Number Theory and Cryptography 4.1 Divisibility and Modular Arithmetic This section introduces the basics of number theory number theory is the part of mathematics involving integers and their properties.

### ECE596C: Handout #11

ECE596C: Handout #11 Public Key Cryptosystems Electrical and Computer Engineering, University of Arizona, Loukas Lazos Abstract In this lecture we introduce necessary mathematical background for studying

### Elementary Algebra Chinese Remainder Theorem Euclidean Algorithm

Elementary Algebra Chinese Remainder Theorem Euclidean Algorithm April 11, 2010 1 Algebra We start by discussing algebraic structures and their properties. This is presented in more depth than what we
{"found_math": false, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 0, "mathjax_display_tex": 0, "mathjax_asciimath": 0, "img_math": 0, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0, "katex": 0, "math-container": 0, "wp-katex-eq": 0, "align": 0, "equation": 0, "x-ck12": 0, "texerror": 0, "url": "https://sciencedocbox.com/Physics/84373228-Chapter-6-prime-numbers-definition-and-fundamental-results.html", "fetch_time": 1660428464000000000, "content_mime_type": "text/html", "warc_filename": "crawl-data/CC-MAIN-2022-33/segments/1659882571987.60/warc/CC-MAIN-20220813202507-20220813232507-00264.warc.gz", "warc_record_offset": 454846114, "warc_record_length": 30186, "token_count": 13886, "char_count": 48827, "score": 4.3125, "int_score": 4, "crawl": "CC-MAIN-2022-33", "snapshot_type": "latest", "language": "en", "language_score": 0.9276044964790344, "file_path": "/sailhome/yjruan/project/latent-lm/data/processed/finemath-4plus/finemath-4plus/train-00020-of-00064.parquet"}