(1 point) Compute: gcd(72, 33)- Find a pair of integers x and y such that 72x...

Question

Question

(1 point) Compute: gcd(72, 33)- Find a pair of integers x and y such that 72x + 33y gcd(72, 33)

math Advanced-Math

Answer 1

Answer #1

33 2742 Rug ged (72,33)- 3 6133 S 30 3) (2 =39-sx (72-33x2) 3 -ly 33-X72

Answer 2

Similar Homework Help Questions

Using Extended Euclid a. Use Euclid’s algorithm to compute gcd(1175, 423) b. Use the extended Euclid...

Using Extended Euclid a. Use Euclid’s algorithm to compute gcd(1175, 423) b. Use the extended Euclid algorithm to find integers x and y such that gcd(1175, 423) = 1175x + 423y. What is x and y?
Using the reverse of Euclid's division algorithm compute: (a) Find integers x; y such that 24x...

Using the reverse of Euclid's division algorithm compute: (a) Find integers x; y such that 24x + 15y = 3 (b) Find integers x; y such that 172x + 20y = 1000 (c) Find integers x; y such that 23x + 17y = 1
(1 point) Find the linearization of the function f(x,y) = 72 - 4x² – 2y at...

(1 point) Find the linearization of the function f(x,y) = 72 - 4x² – 2y at the point (3, 4). L(x,y) Use the linear approximation to estimate the value of f(2.9, 4.1) f(2.9, 4.1)

Write a recursive method in java to find GCD of two integers using Euclid's method. Integers...

Write a recursive method in java to find GCD of two integers using Euclid's method. Integers can be positive or negative. public class Recursion { public static void main(String[] args) { Recursion r = new Recursion(); System.out.println(“The GCD of 24 and 54 is “+r.findGCD(24,54)); //6 } public int findGCD(int num1, int num2){ return -1; } }
Divisibility: Problem 5 Previous Problem Problem List Next Problem (1 point) Compute: ged(48,57) = Find a...

Divisibility: Problem 5 Previous Problem Problem List Next Problem (1 point) Compute: ged(48,57) = Find a pair of integers 3 and y such that 48x + 57y = ged(48, 57) (x, y) =( , ) Note: You can earn partial credit on this problem.
(Recursive Greatest Common Divisor) The greatest common divisor of integers x and y is the largest...

(Recursive Greatest Common Divisor) The greatest common divisor of integers x and y is the largest integer that evenly divides both x and y. Write a recursive function gcd that returns the greatest common divisor of x and y. The gcd of x and y is defined recursively as follows: If y is equal to 0, then gcd(x, y) is x; otherwise gcd(x, y) is gcd(y, x % y), where % is the remainder operator. c programming need the whole...

Consider the following C codes to compute the gcd of two integers. /// code 1 #include...

Consider the following C codes to compute the gcd of two integers. /// code 1 #include <stdio.h> int gcd(int a, int b) { while (a != b) { if (a > b) a = a - b; else b = b - a; } return a; } /// code 2 #include <stdio.h> int getint() { int i; scanf("%d", &i); return i; } void putint(int i) { printf("%d\n", i); } int main()...
PROBLEM 1 For each of the following pairs of integers, use the Euclidean Algorithm to find...

PROBLEM 1 For each of the following pairs of integers, use the Euclidean Algorithm to find ged(a,b), and to write gcd(a,b) as a linear combination of a and b, i.e. find integers m and n such that gcd(a,b) = am + bn. (a) a = 36, b = 60. (b) a = 12628, b = 21361. (c) a = 901, b = -935. (d) a = 72, b = 714. (e) a = -36, b = -60.
1. (10 points) GCD Algorithm The greatest common divisor of two integers a and b where...

1. (10 points) GCD Algorithm The greatest common divisor of two integers a and b where a 2 b is equal to the greatest common divisor of b and (a mod b). Write a program that implements this algorithm to find the GCD of two integers. Assume that both integers are positive. Follow this algorithm: 1. Call the two integers large and small. 2. If small is equal to 0: stop: large is the GCD. 3. Else, divide large by...

C1= 5 C2= 6 C3= 10 GCD --> Greater Common Divisor B1 a. Let x :=...

C1= 5 C2= 6 C3= 10 GCD --> Greater Common Divisor B1 a. Let x := 3C1 + 1 and let y := 5C2 + 1. Use the Euclidean algorithm to determine the GCD (x, y), and we denote this integer by g. b. Reverse the steps in this algorithm to find integers a and b with ax + by = g. c. Use this to find the inverse of x modulo y. If the inverse doesn't exist why not?...