discrete math
 👍 0
 👎 0
 👁 79
Respond to this Question
Similar Questions

discrete math
If a and b are positive integers, prove that: ab = gcd(a,b)*lcm(a,b). Can visualize this being true and easily create examples just don't know how to prove algebraically. well the gcd of any two number can be found by multiplying
asked by Rom on March 8, 2007 
college math question
Find the GCD of 24 and 49 in the integers of Q[sqrt(3)], assuming that the GCD is defined. (Note: you need not decompose 24 or 49 into primes in Q[sqrt(3)]. Please teach me . Thank you very much. The only integer divisor of both
asked by student on November 16, 2006 
Math
This is a problem concerning GCD. I need to prove gcd(a,b) = gcd(a,b+a). I always get like like halfway then hit a roadblock (e.g. i can prove gcd(a,b) = gcd(a,b+a).
asked by George on October 4, 2009 
math
(a). Is it true that for all set of positive integers a, b, c. gcd(a,c) + gcd(b,c) = gcd(a + b,c). Explain (b) Is it true that there exist a set of positive integers a,b,c, such that gcd(a,c) + gcd(b,c) = gcd(a + b,c). Explain
asked by excel on February 7, 2014 
pseudo code and flow charts
how can write a pseudo code and a flow charts to solve these? 1 to find the greatest common divisor out of two positive integers. 2 to find the smallest common factor out of two positive intrgers. Write the flow of thinking just
asked by ravindu on June 8, 2007 
Discrete math
(a) Use the Euclidean Algorithm to nd gcd (2017; 271) and use this to nd integers x and y so that gcd(2017; 271) = 2017x + 271y. (b) Is it true that for all integers a and b, if not both a and b are zeros then not both
asked by Mariaaaaaaa on January 29, 2017 
discrete math
Let f:ℤ+ → ℤ+ be the function defined by: for each x ∈ ℤ+, f(x) is the number of positive divisors of x.  find integers m, n, nd k so tha f(m)=3, f(n) = 4 anf f(k) = 5 is f oneto one? Explain, is f unto? prove is it
asked by excel on March 20, 2014 
math help please
Let f:ℤ+ → ℤ+ be the function defined by: for each x ∈ ℤ+, f(x) is the number of positive divisors of x.  find integers m, n, and k so tha f(m)=3, f(n) = 4 anf f(k) = 5 is f oneto one? Explain, is f unto? prove is it
asked by excel on March 21, 2014 
math
Let f:ℤ+ → ℤ+ be the function defined by: for each x ∈ ℤ+, f(x) is the number of positive divisors of x.  find integers m, n, nd k so tha f(m)=3, f(n) = 4 anf f(k) = 5 is f oneto one? Explain, is f unto? prove is it
asked by excel on March 20, 2014 
math!
GCD (24,20)IS 4. sINCE gcd (4,12) IS 4, THEN gcd (24,20,12) is 4. use this approach and the euclidean algorithim to find the GCD ( 722, 2413,209) WHAT IS THE gcd?
asked by BECKY! on November 19, 2014