Scribd Logo
Upload

Welcome to Scribd!

  • Number Theory Assignment: Section A

    Uploaded by

    Deon Chawaguta
    15 views2 pages
    The document is a student's number theory assignment that includes: 1) Finding the greatest common divisor (gcd) of 650 and 2020, which is 10. 2) Determining that 650 is not relatively prime to 2020 since their gcd is not 1. 3) Listing the prime numbers below 50. 4) Computing the sum of divisors (σ) of 650, which is 1302. 5) Stating that the prime factors of 650 are 2, 5, 5, and 13.

    Original Description:

    Original Title

    Number-Theory-Assignme0nt.docx

    Copyright

    © © All Rights Reserved

    Available Formats

    DOCX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    The document is a student's number theory assignment that includes: 1) Finding the greatest common divisor (gcd) of 650 and 2020, which is 10. 2) Determining that 650 is not relatively prime to 2020 since their gcd is not 1. 3) Listing the prime numbers below 50. 4) Computing the sum of divisors (σ) of 650, which is 1302. 5) Stating that the prime factors of 650 are 2, 5, 5, and 13.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    15 views2 pages

    Number Theory Assignment: Section A

    Uploaded by

    Deon Chawaguta
    The document is a student's number theory assignment that includes: 1) Finding the greatest common divisor (gcd) of 650 and 2020, which is 10. 2) Determining that 650 is not relatively prime to 2020 since their gcd is not 1. 3) Listing the prime numbers below 50. 4) Computing the sum of divisors (σ) of 650, which is 1302. 5) Stating that the prime factors of 650 are 2, 5, 5, and 13.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    of 2

    Number Theory Assignment

    Deon Chawaguta - H190650Y

    m = 650

    Section A
    1.
    finding gcd(m,2020)
    gcd(650, 2020) a = bq + r 2020 = b650 + r; q = ⌊2020/650⌋ = 3; r = 2020 - 650(3) = 2020 -
    1950 = 70 650 = b70 + r; q = ⌊650/70⌋ = 9; r = 650 - 70(9) = 650 - 630 = 20 70 = b20 + r; q =
    ⌊70/20⌋ = 3; r = 70 - 20(3) = 70 - 60 = 10 20 = b*10 + r; q = ⌊20/10⌋ = 2; r = 20 - 10(2) = 20
    - 20 = 0
    ∴ gcd(650,2020) = 10

    2.
    m is not relatively prime to 2020 because gcd(650,2020) ≠ 0

    3.
    2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33
    34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50
    Prime Numbers to 50 : 2 3 5 7 11 13 17 19 23 29 31 37 41 43 47

    4.
    σ(m) = 1 + 2 + 5 + 10 + 13 + 25 + 26 + 50 + 65 + 130 + 325 + 650 = 1302

    5.
    650 = 2 * 5 * 5 * 13 μ(m) = 0

    6.
    (a) ø(11) = 10
    (b) ø(343) = ø(73) = (73-1)(7-1) = 294
    (c) ø(391) = ø(17)* ø(23) = 16*22 = 352

    7.
    if n is odd then n-1|2
    ø(n) = ø(n)
    8.
    The 5th fermat number has 5 digits

    9.
    Finding inverse modulo m of 3

    Section B
    1.
    GCD(1980,2020) = 20

    2.
    GCD(1979, 2020) = 1
    1979 is relatively prime to 2020

    3.
    Prime numbers between 1000 and 1500 : 1009 1013 1019 1021 1031 1033 1039 1049
    1051 1061 1063 1069 1087 1091 1093 1097 [185] 1103 1109 1117 1123 1129 1151 1153
    1163 1171 1181 1187 1193 1201 1213 1217 1223 1229 1231 1237 1249 1259 1277 1279
    [208] 1283 1289 1291 1297 1301 1303 1307 1319 1321 1327 1361 1367 1373 1381 1399
    1409 1423 1427 1429 1433 1439 1447 1451 [231] 1453 1459 1471 1481 1483 1487 1489
    1493 1499
    atkin_sieve(1500)

    4.

    You might also like