Ananth packs 304 marbles in packets of 9 or 11 so that no marble is left. He wants to maximize the number of bags with 9 marbles. How many bags does he need if there should be at least one bag with 11 marbles? . 24
Answers
Answered by
9
⏩⏩ hey buddy here is ur answer..⏪⏪
[huge]\red,,
let x is number of bag contains 11 marbles, and y is number of bag contains 9 marbles.
we find that (x+y) value ,, maximize the number of bags with 9 marbles . it means y is maximize..
11x+9y=304
y=(304-11x)/9
y is maximum .. when x is less value and also (304-11x ) is divisible by 9
so we choose minimum x value is 8. ( here we choose 8 becoz when i put x value is 1, 2,3,4,5,6,7 that case (304 - 11*x) is not divisible by 9.. )
when y= (304 - 8 *11)/9
y=24
so total bag is x+y =8+24 =32
✔✔hope it helps u✅✅
[huge]\red,,
let x is number of bag contains 11 marbles, and y is number of bag contains 9 marbles.
we find that (x+y) value ,, maximize the number of bags with 9 marbles . it means y is maximize..
11x+9y=304
y=(304-11x)/9
y is maximum .. when x is less value and also (304-11x ) is divisible by 9
so we choose minimum x value is 8. ( here we choose 8 becoz when i put x value is 1, 2,3,4,5,6,7 that case (304 - 11*x) is not divisible by 9.. )
when y= (304 - 8 *11)/9
y=24
so total bag is x+y =8+24 =32
✔✔hope it helps u✅✅
Answered by
0
Answer:
zajjah
is sn
Step-by-step explanation:
Similar questions