gcd and existence
Do there exist two integers m, n such that: gcd(m,n)=$val8, mn=$val11 ?
Find gcd
Compute gcd($val9,$val10).
Find gcd-3
Compute gcd($val9,$val10,$val11).
Find gcd II
Compute gcd($val9,$val10).
gcd and lcm
Find the positive integer n such that: gcd(n,$val14)=$val12, lcm(n,$val14)=$val15.
gcd and lcm II
Find two positive integers m and n, other than $val6 and $val9, such that: gcd(m,n)=$val6, lcm(m,n)=$val9. You can enter the two integers in any order.
gcd and lcm III
Find two positive integers m and n, other than $val6 and $val9, such that: gcd(m,n)=$val6, lcm(m,n)=$val9. You can enter the two integers in any order.
gcd, lcm and product
Let m, n be two positive integers such that $val16=$val13, $val17=$val14. What is $val18 ?
gcd, lcm and sum
Find two positive integers m and n, such that: gcd(m,n) = $val8 , lcm(m,n) = $val12 , m + n = $val13 . You can enter the two integers in any order.
gcd and multiple
Let $val8, $val9 be two non-zero integers. What is the condition for pgcd($val8, $val9) $val19 pgcd($val16,$val17) ?
gcd and product
Find two positive integers m and n, such that: gcd(m,n) = $val8 , mn = $val11 . You can enter the two integers in any order.
gcd and sum
Find two positive integers m and n, such that: gcd(m,n) = $val8 , m + n = $val11 . You can enter the two integers in any order.
gcd, sum and product
Find two positive integers m and n, such that: gcd(m,n) = $val8 , m + n = $val12 , mn=$val11 . You can enter the two integers in any order.
Find lcm
Compute lcm($val9,$val10).
Find lcm-3
Compute lcm($val7,$val8,$val9).
lcm and product
Find two positive integers m and n, such that: lcm(m,n) = $val11 , mn = $val12 . You can enter the two integers in any order.
lcm and sum
Find two positive integers m and n, such that: lcm(m,n) = $val11 , m + n = $val12 . You can enter the two integers in any order.
lcm, sum and product
Find two positive integers m and n, such that: lcm(m,n) = $val12 , m + n = $val13 , mn=$val11 . You can enter the two integers in any order.