Suppose that a, b \in \mathbb{Z}a, b∈Z, not both 00, and let d=\gcd(a, b)d=gcd(a, b). Bezout's theorem states that dd can be written as a linear combination of aa and bb, that is, there exist integers m, n \in \mathbb{Z}m, n∈Z such that d = am + bnd=am+bn. Prove that, on the other hand, any linear combination of aa and bb is divisible by dd. That is, suppose that t = ax + byt=ax+by for some integers x, y \in \mathbb{Z}x, y∈Z. Prove that d \, | \, td∣t.

Polygons efgh and e′f′g′h′ are shown on the coordinate grid: what set of transformations is performed on efgh to form e′f′g′h′? a. a translation 1 unit to the left followed by a 90-degree counterclockwise rotation about the origin b. a translation 1 unit to the right followed by a 90-degree counterclockwise rotation about the origin c. a 90-degree clockwise rotation about the origin followed by a translation 2 units to the right d. a 90-degree clockwise rotation about the origin followed by a translation 2 units to the left

Me! last question, and i'm stuck! write the algebraic expression that models the word phrase. the product of 2 divided by the number h and 8 more than the number k

Arestaurant chef made 1 1/2 jars of pasta sauce. each serving of pasta requires 1/2 of a jar of sauce. how many servings of pasta will the chef be able to prepare using the sauce?