Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Scribd Logo
Upload

Welcome to Scribd!

  • 33 views

    Assignment 3

    Uploaded by

    Bhuvanesh Kakarla AP21110010593
    This document contains 30 math problems related to discrete mathematics topics like number theory, modular arithmetic, and binary/hexadecimal conversions. The problems cover divisibility rules, prime factorization, greatest common divisors, modular equivalences, the Chinese Remainder Theorem, Fermat's Little Theorem, and conversions between decimal, binary, octal, and hexadecimal number systems.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd

    Assignment 3

    Uploaded by

    Bhuvanesh Kakarla AP21110010593
    33 views3 pages
    This document contains 30 math problems related to discrete mathematics topics like number theory, modular arithmetic, and binary/hexadecimal conversions. The problems cover divisibility rules, prime factorization, greatest common divisors, modular equivalences, the Chinese Remainder Theorem, Fermat's Little Theorem, and conversions between decimal, binary, octal, and hexadecimal number systems.

    Original Title

    Assignment-3

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    This document contains 30 math problems related to discrete mathematics topics like number theory, modular arithmetic, and binary/hexadecimal conversions. The problems cover divisibility rules, prime factorization, greatest common divisors, modular equivalences, the Chinese Remainder Theorem, Fermat's Little Theorem, and conversions between decimal, binary, octal, and hexadecimal number systems.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    33 views3 pages

    Assignment 3

    Uploaded by

    Bhuvanesh Kakarla AP21110010593
    This document contains 30 math problems related to discrete mathematics topics like number theory, modular arithmetic, and binary/hexadecimal conversions. The problems cover divisibility rules, prime factorization, greatest common divisors, modular equivalences, the Chinese Remainder Theorem, Fermat's Little Theorem, and conversions between decimal, binary, octal, and hexadecimal number systems.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    of 3

    SRM University-AP, Amaravati

    Department of Mathematics

    Discrete Mathematics

    Assignment 3

    1. Show that if a | b and b | a, where a and b are integers, then a = b or a = −b.

    2. Show that if a, b, c are integers, where ac 6= 0, such that ac | bc, then a | b.

    3. Prove or disprove that if a | bc, where a, b, and c are positive integers and a 6= 0, then a | b or
    a | c.

    4. What are the quotient and remainder when

    (a) 45 is divided by 6? (e) -100 is divided by 101?

    (b) -1234 is divided by 19? (f) 888 is divided by 21?

    (c) -2022 is divided by 87? (g) -1 is divided by 27?

    (d) 1,234,567 is divided by 1001? (h) 0 is divided by 19?

    5. Suppose that a and b are integers, a ≡ 5(mod17), and b ≡ 8(mod17). Find the integer c with
    0 ≤ c ≤ 16 when

    (a) c ≡ 5a(mod 17) (e) c ≡ a3 + b3 (mod 17)

    (b) c ≡ 8b(mod 17) (f) c ≡ a2 + 2b4 (mod 17)

    (c) c ≡ 3a + 2b(mod 17) (g) c ≡ 7ab(mod 17)

    (d) c ≡ a2 + 3b2 (mod 17) (h) c ≡ a2 b3 (mod 17)

    6. Show that if a ≡ b(mod m) and c ≡ d(mod m), where a, b, c, d, and m are integers with m > 2,
    then a − c ≡ b − d(mod m).

    7. Show that if a, b, c, d, and m are integers such that m > 2, c > 0,and a ≡ b(mod m), then ac ≡
    bc(mod mc).

    8. Determine whether each of these integers is prime.


    a) 19 b) 27 c) 93 d) 101 e) 107 f) 113

    9. Find the prime factorization of each of these integers.


    a) 39 b) 81 c) 101 d) 143 e) 289 f) 899

    1
    10. Show that if am + 1 is composite if a and m are integers greater than 1 and m is odd.

    11. Prove or disprove that there are three consecutive odd positive integers that are primes.

    12. Which positive integers less than 18 are relatively prime to 18?

    13. Determine whether the integers in each of these sets are pairwise relatively prime.

    (a) 21, 34, 55 (c) 25, 41, 49, 64

    (b) 14, 17, 85 (d) 17, 18, 19, 23

    14. What are the greatest common divisor and least common multiple of these pairs of integers?

    (a) 22 · 33 · 55 , 25 · 33 · 52

    (b) 2 · 3 · 5 · 7 · 11 · 13, 211 · 39 · 11 · 1714

    (c) 17, 1717

    (d) 22 · 7, 53 · 13

    (e) 0, 5

    (f) 2 · 3 · 5 · 7, 2 · 3 · 5 · 7

    15. Use the Euclidean algorithm to find the greatest common divisor of the following pairs of integers.

    (a) 1, 7

    (b) 100, 101

    (c) 17, 277

    (d) 1529, 14039

    16. Express gcd(252, 356) as integer linear combination of 252 and 356.

    17. Prove that the product of any three consecutive integers is divisible by 6.

    18. Find an inverse of a modulo m for each of these pairs.

    (a) a = 4, m = 9

    (b) a = 19, m = 141

    (c) a = 55, m = 89

    (d) a = 89, m = 232

    19. Solve the following congruences.

    2
    (a) 19x ≡ 4(mod 141)

    (b) 55x ≡ 34(mod 89)

    (c) 4x ≡ 3(mod 7)

    20. Solve the system of congruence x ≡ 3(mod 6) and x ≡ 4(mod 7) by Chinese remainder theorem.

    21. Solve the system of congruence x ≡ 2(mod 3), x ≡ 1(mod 4) and x ≡ 3(mod 5) by Chinese
    remainder theorem.

    22. Solve the system of congruence x ≡ 5(mod 6), x ≡ 3(mod 10) and x ≡ 8(mod 15).

    23. Use Fermat’s little theorem to find remainder when 7121 is divided by 13.

    24. Use Fermat’s little theorem to find remainder when 231002 is divided by 41.

    25. Use Fermat’s little theorem to show that if p is prime and p - a, then ap−2 is an inverse of a
    modulo p.

    26. Convert these integers from decimal notation to binary notation.


    a) 231 b) 4532 c) 97644

    27. Convert these integers from binary notation to decimal notation.


    a) 1 1111 b) 10 0000 0001 c) 1 0101 0101 d) 110 1001 0001 0000

    28. Convert (ABCDEF)16 from its hexadecimal expansion to its binary expansion.

    29. Convert each of these integers from binary notation to hexadecimal notation.

    (a) 1111 0111

    (b) 1010 1010 1010

    (c) 111 0111 0111 0111

    30. Convert (7345321)8 to its binary expansion and (10 1011 1011)2 to its octal expansion.

    You might also like