answersLogoWhite

0

To find gcd o two numbers?

User Avatar

Wiki User

โˆ™ 2009-11-29 19:01:27

Best Answer

You should ask a question here, shouldn't you?

User Avatar

Wiki User

โˆ™ 2009-11-29 19:01:27
This answer is:
User Avatar
Study guides

Algebra

20 cards

A polynomial of degree zero is a constant term

The grouping method of factoring can still be used when only some of the terms share a common factor A True B False

The sum or difference of p and q is the of the x-term in the trinomial

A number a power of a variable or a product of the two is a monomial while a polynomial is the of monomials

โžก๏ธ
See all cards
3.74
โ˜†โ˜…โ˜†โ˜…โ˜†โ˜…โ˜†โ˜…โ˜†โ˜…
1201 Reviews

Add your answer:

Earn +20 pts
Q: To find gcd o two numbers?
Write your answer...
Submit
Still have questions?
magnify glass
imp
Related questions

Write a recursive algorithm to find the GCD of two numbers 5 Marks?

$ cat gcd.c#include int gcd_recursive(int a, int b){if (b == 0)return a;return gcd_recursive(b, a % b);}int main(){printf("GCD of 10 and 25: %d\n", gcd_recursive(10, 25));return 0;}$ gcc gcd.c -o gcd$ ./gcdGCD of 10 and 25: 5


What are the two least common multiple o 60?

You need at least two numbers to find a GCF.


What is the least common multiple of o?

You need at least two numbers to find an LCM.


How do you get by adding five odd numbers to get fourteen?

You cannot. The sum of any two odd numbers is even (O+O=E), the sum of any two even numbers is even (E+E=E) and the sum of an odd and an even (or even and odd) is odd (O+E=E+O=O). O+O+O+O+O = O+O+O+O+O = E + E +O = E +O = O Addition is commutative, that is, the order in which you add the numbers does not matter. Some trial and error will demonstrate commutativity, though a proof is more complicated.


What 2 numbers have a sum of 21 and a difference of 5?

The two numbers are 13 and 8


A c program to display gcd of two numbers?

$ cat gcd.c#include int gcd_recursive(int a, int b){if (b == 0)return a;return gcd_recursive(b, a % b);}int gcd_nonrecursive(int a, int b){int t;while (b != 0) {t = b;b = a % b;a = t;}return a;}int main(){printf("GCD of 10 and 25: %d\n", gcd_recursive(10, 25));printf("GCD of 10 and 25: %d\n", gcd_nonrecursive(10, 25));return 0;}$ gcc gcd.c -o gcd$ ./gcdGCD of 10 and 25: 5GCD of 10 and 25: 5


The sum of two numbers are 102 and its quotient is o.888888888?

54 and 48


Find the distance between o and -3?

Take the absolute value of the difference between the two numbers. The difference between two numbers a and b is a-b or b-a. The absolute value is whichever one of these is not negative. So 0 - (-3) = +3 so the distance is 3 units.


Which is greater 1500mL or 1.5L?

The two numbers, 1,500 mL and 1.5 L are the same amount, (=)........... :o


Write a flowchart to find the sum of maximum and minimum o N natural numbers without using arrays?

huh?


What is the oxidation number for CdOH2?

In Cd(OH)2 the oxidation numbers are Cd +2, O -2, H +1. Overall these add up to zero--remember there are two O s and two H's


What pair of numbers represents a point in the coordinate plane?

o ,o

People also asked