Let a and b be positive integers.
* use the euclidean algorithm to compute the following greatest common divisor: gcd(139024789,93278890)
* then, use the extended euclidean algorithm to find integers u and v such that au + bv = gcd(a, b) for the same gcd(a, b) values as above.
* finally, suppose that there are integers u and v satisfying au + bv = 6. is it necessarily true that gcd(a, b) = 6? if not, give a specific counterexample, and describe in general all of the possible values of gcd(a, b).

109 trust me

step-by-step explanation:

it can be to see completed examples before writing, in order to examine what makes for an effective piece. see how these intros give some context before posing the topic and lead naturally into the body paragraphs, where the evidence will be listed. you can imagine how the author has organized the rest of the piece.

"we buried my cousin last summer. he was 32 when he hanged himself from a closet coat rack in the throes of alcoholism, the fourth of my blood relatives to die prematurely from this deadly disease. if america issued drinking licenses, those four men—including my father, who died at 54 of liver failure—might be alive today. that is a good example piece   some steps that are .

. writing something that happened to you

.read a book you like to get ideas from there

. lastly you can make a venn diagram

hope this plz make brainliest

step-by-step explanation: