Question

Euclidean algorithm: Find integers a and b such that 70a+182b=28. Are the integers c and d...

Euclidean algorithm:

Find integers a and b such that 70a+182b=28. Are the integers c and d such that 70c+182d=30?

show your work please.

Homework Answers

Answer #1

We have to find integers a and b such that 70a+182b =28

If we take a=3 and b= -1 then it satisfies the given equation

Also 3 and -1 are integers

That is 70a+182b=28

70×3+182×(-1)

210-182=28 Hence proved

Hence answer is a=3 and b=-1

For second Question

We have to find integers c and d such that

70c+182d=30

We see that there is no integers c and d which satisfies 70a+182d=30

Hence in this case there is no any integers c and d which satisfies

70c+182d=30

  

Know the answer?
Your Answer:

Post as a guest

Your Name:

What's your source?

Earn Coins

Coins can be redeemed for fabulous gifts.

Not the answer you're looking for?
Ask your own homework help question
Similar Questions
Use the Euclidean Algorithm to find the smallest nonnegative integer x, s.t. there exists integers k_1,...
Use the Euclidean Algorithm to find the smallest nonnegative integer x, s.t. there exists integers k_1, k_2, such that x = 11k_1 + 3 and x = 49k_2 + 5.
ARM assembly Code The Euclidean algorithm is a way to find the greatest common divisor of...
ARM assembly Code The Euclidean algorithm is a way to find the greatest common divisor of two positive integers, a and b. First let me show the computations for a=210 and b=45. Divide 210 by 45, and get the result 4 with remainder 30, so 210=4·45+30. Divide 45 by 30, and get the result 1 with remainder 15, so 45=1·30+15. Divide 30 by 15, and get the result 2 with remainder 0, so 30=2·15+0. The greatest common divisor of 210...
Using the Euclidean Algorithm, find the Greatest Common Divisor and Bezout Coefficients of the following pair...
Using the Euclidean Algorithm, find the Greatest Common Divisor and Bezout Coefficients of the following pair of integers: (2002, 2339)
By the Euclidean algorithm to find gcd(279174, 399399) and gcd(144, 233). Again you will want a...
By the Euclidean algorithm to find gcd(279174, 399399) and gcd(144, 233). Again you will want a calculator for the divisions, but show your work. How many steps (applications of the theorem) does each calculation require?
Using the extended Euclidean algorithm, find the multiplicative inverse of a. 135 mod 61 b. 7465...
Using the extended Euclidean algorithm, find the multiplicative inverse of a. 135 mod 61 b. 7465 mod 2464 c. 42828 mod 6407
a) Use the Euclidean Algorithm to find gcd(503, 302301). (b) Write gcd(503, 302301) as a linear...
a) Use the Euclidean Algorithm to find gcd(503, 302301). (b) Write gcd(503, 302301) as a linear combination of 38 and 49. (c) What is an inverse of 503 modulo 302301? (d) Solve 503x ≡ 2 (mod 302301)
Q1. Using Euclideanalgorithm find GCD(21, 1500). Show you work .Q2. Using Extended Euclidean algorithm find the...
Q1. Using Euclideanalgorithm find GCD(21, 1500). Show you work .Q2. Using Extended Euclidean algorithm find the multiplicative inverse of 8 in mod 45 domain .Show your work including the table. Q3. Determine φ(2200). (Note that 1,2,3,5, 7, ... etc.are the primes). Show your work. Q4. Find the multiplicative inverse of 14 in GF(31) domain using Fermat’s little theorem. Show your work Q5. Using Euler’s theorem to find the following exponential: 4200mod 27. Show how you have employed Euler’s theorem here
Let x =21212121; y = 12121212: Use the Euclidean algorithm to find the GCD of x...
Let x =21212121; y = 12121212: Use the Euclidean algorithm to find the GCD of x and y. Show all steps.
Find the greatest common factor applying Euclidean Algorithm: 29448, 59220
Find the greatest common factor applying Euclidean Algorithm: 29448, 59220
Use extended Euclidean algorithm to find x and y such that 20x + 50y = 510.
Use extended Euclidean algorithm to find x and y such that 20x + 50y = 510.
ADVERTISEMENT
Need Online Homework Help?

Get Answers For Free
Most questions answered within 1 hours.

Ask a Question
ADVERTISEMENT