The number 0.60 is rational and can be represented in finitely many digits in decimal  a. can it be represented by finetly many bits in binary? explain why or why not. b. if it can be done in finitely many bits, give its exact binary representation. if not, give the first ten bits of the approxijmate representation. c. give an upper bound on absolute error in this representation.

Q: 7) Show that there are no primitive roots modulo 21 using EGLF and CRT.

A: Given value of n is 21 . Now, break 21 into its factor, 21=7×3 ,7,3=1 If m>2 and n>2 then the…

Q: Consider the linear congruential number generator given by n + (ахр-1 + с) mod m

A: In this question, we have given a linear congruential  generator xn←axn-1+c  mod(m)Given thata=4,…

Q: If positive integers are chosen at random, what is the minimum number you must have in order to…

A:

Q: Find the smallest integer a > 1 such that a –1 = 2a (mod 11

A: To find:

Q: Please prove that: (р —q) —>r and p > (q > г) equivalent. Use Equivalent algorithm

A:

Q: The notation x = y mod n is used to indicate the unique integer x in the range 0 :$ x < n such…

A: Given statement is that the notation x = y mod n is used to indicate the unique integer x in the…

Q: The sign indicator s of a 64-bit machine number is 1 while its characteristic c is 1041 and the…

A: Decimal equivalent form is as follows. -1s2c-10231+f s is the sign indicator c is the characteristic…

Q: Find the smallest positive integer x that solves the congruence: 7x≡5 (mod52)

A: 7x≡5 (mod52)---(1)

Q: 4. Exercise $1.3 #35. Find four integers that are relatively prime (when taken together) but such…

A: We need to find 4 integers that are relatively prime. Also, when any 2 of them are selected together…

Q: Suppose a, n E Z and 0 < a<n. Prove that )-(".")-(C ) n- 1 in = a a а — 1 in two different ways:…

A: We have to prove, na = n-1a+n-1a-1 First let us prove this using formula. Using Formula…

Q: When performing modular arithmetic using modulo 3, all the integers are expressed in only three…

A:

Q: Determine the smallest subring of Q that contains 2/3.

A:

Q: 2. Let a be a positive integer. Explain why the linear congruence az b (mod a + 1) has a solution in…

A:

Q: Find the smallest positive integer n, пп such that 0 and 0 are 2 coterminal. And give an example

A: Coterminal angles are the angles in the standard position having a common terminal sides.

Q: Find the inverse of 35 under mod 233(if exixts), by using Euclid's Algorithm?

A:

Q: Use the Generalized Euclid’s Lemma to establishthe uniqueness portion of the Fundamental Theorem of…

A:

Q: 5 10 Let A Compute A- and use it to solve Ax %3D 47

A:

Q: Show that the set of real numbers in the interval [0,1] that do not have a 7 in their infinite…

A:

Q: Find a number a such that 70a = 1 mod 17.

A:

Q: 4. The "divide and average" method, an old-time mthod for approximating the square root of any…

A:

Q: Solve for d, 19d ≡ 1 mod (37422000) using the "Extended Euclid's Algorithm"

A: The solution is given by using Extended Euclid's Algorithm as follows

Q: Use Euclidean Algorithm to obtain x and y satisfying the (25 000, 2 460) = 25 000x + 2 460y

A:

Q: 1. Use the Euclidean Algorithm to find integers a and b such that ax 35+bx 13 = 1.

A:

Q: Use Hensel Lifting (twice) to find a solution to x² = 7 (mod 374).

A: According to the given information, it is required to use Hensel lifting method to find the…

Q: Give a recursive definition for the set of all binary palindromes, that only '0's and 'l's that are…

A:

Q: If the sum of two counting numbers is an even number, then the product of the two counting numbers…

A: ANSWER:- 1) From the given statement, If the sum of two counting numbers is an even counting number,…

Q: Consider all numbers between 20000 and 70000. Efficiently determine: A) How many of these numbers…

A: Part A - Let’s represent the number as ABCDE. You have to considere the special cases first, since…

Q: Suppose that n > 2 is an even integer and a is an (n – 1) -cycle in S,. Show that a does not commute…

A:

Q: You and your friend Lara are considering the linear congruence ax = b (mod m), where m = 6 x 11 x…

A:

Q: Use Euclid's Algorithm to show that there are integers s and t such that 57s + 73t = 1. Showing all…

A:

Q: 5 is a quadratic non- residue mod 17

A: The quadratic residues mod17 are { 1,2,4,8,9,13,15,16}

Q: Exercise 9: Prove by contradiction that 3 doesn't have a finite number of decimal places.

A:

Q: 2. Use the Euclidean Algorithm to obtain integers x and y satisfying the following (a) gcd(56,72) =…

A:

Q: When using 8-bit representations to compute the sum (-15) + (-46), there is a leading 1 (overflow)…

A: It is given that When using 8 bit representation to compute the sum (-15) + (-46), there is a…

Q: Show that in Zm there is no nilpotent element except 0 by letting m be the product of three distant…

A: Statement : In Zm, there is no nilpotent element except 0 We need to prove the  above statement by…

Q: Find the inverse of the congruence 6x = 1 (mod 29) using Euclidean algorithm.

A:

Q: Suppose, a computer has found, for a given set of values of X1, X and X3, 12 = 0.91, 13 = 0.33 and…

A:

Q: Suppose that AS B and that B has a greatest lower bound. Show that A has a greatest lower bound and…

A:

Q: When performing modular arithmetic using modulo 3, all the integers are expressed in only three…

A: We need to find the numbers in the residue classes modulo n.

Q: Exercise 9.3.2. Show that if p and q are primes, then the number of positive integers less than pq…

A:

Q: Show that, given a 7-digit number, where all digits except perhaps the last is non-zero, you can…

A:

Q: In a single-parity-check code, a single parity bit is appended to a block of k message bits (mo, m1,…

A: Answer of above question are as follows :

Q: Help

A:

Q: The least positive integer x satisfying 22010 = 3x (mod 5) is

A:

Q: Someone used the Euclidean Algorithm to compute gcd(44,140) and found the following. Use this to…

A: The extended Euclidean algorithm says that it is possible to find two integers x and y such that…

Q: Use the Euclidean algorithm to obtain integers x and y satisfying gcd (1769, 2378) = 1769 x + 2378 y

A:

Q: Solve for d using Euclid's Extended Algorithm 3d ≡ 1 mod 5200

A: Given 3d≡1 mod 5200 . The objective is to solve for d using Euclid's Extended Algorithm.