FERMAT S LAST THEOREM FOR n = 3, NOTES FOR MATH In these notes, we prove Fermat s Last Theorem for n = 3.
|
|
- Kenneth Cannon
- 5 years ago
- Views:
Transcription
1 FERMAT S LAST THEOREM FOR n = 3, NOTES FOR MATH SAM EVENS In these notes, we prove Fermat s Last Theorem for n = 3. 1 Recall that Z[ω] = {a+bω : a, b Z} has a Euclidean algorithm and is norm integral. in the sense of the notes on subrings. In particular, the following are true: Remark 1.1. (i) If π is a prime of Z[ω], and z, w Z[ω], and π z w in Z[ω], then π z or π w in Z[ω] (this is Proposition 2.15(i) from subrings notes for Z[i], and the same proof works for Z[ω]). (ii) If z Z[ω], then N(z) = 1 if and only if z is a unit of Z[ω] (see Lemma 1.8 of the notes on subrings) (iii) Let z = a + bω Z[ω] {0}. Then N(z) = a 2 ab + b 2 Z >0, and if N(z) is a prime in Z, then z is a prime in Z[ω]. (iv) λ = 1 ω is a prime in Z[ω]. Indeed, by (iii) above, N(λ) = 3, so λ is prime in Z[ω]. (v) Let z, w Z[ω]. Then z 3 w 3 = (z w) (z ωw) (z ω 2 w). Indeed, by explicit computation (z w) (z ωw) (z ω 2 w) = z 3 (1 + ω + ω 2 )z 2 w + (1 + ω + ω 2 )z w 2 w 3, since 1 + ω + ω 2 = 0. (vi) Let π be a prime of Z[ω]. Since Z[ω] is a unique factorization domain, then for any nonzero z Z[ω], we can write z = π e b for some b Z[ω] such that π does not divide b. Then we set ord π (z) = e, and it is routine to check that π z if and only if ord π (z) > 0. Further, if z, w Z[ω], then ord π (z w) = ord π (z) + ord π (w). (vii) In the language of (vi) above, let ord π (z) = e and let ord π (w) = f. Suppose e f, and let g be the minimum of e and f. Then ord π (z) = e. Indeed, suppose that g = e < f. Then z = π e a and w = π f b where π divides neither a nor b. Then z + w = π e a + π f b = π e (a + π f e b), and f e > 0. Note that π does not divide a + π f e b since if it did, it would divide (a + π f e b) π f e b = a, which is not the case. Hence, ord π (z + w) = e. A similar argument works if f < e. 1
2 2 SAM EVENS Remark 1.2. (i) If z, w Z[ω] are not both zero, then gcd(z, w) = d Z[ω] means that d z and d w, and N(d) N(e) for all e Z[ω] such that e z and e w. Similarly, if a, b, c Z[ω] are not all zero, then gcd(a, b, c) = d Z[ω] means that d a, d b, and d c, and N(d) is maximal among elements of Z[ω] dividing a, b and c. (ii) Suppose z, w Z[ω] are not both zero, and consider the ideal (z, w) = {az + bw : a, b Z[ω]}. Then Problem 4 of Homework 3 asserts that (z, w) = (d) = {d η : η Z[ω]}. It is then easy to show that d = gcd(z, w), in the same manner as this is proved for Z[i] in Proposition 2.11 of the notes on subrings. In particular, if e Z[ω] and e z and e w, then e d. Indeed, since (z, w) = (d), there are a, b Z[ω] such that d = az + bw, so since e z and e w, then e az + bw = d by Lemma 1.6(iii) from the notes on subrings. (iii) Let d = gcd(a, b, c). Then gcd( a d, b d, c d ) = 1, and the only common divisors of a d, b d, c d are units. Indeed, let e divide a d in Z[ω]. Then a = w e d for some w Z[ω], and e d a. Similarly, e d divides b and c in Z[ω], so since d = gcd(a, b, c), then N(e d) N(d). But N(e d) = N(e)N(d) N(d) since N(e) 1, so it follows that N(e d) = N(d), and N(e) = 1. Thus, e is a unit. Remark 1.3. Let u be a unit of Z[ω], and let x, y, z Z[ω] with x 3 + y 3 = uz 3. Then if a prime π of Z[ω] divides any two of x, y, z, then π divides all three of x, y, z. Indeed, suppose π divides x and y. Then π divides x 3 + y 3, so π divides uz 3. Since u is a unit, π does not divide u, so π divides z 3 by Remark 1.1 (i), and thus π divides z using the same Remark. The other cases are similar. Remark 1.4. Let z Z[ω] and u be a unit in Z[ω]. Suppose uz 3 = a b c with a, b, c Z[ω], and gcd(a, b) = gcd(b, c) = gcd(a, c) = π, where π is a prime of Z[ω]. Let ord π (z) = e, and suppose ord π (b) = ord π (c) = 1. Then there are units u a, u b, u c of Z[ω] and α, β, γ Z[ω] with π dividing none of α, β, γ and gcd(α, β) = 1, gcd(α, γ) = 1, and gcd(β, γ) = 1 so that a = u a α 3 π 3e 2, b = u b β 3 π, c = u c γ 3 π. To see this, let z = w π e with π w. Then u z 3 = u w 3 π 3e, and if π w 3, then π w by property (i) from Remark 1.1. Thus, π w 3, so ord π (z 3 ) = 3e. Since z 3 = a b c, we see that ord π (z 3 ) = ord π (a b c) = ord π (a) + ord π (b) + ord π (c), using the last equality of Remark 1.1 (vi). Since ord π (b) = ord π (c) = 1, we see that ord π (a) = 3e 2. Thus, by definition of ord π, we can write a = α a π 3e 2, b = β b π, c = γ c π, where π divides none of α a, β b, or γ c. Let q be a prime factor of a in Z[ω] and suppose q π. Then by Remark 1.1 (i), q α a. If q β b, then q a and q b. Hence, by Remark 1.2 (ii), it follows that q gcd(a, b) = π, which contradicts our assumption. Thus, q β b. Similarly, q γ c. Since q a, then q a b c = u z 3, so q z 3, and q z, again by Remark 1.1 (i). Let e q = ord q (z). Then ord q (u z 3 ) = 3e q, so ord q (a b c) = 3e q is
3 FERMAT S LAST THEOREM FOR n = 3, NOTES FOR MATH a multiple of 3. Since q does not divide b or c, we see that ord q (b) = ord q (c) = 0, and hence ord q (a) = 3e q. Thus, every prime factor appearing in a besides π must occur with exponent a multiple of 3, and it follows that α a = u a α 3 for a unit u a, where α is a product of prime factors of a besides π. Hence, a = u a α 3 π 3e 2. Similar arguments show that b = u b β 3 π, and c = u c γ 3 π, where β is a product of a prime factors of b besides π, and γ is a product of prime factors of c besides π. Lemma 1.5. Let z Z[ω]. Then z is congruent to exactly one of 1, 0, and 1 mod λ. Proof. Let z = a+bω. Then since 1 ω 0 (mod λ), a+bω a+bω+b (1 ω) a+b (mod λ). Since 3 = N(λ), then λ 3, so 3 0 (mod λ). We write a + b = 3q + r for q, r Z with 0 r < 3. Then z a + b a + b 3q r (mod λ), since 3 0 (mod λ). Thus, z is congruent to 0, 1 or 2 mod λ. If z 2 (mod λ), then z (mod λ). It follows that z is equivalent to at least one from 0, 1 and 1 mod λ. On the other hand, ±1 0 (mod λ) implies that λ ±1, and this is impossible since λ is not a unit. If 1 1 (mod λ), then λ 2, so N(λ) N(2) = 4, so 3 4 in Z, and this is not the case. It follows that 1, 0, 1 are distinct elements mod λ. Lemma 1.6. (see proof of Lemma 1 in 17.8) (i) If z 1 (mod λ), then z 3 1 (mod λ 4 ). (ii) If z 1 (mod λ), then z 3 1 (mod λ 4 ). Proof. For (i), since z 1 (mod λ), then z 1 = t λ, with t Z[ω]. Thus, z 3 1 = (z 1) (z ω) (z ω 2 ) by part (v) of Remark 1.1. Thus, z 3 1 = t λ (1+λt ω) (1+λt ω 2 ). But (1 + λt ω) = (1 ω) + λt = λ + λt = λ (1 + t), and Hence, (1 + λt ω 2 ) = ((1 ω 2 ) + λt) = ((1 ω)(1 + ω) + λt) = λ (1 + ω + t). z 3 1 = t λ λ (1 + t) λ (1 + t + ω) = λ 3 t (1 + t) (1 + t + ω). By Lemma 1.5, either t 0 or 1 or 1 mod λ. If t 0 (mod λ), then t = λ w for some w Z[ω], so z 3 1 = λ 4 w (1 + t) (1 + t + ω), and thus, z 3 1 (mod λ 4 ). If t 1 (mod λ), then t + 1 = w λ for some w Z[ω], so z 3 1 = λ 4 t w (1 + t + ω), and z 3 1 (mod λ 4 ). The other possibility is that t 1 (mod λ), so t = 1 + w λ for some w Z[ω]. But then 1+t+ω = 1+1+w λ+ω = 3 (1 ω)+wλ = (1 ω 2 ) λ λ+wλ = λ ((1 ω 2 ) 1+w), where we used 3 = N(λ) = (1 ω 2 ) λ. It follows that z 3 1 = λ 4 t (1 + t) (w ω 2 ), and hence, z 3 1 (mod λ 4 ). Thus, in any of the three possible cases for t (mod λ), we see that z 3 1 (mod λ 4 ), and this proves part (i). For part (ii), if z 1 (mod λ),
4 4 SAM EVENS then z 1 (mod λ), so by part (i) of the Lemma, ( z) 3 1 (mod λ 4 ), so z 3 1 (mod λ 4 ), and thus, z 3 1 (mod λ 4 ). Lemma 1.7. Let u be a unit of Z[ω]. (i) 2 u (mod λ 4 ). (ii) If ɛ + u 0 (mod λ 2 ), where ɛ = ±1, then u = ɛ. (iii) If ɛ = ±1, and ɛ u (mod λ 3 ), then u = ɛ. Proof. For case (i), then 2 u (mod λ 4 ), then λ 4 (2 u), and thus, N(λ 4 ) N(2 u) in Z. The possibilities are u = 1, 1, ω, ω, ω 2, ω 2, since these are the units of Z[ω]. Thus, 2 u is one of 1, 3, 2 ω, 2 + ω, 2 + (1 + ω), and 2 (1 + ω), where we have used ω 2 = 1 ω. From the formula N(a + bω) = a 2 ab + b 2 in Remark 1.1 (iii), we see that N(2 u) is one of 1, 9, 7, 3, 7, and 3. Since N(λ 4 ) = N(λ) 4 = 3 4 = 81, we see that λ 4 2 u in all these cases. This proves (i). Assertions (ii) and (iii) follow in the same way. The following proposition is called the easy case of Fermat s last theorem for n = 3. Proposition 1.8. If x, y, z Z[ω] are nonzero and λ divides none of x, y and z, then x 3 + y 3 is not equal to uz 3. Proof. We argue by contradiction. Suppose x 3 + y 3 = uz 3. Since λ divides none of x, y and z, we conclude that x ±1, y ±1, and z ±1 modulo λ, by using Lemma 1.5. Thus, by Lemma 1.6, x 3 ±1 (mod λ 4 ) and similarly y 3 ±1 (mod λ 4 ) and z 3 ±1 (mod λ 4 ). Since x 3 + y 3 uz 3 (mod λ 4 ), we see that ±1 + ±1 ±u (mod λ 4 ). But ±1 + ±1 = ±2 or 0, so either ±2 ±u (mod λ 4 ) or 0 ±u (mod λ 4 ). Thus, either 2 ±u (mod λ 4 ) or 0 ±u (mod λ 4 ). But 0 ±u (mod λ 4 ) implies that λ 4 u, and this is impossible because λ 4 is not a unit. If 2 ±u (mod λ 4 ), then since ±u is a unit, we see that 2 v (mod λ 4 ) for some unit v of Z[ω]. But this contradicts Lemma 1.7, and it follows that x 3 + y 3 = uz 3 is impossible in Z[ω]. Lemma 1.9. Let u be a unit of Z[ω], and suppose x, y, z Z[ω] with x 3 + y 3 = uz 3. Suppose that λ x and λ y, and λ z. Then λ 2 z. Proof. Reducing mod λ, we obtain x 3 + y 3 uz 3 (mod λ 4 ). Since λ x, then by Lemma 1.5, x ±1 (mod λ), so by Lemma 1.6, x 3 ±1 (mod λ 4 ). Similarly, y 3 ±1 (mod λ 4 ). It follows that ±1+±1 uz 3 (mod λ 4 ). Note that ±1+±1 is either 2, 0, or 2. If it is ±2, we obtain ±2 uz 3 (mod λ 4 ), so (±2 uz 3 ) = t λ 4 for some t Z[ω]. Since λ divides z, λ divides uz 3, and it follows that λ divides ±2, so 3 = N(λ) divides 4 = N(±2), and this is false. We conclude that 0 uz 3 (mod λ 4 ), so that uz 3 = t λ 4 for some t Z[ω]. Let ord λ (z) = e, so that z = λ e a for some a Z[ω] with λ a. Thus, u a 3 λ 3e = t λ 4. Since u is a unit and λ a, we see that ord λ (u a 3 λ 3e ) = 3e.
5 FERMAT S LAST THEOREM FOR n = 3, NOTES FOR MATH On the other hand, ord λ (t λ 4 ) = ord λ (t) + 4 4, so that 3e 4, and e 4 3. Since e Z, we see e 2, and thus λ 2 z. Lemma Let u be a unit of Z[ω], and let x, y, z Z[ω] with x 3 + y 3 = uz 3, λ x, λ y, and λ 2 z, and gcd(x, y) = 1. Then there is u 1 a unit of Z[ω], and x 1, y 1, z 1 Z[ω] with λ x 1, λ y 1, and ord λ (z 1 ) = ord λ (z) 1 so that Proof. By Remark 1.1 (v), we can factor x y 3 1 = u 1 z 3 1. u z 3 = x 3 + y 3 = (x + y) (x + ωy) (x + ω 2 y). (1.11) Since ord λ (z) = e 2, we see that ord λ (u z 3 ) = 3e 6. By Equation (1.11), we see that 3e = ord λ (x + y) + ord λ (x + ωy) + ord λ (x + ω 2 y) 6. Hence, one of ord λ (x + y), ord λ (x + ωy), and ord λ (x + ω 2 y) is greater than or equal to 2. Suppose ord λ (x + ωy) 2. Then we can let v = ωy, so y = ω 1 v = ω 2 v, and thus the above factors are x + ω 2 v, x + v, and x + ωv, and ord λ (x + v) 2. Since v 3 = y 3, we get a version of Equation 1.11 with v in place of y and ord λ (x + v) 2. We can then rename v as y, so that we get ord λ (x+y) 2. Similarly, if ord λ (x+ω 2 y) 2, we could rename variables to obtain ord λ (x + y) 2, so we may assume ord λ (x + y) 2. Consider ord λ (x + ωy) = ord λ ((x + y) (1 ω)y) = ord λ ((x + y) λ y). Note that ord λ (y) = 0 since λ y, so ord λ ( λ y) = ord λ (λ) = 1 < ord λ (x + y). Hence, by Remark 1.1 (vii), we see that ord λ (x + ωy) = 1. Similarly, ord λ (x + ω 2 y) = 1. Let π be a prime of Z[ω] so that π λ. Then π does not divide both x + y and x + ωy. If it did, then π would divide (x + y) (x + ωy) = λ y, so that π divides y by Remark 1.1 (i). Thus, π also divides x = x + y y, and this contradicts the assumption that gcd(x, y) = 1. Similarly, we can show that π cannot divide both x + y and x + ω 2 y, and π cannot divide both x + ωy and x + ω 2 y. It now follows by Property (ii) of Remark 1.4 that: x + y = u 1 α 3 λ t, t = 3 ord λ (z) 2, λ α, (1.12) x + ωy = u 2 β 3 λ, λ β, (1.13) x + ω 2 y = u 3 γ 3 λ, λ γ, (1.14) with u 1, u 2, u 3 units of Z[ω], and gcd(α, β) = 1, gcd(β, γ) = 1, and gcd(α, γ) = 1. Multiplying Equation (1.13) by ω gives ωx + ω 2 y = v 2 β 3 λ, (1.15) where v 2 = ω u 2 is a unit. Multiplying Equation (1.14) by ω 2 gives ω 2 x + ωy = v 3 γ 3 λ, (1.16) where v 3 = ω 2 u 3 is a unit. Now adding together equations (1.12), (1.15), (1.16) gives (x + y) + (ωx + ω 2 y) + (ω 2 x + ωy) = u 1 α 3 λ t + v 2 β 3 λ + v 3 γ 3 λ. (1.17)
6 6 SAM EVENS Separating x and y terms and using 1 + ω + ω 2 = 0, we obtain 0 = u 1 α 3 λ t + v 2 β 3 λ + v 3 γ 3 λ. (1.18) We divide through by λ, and note that t 1 = 3 (ord λ (z) 1) to obtain 0 = u 1 α 3 λ 3 (ord λ(z) 1) + v 2 β 3 + v 3 γ 3. (1.19) We set z 1 = α λ ord λ(z) 1, let x 1 = β, and let y 1 = γ, and obtain and after dividing through by v 2, we obtain v 2 x v 3 y 3 1 = u 1 z 3 1, (1.20) x w 1 y 3 1 = w 2 z 3 1, (1.21) with w 1 = v 3 v 2 and w 2 = u 1 v 2 units of Z[ω]. Since x 1 = β and y 1 = γ, then λ divides neither x 1 nor y 1. Thus, by Lemma 1.5, we see that x 1 ɛ 1 (mod λ), and x 2 ɛ 2 (mod λ 2 ), where ɛ 1, ɛ 2 are ±1. Note that λ z 1 since ord λ (z 1 ) = ord λ (z) 1 2 1, so λ 3 z1 3. Thus, z3 1 0 (mod λ2 ). Hence, by reducing mod λ 2, we see that ɛ 1 + w 1 ɛ 2 0 (mod λ 2 ). (1.22) We now let ɛ 1 = ɛ and w 1 ɛ 2 = u in Lemma 1.7, and conclude that w 1 ɛ 2 = ɛ 1, so w 1 = ɛ 1 ɛ2 = ɛ 3 with ɛ 3 = ±1. If w 1 = 1, we leave Equation 1.21 as it is, and if w 1 = 1, we change y 1 to y 1. In either case, letting w 2 = u, we obtain This proves the assertion. x y 3 1 = uz 3 1. (1.23) Theorem Let u Z[ω] be a unit. Then there do not exist nonzero x, y, z Z[ω] such that x 3 + y 3 = uz 3. Proof. Let S := {(x, y, z) Z[ω] {0} : u Z[ω], x 3 + y 3 = uz 3 }. We want to show S =. By Proposition 1.8, if (x, y, z) S, then λ divides at least one of x, y, z. Thus, to show S is empty, it suffices to show T = {(x, y, z) S : λ xyz} is empty. If T is not empty, we may choose (x, y, z) T with the maximum of ord λ (x), ord λ (y), ord λ (z) less than or equal to the maximum of ord λ (x ), ord λ (y ), ord λ (z ) for all (x, y, z ) in T. If λ divides two of x, y, z then λ divides gcd(x, y, z) by Remark 1.3. Then by Remark 1.2 (iii), ( x λ, y λ, z λ ) S. By Proposition 1.8, λ divides at least one of x λ, y λ, and z λ, and hence ( x λ, y λ, z λ ) T But for any w Z[ω], if λ w, then ord λ ( w λ ) = ord λ(w) 1, so that the maximum of ord λ ( x λ ), ord λ( y λ ), ord λ( z λ )) is one less than the maximum of ord λ (x), ord λ (y), ord λ (z), which contradicts the choice of (x, y, z). Hence, there exists (x, y, z) T with the property that λ divides exactly one of (x, y, z).
7 Let FERMAT S LAST THEOREM FOR n = 3, NOTES FOR MATH T 1 = {(x, y, z) T : λ x, λ y, λ z}, T 2 = {(x, y, z) T : λ x, λ y, λ z}, T 3 = {(x, y, z) T : λ x, λ y, λ z}, The final sentence of the last paragraph implies that if T is non-empty, then either T 1, T 2, or T 3 is nonempty. We next show T 3 is empty, and later use this to conclude that T 1 and T 2 is empty. If T 3 is nonempty, there exists (x, y, z) T 3 with ord λ (z) ord λ (z ) for all (x, y, z ) T 3. Let d = gcd(x, y, z), and let a = x d, b = y d, and c = z d. By Remark 1.2 (iii), (a, b, c) S. Since a x and λ x, it follows that λ a. Similarly, λ b. If λ c, we would contradict Proposition 1.8, so we conclude that λ c. Since gcd(a, b, c) = 1, it follows that gcd(a, b) = 1 by Remark 1.3. Thus, we conclude that (a, b, c) T 3, and hence, ord λ (z) ord λ (c) by the choice of (x, y, z). But z = d c, so that ord λ (z) = ord λ (d) + ord λ (c), and we conclude that ord λ (z) ord λ (c). Hence, there exists (a, b, c) T 3 with ord λ (c) minimal, and gcd(a, b) = 1. By Lemma 1.9, ord λ (c) 2. By Lemma 1.10, there is (a 1, b 1, c 1 ) T 3 with ord λ (c 1 ) = ord λ (c) 1, which contradicts the choice of (a, b, c) T 3. Hence, T 3 is empty. We now show that T 1 and T 2 are empty. Indeed, if (x, y, z) T 1, then since λ x, we know x 3 0 (mod λ 3 ). Since (x, y, z) T 1, λ y and λ z. Hence by Lemma 1.5, y ±1 (mod λ) and z ±1 (mod λ). Thus, the identity x 3 + y 3 uz 3 (mod λ 3 ) implies ɛ 1 u ɛ 2 (mod λ 3 ), where ɛ 1, ɛ 2 are in {1, 1}. We conclude, that ɛ u (mod λ 3 ) for ɛ = ±1. Hence, by Lemma 1.7 (iii), we see that u = ɛ. If u = 1, then we obtain x 3 + y 3 = z 3, so z 3 + ( y) 3 = x 3, and hence (z, y, x) T 3, which is empty. It follows that (x, y, z) / T 1, and hence T 1 is empty. If u = 1, then ( z, y, x) T 3, so similarly we see that T 1 is empty. Finally, if (x, y, z) T 2, then (y, x, z) T 1, which we have just seen is empty. Hence, T 2 is empty. Thus, T 1, T 2, and T 3 are empty, so it follows that S is empty. Department of Mathematics, University of Notre Dame, Notre Dame, IN address: sevens@nd.edu
School of Mathematics
School of Mathematics Programmes in the School of Mathematics Programmes including Mathematics Final Examination Final Examination 06 22498 MSM3P05 Level H Number Theory 06 16214 MSM4P05 Level M Number
More information1. Factorization Divisibility in Z.
8 J. E. CREMONA 1.1. Divisibility in Z. 1. Factorization Definition 1.1.1. Let a, b Z. Then we say that a divides b and write a b if b = ac for some c Z: a b c Z : b = ac. Alternatively, we may say that
More informationMath 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
More informationNOTES 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,
More informationPRACTICE PROBLEMS: SET 1
PRACTICE PROBLEMS: SET MATH 437/537: PROF. DRAGOS GHIOCA. Problems Problem. Let a, b N. Show that if gcd(a, b) = lcm[a, b], then a = b. Problem. Let n, k N with n. Prove that (n ) (n k ) if and only if
More informationHomework due on Monday, October 22
Homework due on Monday, October 22 Read sections 2.3.1-2.3.3 in Cameron s book and sections 3.5-3.5.4 in Lauritzen s book. Solve the following problems: Problem 1. Consider the ring R = Z[ω] = {a+bω :
More informationAll 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
More informationCOMP239: 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
More informationMATH 152 Problem set 6 solutions
MATH 52 Problem set 6 solutions. Z[ 2] is a Euclidean domain (i.e. has a division algorithm): the idea is to approximate the quotient by an element in Z[ 2]. More precisely, let a+b 2, c+d 2 Z[ 2] (of
More information18. Cyclotomic polynomials II
18. Cyclotomic polynomials II 18.1 Cyclotomic polynomials over Z 18.2 Worked examples Now that we have Gauss lemma in hand we can look at cyclotomic polynomials again, not as polynomials with coefficients
More informationALGEBRA. 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
More information2. THE EUCLIDEAN ALGORITHM More ring essentials
2. THE EUCLIDEAN ALGORITHM More ring essentials In this chapter: rings R commutative with 1. An element b R divides a R, or b is a divisor of a, or a is divisible by b, or a is a multiple of b, if there
More informationChapter 1. From Euclid to Gauss. 1.1 Prime numbers. If a, b Z we say that a divides b (or is a divisor of b) and we write a b, if.
Chapter 1 From Euclid to Gauss 1.1 Prime numbers If a, b Z we say that a divides b (or is a divisor of b) and we write a b, if for some c Z. Thus 2 0 but 0 2. b = ac Definition 1.1. The number p N is said
More informationMATH 361: NUMBER THEORY TWELFTH LECTURE. 2 The subjects of this lecture are the arithmetic of the ring
MATH 361: NUMBER THEORY TWELFTH LECTURE Let ω = ζ 3 = e 2πi/3 = 1 + 3. 2 The subjects of this lecture are the arithmetic of the ring and the cubic reciprocity law. D = Z[ω], 1. Unique Factorization The
More informationCHAPTER 6. Prime Numbers. Definition and Fundamental Results
CHAPTER 6 Prime Numbers Part VI of PJE. Definition and Fundamental Results 6.1. Definition. (PJE definition 23.1.1) An integer p is prime if p > 1 and the only positive divisors of p are 1 and p. If n
More informationAn 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
More informationMATH 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
More informationLARGE 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}
More informationCISC-102 Fall 2017 Week 6
Week 6 page 1! of! 15 CISC-102 Fall 2017 Week 6 We will see two different, yet similar, proofs that there are infinitely many prime numbers. One proof would surely suffice. However, seeing two different
More information(January 14, 2009) q n 1 q d 1. D = q n = q + d
(January 14, 2009) [10.1] Prove that a finite division ring D (a not-necessarily commutative ring with 1 in which any non-zero element has a multiplicative inverse) is commutative. (This is due to Wedderburn.)
More informationNumber Theory Math 420 Silverman Exam #1 February 27, 2018
Name: Number Theory Math 420 Silverman Exam #1 February 27, 2018 INSTRUCTIONS Read Carefully Time: 50 minutes There are 5 problems. Write your name neatly at the top of this page. Write your final answer
More informationMath 109 September 1, 2016
Math 109 September 1, 2016 Question 1 Given that the proposition P Q is true. Which of the following must also be true? A. (not P ) or Q. B. (not Q) implies (not P ). C. Q implies P. D. A and B E. A, B,
More informationMATH 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
More information4 Powers of an Element; Cyclic Groups
4 Powers of an Element; Cyclic Groups Notation When considering an abstract group (G, ), we will often simplify notation as follows x y will be expressed as xy (x y) z will be expressed as xyz x (y z)
More informationNOTES ON INTEGERS. 1. Integers
NOTES ON INTEGERS STEVEN DALE CUTKOSKY The integers 1. Integers Z = {, 3, 2, 1, 0, 1, 2, 3, } have addition and multiplication which satisfy familar rules. They are ordered (m < n if m is less than n).
More information6]. (10) (i) Determine the units in the rings Z[i] and Z[ 10]. If n is a squarefree
Quadratic extensions Definition: Let R, S be commutative rings, R S. An extension of rings R S is said to be quadratic there is α S \R and monic polynomial f(x) R[x] of degree such that f(α) = 0 and S
More informationA field F is a set of numbers that includes the two numbers 0 and 1 and satisfies the properties:
Byte multiplication 1 Field arithmetic A field F is a set of numbers that includes the two numbers 0 and 1 and satisfies the properties: F is an abelian group under addition, meaning - F is closed under
More informationHomework 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
More informationp = 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
More informationMath 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
More informationDiscrete valuation rings. Suppose F is a field. A discrete valuation on F is a function v : F {0} Z such that:
Discrete valuation rings Suppose F is a field. A discrete valuation on F is a function v : F {0} Z such that: 1. v is surjective. 2. v(ab) = v(a) + v(b). 3. v(a + b) min(v(a), v(b)) if a + b 0. Proposition:
More informationChapter 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,
More informationElementary 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
More information32 Divisibility Theory in Integral Domains
3 Divisibility Theory in Integral Domains As we have already mentioned, the ring of integers is the prototype of integral domains. There is a divisibility relation on * : an integer b is said to be divisible
More informationDefinitions. Notations. Injective, Surjective and Bijective. Divides. Cartesian Product. Relations. Equivalence Relations
Page 1 Definitions Tuesday, May 8, 2018 12:23 AM Notations " " means "equals, by definition" the set of all real numbers the set of integers Denote a function from a set to a set by Denote the image of
More informationNotes on Systems of Linear Congruences
MATH 324 Summer 2012 Elementary Number Theory Notes on Systems of Linear Congruences In this note we will discuss systems of linear congruences where the moduli are all different. Definition. Given the
More informationWORKSHEET ON NUMBERS, MATH 215 FALL. We start our study of numbers with the integers: N = {1, 2, 3,...}
WORKSHEET ON NUMBERS, MATH 215 FALL 18(WHYTE) We start our study of numbers with the integers: Z = {..., 2, 1, 0, 1, 2, 3,... } and their subset of natural numbers: N = {1, 2, 3,...} For now we will not
More informationKnow 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
More informationSOLUTIONS 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
More informationLecture Notes Math 371: Algebra (Fall 2006) by Nathanael Leedom Ackerman
Lecture Notes Math 371: Algebra (Fall 2006) by Nathanael Leedom Ackerman October 17, 2006 TALK SLOWLY AND WRITE NEATLY!! 1 0.1 Factorization 0.1.1 Factorization of Integers and Polynomials Now we are going
More informationHomework #2 solutions Due: June 15, 2012
All of the following exercises are based on the material in the handout on integers found on the class website. 1. Find d = gcd(475, 385) and express it as a linear combination of 475 and 385. That is
More informationD-MATH Algebra I HS18 Prof. Rahul Pandharipande. Solution 1. Arithmetic, Zorn s Lemma.
D-MATH Algebra I HS18 Prof. Rahul Pandharipande Solution 1 Arithmetic, Zorn s Lemma. 1. (a) Using the Euclidean division, determine gcd(160, 399). (b) Find m 0, n 0 Z such that gcd(160, 399) = 160m 0 +
More information12x + 18y = 50. 2x + v = 12. (x, v) = (6 + k, 2k), k Z.
Math 3, Fall 010 Assignment 3 Solutions Exercise 1. Find all the integral solutions of the following linear diophantine equations. Be sure to justify your answers. (i) 3x + y = 7. (ii) 1x + 18y = 50. (iii)
More informationFactoring Algorithms Pollard s p 1 Method. This method discovers a prime factor p of an integer n whenever p 1 has only small prime factors.
Factoring Algorithms Pollard s p 1 Method This method discovers a prime factor p of an integer n whenever p 1 has only small prime factors. Input: n (to factor) and a limit B Output: a proper factor of
More informationMATH 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
More information0 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
More informationSOLUTIONS 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.
More information1. 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.
More informationProof 1: Using only ch. 6 results. Since gcd(a, b) = 1, we have
Exercise 13. Consider positive integers a, b, and c. (a) Suppose gcd(a, b) = 1. (i) Show that if a divides the product bc, then a must divide c. I give two proofs here, to illustrate the different methods.
More informationFACTORING IN QUADRATIC FIELDS. 1. Introduction
FACTORING IN QUADRATIC FIELDS KEITH CONRAD For a squarefree integer d other than 1, let 1. Introduction K = Q[ d] = {x + y d : x, y Q}. This is closed under addition, subtraction, multiplication, and also
More informationARITHMETIC PROGRESSIONS OF SQUARES, CUBES AND n-th POWERS
ARITHMETIC PROGRESSIONS OF SQUARES, CUBES AND n-th POWERS L. HAJDU 1, SZ. TENGELY 2 Abstract. In this paper we continue the investigations about unlike powers in arithmetic progression. We provide sharp
More informationMATH 215 Final. M4. For all a, b in Z, a b = b a.
MATH 215 Final We will assume the existence of a set Z, whose elements are called integers, along with a well-defined binary operation + on Z (called addition), a second well-defined binary operation on
More informationMATH 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
More informationALGEBRA HANDOUT 2.3: FACTORIZATION IN INTEGRAL DOMAINS. In this handout we wish to describe some aspects of the theory of factorization.
ALGEBRA HANDOUT 2.3: FACTORIZATION IN INTEGRAL DOMAINS PETE L. CLARK In this handout we wish to describe some aspects of the theory of factorization. The first goal is to state what it means for an arbitrary
More informationJu-Si Lee 1. INTRODUCTION
TAIWANESE JOURNAL OF MATHEMATICS Vol. 1, No. 5, pp. 1191-1199, August 008 This paper is available online at http://www.tjm.nsysu.edu.tw/ THE RESTRICTED SOLUTIONS OF ax + by =gcd(a, b) Ju-Si Lee Abstract.
More informationAlgebraic Number Theory
Algebraic Number Theory Wintersemester 2013/14 Universität Ulm Stefan Wewers Institut für Reine Mathematik Contents vorläufige und unvollständige Version Stand: 9.2.2014 1 Roots of algebraic number theory
More informationThe Impossibility of Certain Types of Carmichael Numbers
The Impossibility of Certain Types of Carmichael Numbers Thomas Wright Abstract This paper proves that if a Carmichael number is composed of primes p i, then the LCM of the p i 1 s can never be of the
More informationPrime Numbers and Irrational Numbers
Chapter 4 Prime Numbers and Irrational Numbers Abstract The question of the existence of prime numbers in intervals is treated using the approximation of cardinal of the primes π(x) given by Lagrange.
More informationSelected Math 553 Homework Solutions
Selected Math 553 Homework Solutions HW6, 1. Let α and β be rational numbers, with α 1/2, and let m > 0 be an integer such that α 2 mβ 2 = 1 δ where 0 δ < 1. Set ǫ:= 1 if α 0 and 1 if α < 0. Show that
More informationMathematics 220 Homework 4 - Solutions. Solution: We must prove the two statements: (1) if A = B, then A B = A B, and (2) if A B = A B, then A = B.
1. (4.46) Let A and B be sets. Prove that A B = A B if and only if A = B. Solution: We must prove the two statements: (1) if A = B, then A B = A B, and (2) if A B = A B, then A = B. Proof of (1): Suppose
More informationMath 547, Exam 2 Information.
Math 547, Exam 2 Information. 3/19/10, LC 303B, 10:10-11:00. Exam 2 will be based on: Homework and textbook sections covered by lectures 2/3-3/5. (see http://www.math.sc.edu/ boylan/sccourses/547sp10/547.html)
More informationExample: This theorem is the easiest way to test an ideal (or an element) is prime. Z[x] (x)
Math 4010/5530 Factorization Theory January 2016 Let R be an integral domain. Recall that s, t R are called associates if they differ by a unit (i.e. there is some c R such that s = ct). Let R be a commutative
More information2 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
More informationHonors Algebra 4, MATH 371 Winter 2010 Assignment 3 Due Friday, February 5 at 08:35
Honors Algebra 4, MATH 371 Winter 2010 Assignment 3 Due Friday, February 5 at 08:35 1. Let R 0 be a commutative ring with 1 and let S R be the subset of nonzero elements which are not zero divisors. (a)
More informationHomework 6 Solution. Math 113 Summer 2016.
Homework 6 Solution. Math 113 Summer 2016. 1. For each of the following ideals, say whether they are prime, maximal (hence also prime), or neither (a) (x 4 + 2x 2 + 1) C[x] (b) (x 5 + 24x 3 54x 2 + 6x
More informationCourse 2316 Sample Paper 1
Course 2316 Sample Paper 1 Timothy Murphy April 19, 2015 Attempt 5 questions. All carry the same mark. 1. State and prove the Fundamental Theorem of Arithmetic (for N). Prove that there are an infinity
More informationSenior Math Circles Cryptography and Number Theory Week 2
Senior Math Circles Cryptography and Number Theory Week 2 Dale Brydon Feb. 9, 2014 1 Divisibility and Inverses At the end of last time, we saw that not all numbers have inverses mod n, but some do. We
More informationJust like the ring of Gaussian integers, the ring of Eisenstein integers is a Unique Factorization Domain.
Fermat s Infinite Descent PMATH 340 Assignment 6 (Due Monday April 3rd at noon). (0 marks) Use Femtat s method of infinite descent to prove that the Diophantine equation x 3 + y 3 = 4z 3 has no solutions
More informationDefinition For a set F, a polynomial over F with variable x is of the form
*6. Polynomials Definition For a set F, a polynomial over F with variable x is of the form a n x n + a n 1 x n 1 + a n 2 x n 2 +... + a 1 x + a 0, where a n, a n 1,..., a 1, a 0 F. The a i, 0 i n are the
More informationMath 547, Exam 1 Information.
Math 547, Exam 1 Information. 2/10/10, LC 303B, 10:10-11:00. Exam 1 will be based on: Sections 5.1, 5.2, 5.3, 9.1; The corresponding assigned homework problems (see http://www.math.sc.edu/ boylan/sccourses/547sp10/547.html)
More informationMATH 145 Algebra, Solutions to Assignment 4
MATH 145 Algebra, Solutions to Assignment 4 1: a) Find the inverse of 178 in Z 365. Solution: We find s and t so that 178s + 365t = 1, and then 178 1 = s. The Euclidean Algorithm gives 365 = 178 + 9 178
More informationNumber Theory. Final Exam from Spring Solutions
Number Theory. Final Exam from Spring 2013. Solutions 1. (a) (5 pts) Let d be a positive integer which is not a perfect square. Prove that Pell s equation x 2 dy 2 = 1 has a solution (x, y) with x > 0,
More informationEXAMPLES OF MORDELL S EQUATION
EXAMPLES OF MORDELL S EQUATION KEITH CONRAD 1. Introduction The equation y 2 = x 3 +k, for k Z, is called Mordell s equation 1 on account of Mordell s long interest in it throughout his life. A natural
More informationProposition The gaussian numbers form a field. The gaussian integers form a commutative ring.
Chapter 11 Gaussian Integers 11.1 Gaussian Numbers Definition 11.1. A gaussian number is a number of the form z = x + iy (x, y Q). If x, y Z we say that z is a gaussian integer. Proposition 11.1. The gaussian
More informationSolutions for Homework Assignment 2
Solutions for Homework Assignment 2 Problem 1. If a,b R, then a+b a + b. This fact is called the Triangle Inequality. By using the Triangle Inequality, prove that a b a b for all a,b R. Solution. To prove
More informationCS 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
More information. In particular if a b then N(
Gaussian Integers II Let us summarise what we now about Gaussian integers so far: If a, b Z[ i], then N( ab) N( a) N( b). In particular if a b then N( a ) N( b). Let z Z[i]. If N( z ) is an integer prime,
More informationSolving Diophantine Equations With Unique Factorization
Solving Diophantine Equations With Unique Factorization February 17, 2016 1 Introduction In this note we should how unique factorization in rings like Z[i] and Z[ 2] can be used to find integer solutions
More informationSolutions to Practice Final
s to Practice Final 1. (a) What is φ(0 100 ) where φ is Euler s φ-function? (b) Find an integer x such that 140x 1 (mod 01). Hint: gcd(140, 01) = 7. (a) φ(0 100 ) = φ(4 100 5 100 ) = φ( 00 5 100 ) = (
More informationHomework 7 solutions M328K by Mark Lindberg/Marie-Amelie Lawn
Homework 7 solutions M328K by Mark Lindberg/Marie-Amelie Lawn Problem 1: 4.4 # 2:x 3 + 8x 2 x 1 0 (mod 1331). a) x 3 + 8x 2 x 1 0 (mod 11). This does not break down, so trial and error gives: x = 0 : f(0)
More informationLecture 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
More informationChapter 3 Basic Number Theory
Chapter 3 Basic Number Theory What is Number Theory? Well... What is Number Theory? Well... Number Theory The study of the natural numbers (Z + ), especially the relationship between different sorts of
More informationDefinition 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
More informationCongruence of Integers
Congruence of Integers November 14, 2013 Week 11-12 1 Congruence of Integers Definition 1. Let m be a positive integer. For integers a and b, if m divides b a, we say that a is congruent to b modulo m,
More informationLECTURE NOTES IN CRYPTOGRAPHY
1 LECTURE NOTES IN CRYPTOGRAPHY Thomas Johansson 2005/2006 c Thomas Johansson 2006 2 Chapter 1 Abstract algebra and Number theory Before we start the treatment of cryptography we need to review some basic
More informationDiophantine triples in a Lucas-Lehmer sequence
Annales Mathematicae et Informaticae 49 (01) pp. 5 100 doi: 10.33039/ami.01.0.001 http://ami.uni-eszterhazy.hu Diophantine triples in a Lucas-Lehmer sequence Krisztián Gueth Lorand Eötvös University Savaria
More informationMATH 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
More informationNumber 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
More informationLEHMER S TOTIENT PROBLEM AND CARMICHAEL NUMBERS IN A PID
LEHMER S TOTIENT PROBLEM AND CARMICHAEL NUMBERS IN A PID JORDAN SCHETTLER Abstract. Lehmer s totient problem consists of determining the set of positive integers n such that ϕ(n) n 1 where ϕ is Euler s
More informationU + V = (U V ) (V U), UV = U V.
Solution of Some Homework Problems (3.1) Prove that a commutative ring R has a unique 1. Proof: Let 1 R and 1 R be two multiplicative identities of R. Then since 1 R is an identity, 1 R = 1 R 1 R. Since
More informationCh 4.2 Divisibility Properties
Ch 4.2 Divisibility Properties - Prime numbers and composite numbers - Procedure for determining whether or not a positive integer is a prime - GCF: procedure for finding gcf (Euclidean Algorithm) - Definition:
More informationFor your quiz in recitation this week, refer to these exercise generators:
Monday, Oct 29 Today we will talk about inverses in modular arithmetic, and the use of inverses to solve linear congruences. For your quiz in recitation this week, refer to these exercise generators: GCD
More informationNumber Theory and Group Theoryfor Public-Key Cryptography
Number Theory and Group Theory for Public-Key Cryptography TDA352, DIT250 Wissam Aoudi Chalmers University of Technology November 21, 2017 Wissam Aoudi Number Theory and Group Theoryfor Public-Key Cryptography
More information#G03 INTEGERS 10 (2010), MIN, A COMBINATORIAL GAME HAVING A CONNECTION WITH PRIME NUMBERS
#G03 INTEGERS 10 (2010), 765-770 MIN, A COMBINATORIAL GAME HAVING A CONNECTION WITH PRIME NUMBERS Grant Cairns Department of Mathematics, La Trobe University, Melbourne, Australia G.Cairns@latrobe.edu.au
More informationEUCLID S ALGORITHM AND THE FUNDAMENTAL THEOREM OF ARITHMETIC after N. Vasiliev and V. Gutenmacher (Kvant, 1972)
Intro to Math Reasoning Grinshpan EUCLID S ALGORITHM AND THE FUNDAMENTAL THEOREM OF ARITHMETIC after N. Vasiliev and V. Gutenmacher (Kvant, 1972) We all know that every composite natural number is a product
More informationSummary: Divisibility and Factorization
Summary: Divisibility and Factorization One of the main subjects considered in this chapter is divisibility of integers, and in particular the definition of the greatest common divisor Recall that we have
More informationGaussian integers. 1 = a 2 + b 2 = c 2 + d 2.
Gaussian integers 1 Units in Z[i] An element x = a + bi Z[i], a, b Z is a unit if there exists y = c + di Z[i] such that xy = 1. This implies 1 = x 2 y 2 = (a 2 + b 2 )(c 2 + d 2 ) But a 2, b 2, c 2, d
More informationWilson s Theorem and Fermat s Little Theorem
Wilson s Theorem and Fermat s Little Theorem Wilson stheorem THEOREM 1 (Wilson s Theorem): (p 1)! 1 (mod p) if and only if p is prime. EXAMPLE: We have (2 1)!+1 = 2 (3 1)!+1 = 3 (4 1)!+1 = 7 (5 1)!+1 =
More information8 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.
More informationGreatest Common Divisor MATH Greatest Common Divisor. Benjamin V.C. Collins, James A. Swenson MATH 2730
MATH 2730 Greatest Common Divisor Benjamin V.C. Collins James A. Swenson The world s least necessary definition Definition Let a, b Z, not both zero. The largest integer d such that d a and d b is called
More information