Question

Greatest common divisors: 20 and 240 240 and 240 72 and 128 and decompose number 210...

Greatest common divisors:
20 and 240
240 and 240
72 and 128

and decompose number 210 into prime numbers.
Engineering   Computer-Science   
0 0
Add a commentTranscribed image text
Next >

Homework Answers

Answer #1

For finding GCD one of the simplest method is first you should check if one no. divides the other completely if so then the smaller no. is the GCD. If not then find factors of the two no. and take common part and multiply them.

a) 20 & 240:- Since 20 completely divides 240 so 20 is GCD.

b) 240 & 240:- Since 240 will completely divide 240 so 240 is GCD.

c) 72 & 128:- Here 72 does not divide 128 completely, so we need to factor them.

72 = 2 * 2* 2 * 3 * 3

128 = 2 * 2 * 2 * 2 * 2 * 2 * 2

The common part is highlighted. So the GCD will be = 2 * 2 * 2 = 8.

d) The next question is decomposing 210 into prime numbers.

210 = 2 * 3 * 5 * 7

Hope this helps. If you have any queries or suggestions regarding the answers please leave them in the comments section so I can update and improve the answer. Thank

0 0
Know the answer?
Your Answer:

Post as a guest

Your Name:

What's your source?

Earn Coins

Coins can be redeemed for fabulous gifts.

Log In

Sign Up

Not the answer you're looking for?
Ask your own homework help question
Similar Questions
Recall that ν(n) is the divisor function: it gives the number of positive divisors of n....
Recall that ν(n) is the divisor function: it gives the number of positive divisors of n. Prove that ν(n) is a prime number if and only if n = pq-1 , where p and q are prime numbers.
Two numbers are relatively prime if their greatest common divisor is 1. Show that if a...
Two numbers are relatively prime if their greatest common divisor is 1. Show that if a and b are relatively prime, then there exist integers m and n such that am+bn = 1. (proof by induction preferred)
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...
C++ Program to find Greatest common Factor (GCF) and Least Common Multiple (LCM) of a number...
C++ Program to find Greatest common Factor (GCF) and Least Common Multiple (LCM) of a number c++
The greatest common divisor c, of a and b, denoted as c = gcd(a, b), is...
The greatest common divisor c, of a and b, denoted as c = gcd(a, b), is the largest number that divides both a and b. One way to write c is as a linear combination of a and b. Then c is the smallest natural number such that c = ax+by for x, y ∈ N. We say that a and b are relatively prime iff gcd(a, b) = 1. Prove that a and n are relatively prime if and...
An investigator polls common cold sufferers asking them to estimate the number of hours of physical...
An investigator polls common cold sufferers asking them to estimate the number of hours of physical discomfort caused by their most recent colds. Assume that their estimates approximate a normal curve with a mean of 83 hours and a standard deviation of 20 hours. what proportion of the original survey suffered for exactly 61 hours? what proportion suffered for fewer than 61 hours? what us the estimated number of hours suffered by the extreme 1 percent either above or below...
Number of years= 20 Number of months=240 Annual Percentage Rate=8.00% Monthly interest rate=0.67% Loan amount=$441,747 Fixed...
Number of years= 20 Number of months=240 Annual Percentage Rate=8.00% Monthly interest rate=0.67% Loan amount=$441,747 Fixed monthly repayment amount=$ 3,694.95 1. The borrower actually had to pay $250 more each month due to hidden fees and charges. Calculate the implied nominal interest rate compounded monthly, the borrower is actually charged on the loan taking into account these charges 2. Total amount of interest paid in the 3rd year? 3. The total principle paid in the 4th year? 4. The amount...
Whispering Ltd. began its latest fiscal year on January 1, 2020, with 12,000 common shares outstanding....
Whispering Ltd. began its latest fiscal year on January 1, 2020, with 12,000 common shares outstanding. On April 1, Whispering sold 1,200 additional common shares. The company declared and issued a 20% stock dividend on June 1. On July 1, Whispering repurchased and cancelled 210 common shares. An additional 3,750 common shares were issued on September 1. On November 1, Whispering declared and issued a 2-for-one stock split. On December 1, Whispering issued an additional 100 shares. Following the fiscal...
Larkspur Ltd. began its latest fiscal year on January 1, 2020, with 12,000 common shares outstanding....
Larkspur Ltd. began its latest fiscal year on January 1, 2020, with 12,000 common shares outstanding. On April 1, Larkspur sold 1,200 additional common shares. The company declared and issued a 20% stock dividend on June 1. On July 1, Larkspur repurchased and cancelled 210 common shares. An additional 3,750 common shares were issued on September 1. On November 1, Larkspur declared and issued a 2-for-one stock split. On December 1, Larkspur issued an additional 100 shares. Following the fiscal...
Using 2017 tax law,indicate;The taxpayers correct and most favourable filling status.Their greatest number of personal and...
Using 2017 tax law,indicate;The taxpayers correct and most favourable filling status.Their greatest number of personal and dependent exemptions allowed for 2017.Whether the taxpayer is eligible to claim and receive the earned income tax credit. Remember each dependent must be qualifying child or qualifying relative,Numbers in parentheses indicate age.Unless otherwise stated,each prospective dependent is an unmarried US citizen who does not provide more than half their own support.In no case will more than one taxpayer attempt to claim the same qualifying...
ADVERTISEMENT
Need Online Homework Help?

Get Answers For Free
Most questions answered within 1 hours.

Ask a Question
ADVERTISEMENT