Greatest common divisor (GCD) - high school - practice problems
Number of problems found: 9
- Determine 8611
Determine all natural numbers A and B pairs for which the sum of twice the least common multiple and three times the greatest common divisor of natural numbers A and B is equal to their product. - Two gears
The gearbox will use a large gear to turn a smaller gear. The large gear will make 75 revolutions per minute, while the smaller gear must make 384 revolutions per minute. Find the smallest number of teeth each gear could have. [Hint: Use either GCF or LCM - Children's 6140
The store received a total of 666 pairs of children's, men's and women's shoes. Men were 2.5 times less than children, while children were 1.4 times more than women. Express in whole numbers the ratio of the number of pairs of children's, men's, and women - Measured 4046
Peter cut the two bars into equal parts but made them as large as possible. One rod measured 42 cm, the other 63 cm. How many cuts did he have to make? - Infinitely 3818
We have 2 numbers. If we multiplied the first number's third root by the second number's square root, we would get the number 18. Determine these 2 numbers. Calculate only the integer solution if the problem has infinitely many solutions in the set of rea - Segments
Line segments 69 cm and 3.7 dm long we divide into equal parts which lengths in centimeters is expressed integer. How many ways can we divide? - Diofant 2
Is equation 70x +52y = 34 solvable on the set of integers Z? - Diofant equation
In the set of integers (Z), solve the equation: 212x +316y =0 Write result with integer parameter t in Z (parameter t = ...-2,-1,0,1,2,3... if equation has infinitely many solutions) - Seedcake
Seedcake costs 44 cents. How many minimum seedcakes must we buy that we can pay in cash, only whole euros?
We apologize, but in this category are not a lot of examples.
Do you have homework that you need help solving? Ask a question, and we will try to solve it.
Do you have homework that you need help solving? Ask a question, and we will try to solve it.