Problem 1RQ: Find 210 div 17 and 210 mod 17. Problem 2RQ: a) Define what it means for a and b to be congruent modulo 7. b) Which pairs of the integers —11,... Problem 3RQ: Show if ab(modm) and cd(modm) , then a+cb+d(modm) . Problem 4RQ: Describe a procedure for converting decimal (base 10) expansions of integers into hexadecimal... Problem 5RQ Problem 6RQ: Convert (7206)8 and (AOEB)16 to a binary representation. Problem 7RQ: State the fundamental theorem of arithmetic. Problem 8RQ: a) Describe a procedure for finding the prime factorization of an integer. b) Use this procedure to... Problem 9RQ: a) Define the greatest common divisor of two integers, b) Describe at least three different ways to... Problem 10RQ: a) How can you find a linear combination (with integer coefficients) of two integers that equals... Problem 11RQ: a) What does it mean for a to be an inverse of a modulo m? b) How can you find an inverse of a... Problem 12RQ: a) How can an inverse of a modulo m be used to solve the congruence axb(modm) when gcd(a,m)=1 ? b)... Problem 13RQ: a) State the Chinese remainder theorem. b) Find the solutions to the system x=1(mod4),x=2(mod5) ,... Problem 14RQ: Suppose that 2n11(modn) . Is n necessarily prime? Problem 15RQ: Use Fermat’s little theorem to evaluate 9200 mod 19. Problem 16RQ: Explain how the check digit is found for a 10-digi ISBN. Problem 17RQ: Encrypt the meassage APPLES AND ORGANGES using a shift cipher with key k=13 . Problem 18RQ: a) What is the difference between a public key and a private key cryptosystem? b) Explain why using... Problem 19RQ: Explain how encryption and decryption are done in the RSA cryptosystem. Problem 20RQ: Describe how two parties can share a secret key using the Diffie Hellman key exchange protocol. Problem 1SE: The odometer on a car goes to up 100,000 miles. The present owner of a car bought it when the... Problem 2SE: a) Explain why n div 7 equals the number of complete weeks in n days. b) Explain why n div 24 equals... Problem 3SE: Find four numbers congruent to 5 modulo 17. Problem 4SE: Show that if a and d are positive integers, then there are integers q and r such that a=dq+r , where... Problem 5SE: Show that if acbc(modm) where a,b,c, and m are integers with m2 , and d=gcd(m,c) , then ab(modm/d) . Problem 6SE: Show that the sum of the squares of two odd integers cannot be the square of an integer. Problem 7SE: Show that if n2+1 is a perfect square, where n is an integer, then n is even. Problem 8SE: Prove that there are no solutions in integers x and y to equation x2-5y2=2 . [Hint: Consider the... Problem 9SE: Develop a test for divisibility of a positive integer n by 8 based on the binary expansion of n. Problem 10SE: Develop a test for divisibility of a positive integer n by 3 based on the binary expansion of n. Problem 11SE: Devise an algorithm for guessing a number between 1 and 2n-1 by successively guessing each bit in... Problem 12SE: Determine the complexity, in terms of the number of guesses, needed to determine a number between 1... Problem 13SE: Show that an integer is divisible by 9 if and only if the sum of its decimal digits is divisible by... Problem 14SE: Show that a and b are positive irrational numbers such that 1/a+1/b=1 , then every positive integer... Problem 15SE: Prove there are infinitely many primes by showing that Qn=n!+1 must have a prime factor greater than... Problem 16SE: Find a positive integer n for which Qn=n!+1 is not prime. Problem 17SE: Use Dirichlet’s theorem, which states there are infinitely many primes in every arithmetic... Problem 18SE: Prove that if n is a positive integer such that the sum of the divisors of n is n+1 , then n is... Problem 19SE: Show that every integer greater than 11 is the sum of two composite integers. Problem 20SE: Find the five smallest consecutive composite integers. Problem 21SE: Show that Goldbach’s conjecture, which states that every even integer greater than 2 is the sum of... Problem 22SE: Find an arithmetic progression of length six beginning with 7 that contains only primes. Problem 23SE: Prove that if f(x) is a nonconstant polynomial with integer coefficients, then there is an integer y... Problem 24SE: How many zeros are at the end of the binary expansion of (10010)!? Problem 25SE: Use the Euclidean algorithm to find the greatest common divisor of 10,223 and 33,341. Problem 26SE: How many divisions are required to find gcd(144, 233) using the Euclidean algorithm? Problem 27SE: Find gcd(2n+1,3n+2) , where n is a positive integer. [Hint: Use the Euclidean algorithm.] Problem 28SE: Show that if a and b are positive integers with ab , then gcd(a,b)=a if a=b,gcd(a,b)=2gcd(a/2,b/2)... Problem 29SE: Adapt the proof that here are infinitely many primes (Theorem 3 in Section 4.3) to show that there... Problem 30SE: Explain why you cannot directly adapt the proof that here are infinitely many primes (Theorem 3 in... Problem 31SE: Explain why you cannot directly adapt the proof that here are infinitely many primes (Theorem 3 in... Problem 32SE: Show that if the smallest prime factor p of the positive integer n is larger than 3n then n/p is... Problem 33SE Problem 34SE: Find a set of four mutually relatively prime integers such that no two of them are relatively prime. Problem 35SE: For which positive integers n is n4+nn prime? Problem 36SE: Show that the system of congruences x2(mod6) and x3(mod9) has no solutions. Problem 37SE: Find all solutions of the system of congruences x4(mod6) and x13(mod15) . Problem 38SE: a) Show that the system of congruences xa1(modm1) and xa2(modm2) , where a1,a2,m1 and m2 are... Problem 39SE: Prove that 30 divisible n9-n for every nonnegative integer n. Problem 40SE: Prove that n12-1 is divisible by 35 for every integer n for which gcd(n,35)=1 . Problem 41SE: Show that if p and q are distinct prime numbers, then pq1+qp1(modpq) . The check digit a13for an... Problem 42SE: Determine whether each of these 13-digit numbers is a valid ISBN-13. a) 978-0-073-20679-1 b)... Problem 43SE: Show that the check digit of an ISBN-13 can always detect a single error. Problem 44SE: Show that there are transpositions of two digit that are not detected by an ISBN-13. A routing... Problem 45SE Problem 46SE: Show that the check digit of an RTN can detect all single errors and determine which transposition... Problem 47SE: The encrypted version of message is LJMKG MG-MXF QEXMW. IF IT WAS ENCRYPTED USING THE AFFINE CHIPHER... Problem 48SE: Use the autokey cipher to encrypt the message NOW IS THE TIME TO DECIDE (ignoring spaces) using a)... Problem 49SE: Use the auto key cipher to encrypt the message THE DREW OF REASON (ignoring spaces) using a) the... Problem 1CP: Given integers n and b, each greater than 1, find the base b expansion of this integer. Problem 2CP: Given the positive integers a, b, and m with m1 , find abmodm . Problem 3CP: Given a positive integer, find the cantor expansion of this integer (see the preamble to Exercise 54... Problem 4CP: Give a positive integer, determine whether it is prime using trial division. Problem 5CP: Given a positive integer, find the prime factorization of this integer. Problem 6CP: Given two positive integers, find their greatest common divisor using the Euclidean algorithm. Problem 7CP Problem 8CP Problem 9CP Problem 10CP: Given n liner congruences modulo pairwise relatively prime moduli, find the simultaneous solution of... Problem 11CP Problem 12CP Problem 13CP Problem 14CP Problem 15CP Problem 16CP: Find the original plaintext message from the ciphertext message produced by encrypting the plaintext... Problem 17CP Problem 18CP Problem 19CP: Given a valid RSA key (n, e), and the primes p and q with n=pq , find the associated decryption key... Problem 20CP: Given a message encrypted using the RSA cryptosystem with key (n, e) and the associated decryption... Problem 21CP: Generate a shared key using the Diffie-Hellman key exchange protocol. Problem 22CP Problem 1CAE: Determine whether 2p1 is prime for each of the primes not exceeding 100. Problem 2CAE Problem 3CAE Problem 4CAE Problem 5CAE Problem 6CAE Problem 7CAE Problem 8CAE Problem 9CAE Problem 1WP Problem 2WP: Explain how probabilistic primality tests are used in practice to produce extremely large numbers... Problem 3WP: The question of whether there are infinitely many Carmichael numbers was solved recently after being... Problem 4WP Problem 5WP: Describe the algorithms that are actually used by modern computers to add, subtract, multiply, and... Problem 6WP: Describe the history of the Chinese remainder theorem. Describe some of the relevant problems posed... Problem 7WP: When are the numbers of a sequence truly random numbers, and not pseudorandom? What short comings... Problem 8WP Problem 9WP Problem 10WP Problem 11WP Problem 12WP: Describe how public key cryptography can be used to produce signed secret message so that the... Problem 13WP: Describe the Rabin public key cryptosystem, explaining how to encrypt and how do decrypt message and... Problem 14WP: Explain why it would be unsuitable to use p, where p is a large prime, as the modulus for encryption... Problem 15WP Problem 16WP: Explain the steps that Gentry used to construct a fully homomorphic cryptosystem. format_list_bulleted