Question
need help with Discrete Math.

answer all parts please write clear! i will rate fast

Use the Extended Euclidean Algorithm to find: the greatest common divisor of 180 and 73. integers m and n such that 180m + 73
0 0
Add a comment Improve this question Transcribed image text
Answer #1

d 73, 34)e/ Dete: 73二3yx2ナ 1 n ue Know ナ. 73 Si hope you enjoy.....thankyou friend

Add a comment
Know the answer?
Add Answer to:
need help with Discrete Math. answer all parts please write clear! i will rate fast Use...
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. Our experts will answer your question WITHIN MINUTES for Free.
Similar Homework Help Questions
  • Use R language to program Problem 1: Greatest Common Divisor (GCD) Please write two functions, g...

    Use R language to program Problem 1: Greatest Common Divisor (GCD) Please write two functions, g edi ) and gcdr , which both take two integers a, b and calculates their greatest common divisor (GCD) using the Euclidean algorithm gcdi () should do so using iteration while gcdr () should use recursion. Then write a third function, gcd(), which takes two integers a, band an optional third argument nethod which takes a charater string containing either "iterative" or "recursive", with...

  • answer all parts please 1. (12 points) Prove that if n is an integer, then na...

    answer all parts please 1. (12 points) Prove that if n is an integer, then na +n + 1 is odd. 2. (12 points) Prove that if a, b, c are integers, c divides a +b, and ged(a,b) -1, then god (ac) - 1. 3. (a) (6 points) Use the Euclidean Algorithm to find ged(270, 105). Be sure to show all the steps of the Euclidean algorithm and, once you have finished the Euclidean Algorithm, to finish the problem by...

  • need help with discrete math HW, please write solutions clearly, and please don't give random answer...

    need help with discrete math HW, please write solutions clearly, and please don't give random answer if you're not sure cus then i will need to post the same question twice. i appreciate every help i can get but please let someone else help me solve the question if you're not sure about any part to avoid reposting. thanks, will rate best answer. Let G be the set of 4 x 4 invertible real matrices and let - be matrix...

  • In Assembly Language Please display results and write assembler code in (gcd.s) The Euclidean algorithm is...

    In Assembly Language Please display results and write assembler code in (gcd.s) 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...

  • LANGUAGE C++ I need help with all 3 questions. Thank you in advance Password Generator← 10...

    LANGUAGE C++ I need help with all 3 questions. Thank you in advance Password Generator← 10 10.201.51. eRAD D scheduling山UitPro 6 Fizz Buzz Write a function "void FizzBuzz(int n)" that lists all of the numbers from 1 to n, but replace all numbers divisible by 3 but not divizible by 5 with the word "Fizz", replace all numbers divisible by 5 but not divisible by 3 with the word "Buzz", and replace all numbers divisible by both 3 and 5...

  • I need help with my discrete math problem. can you show me step by step process...

    I need help with my discrete math problem. can you show me step by step process . Thanks in advance 3. Give a big-O estimate and a pair of witnesses for the number additions used in this segment of an algorithm. t:= 0 for i:=1 ton for j := 1 to n-i t:=t+i+j

  • Please help me solve these discrete math problems. Please show work so that i may follow...

    Please help me solve these discrete math problems. Please show work so that i may follow and understand. Problem 4. Let r, y be nonzero integers and let n be a positive integer. Prove the following by induction Hint: Consider problem (1d) where r = . y

  • Discrete math for computing please show clear work 6 numbers and test whether magnitude, giving an...

    Discrete math for computing please show clear work 6 numbers and test whether magnitude, giving an Write an algorithm to input a list of numbers and the numbers are in increasing order of magnitude appropriate message as output. The algorithm shoul designed so that testing stops as soon as the answer isk Modify the algorithm in Example 1.3.1 so that it gives + output when n=0 is input. latae a number line so that it gives the correct Example 1.3.1...

  • please help with discrete math HW. please write clearly and dont make up an answer.............i will...

    please help with discrete math HW. please write clearly and dont make up an answer.............i will rate for the best answer thank you. will appreciate if you can answer all 5 parts. (L,) complete lattice and f L >L an order-preserving function (i) Let a, bE L with a b. Define a, b]= {z € L | a b} Show that (a, b], 3) is a complete lattice (ii) Consider X = {x € L \ f(x) = x}. The...

  • Discrete Math: Please help with all parts of question 5. I have included problem 3 to...

    Discrete Math: Please help with all parts of question 5. I have included problem 3 to help answer part (a) but I only need help with question 5! 5. 3. (a) (4 points) Prove that a graph is bipartite if and only if there is a 2-coloring (see problem 3) of its vertices. (b) (4 points) Prove that if a graph is a tree with at least two vertices, then there is a 2-coloring of its vertices. (Hint: Here are...

ADVERTISEMENT
Free Homework Help App
Download From Google Play
Scan Your Homework
to Get Instant Free Answers
Need Online Homework Help?
Ask a Question
Get Answers For Free
Most questions answered within 3 hours.
ADVERTISEMENT
ADVERTISEMENT
ADVERTISEMENT