Math Problem Statement

A milkman has milk of three varieties. He has 403L, 465L & 651L of the three varieties of milk with him.

  1. What is the largest size of bottle in which he can bottle each of the three types of milk completely without mixing the milk?
  2. What is the minimum number of bottles required?
  3. How many different sizes of bottles (with the integral number of litres) can be used in order to bottle all three varieties of milk? (write comma-separated integers with spaces, eg: x, y, z) ( Sapient hiring drive 2018)

Solution

Ask a new question for Free

By Image

Drop file here or Click Here to upload

Math Problem Analysis

Mathematical Concepts

Number Theory
Greatest Common Divisor (GCD)
Divisors

Formulas

GCD formula for three numbers
Division to calculate minimum number of bottles

Theorems

Euclidean algorithm for GCD

Suitable Grade Level

Grades 8-10