You are not logged in.
Pages: 1
Using the numbers 5,6,7,8,9, each once, make a 3 digit number and a 2 digit number that gives a quotient with no remainder. Find 2 pairs, one that gives the biggest quotient and one that gives the lowest quotient.
Is there a analytical way of solving this, or is it just trial and error.
Offline
Hi 1a2b3c2212;
Find 2 pairs, one that gives the biggest quotient and one that gives the lowest quotient.
To make the biggest quotient you make the biggest possible 3 digit and the smallest possible 2 digit number.
987 / 56
To make the lowest quotient make the smallest 3 digit number and the largest 2 digit number.
567 / 98
Using the numbers 5,6,7,8,9, each once, make a 3 digit number and a 2 digit number that gives a quotient with no remainder.
This part looks like trial and error. I can find no solutions.
In mathematics, you don't understand things. You just get used to them.
If it ain't broke, fix it until it is.
Always satisfy the Prime Directive of getting the right answer above all else.
Offline
hi 1a2b3c2212
I did trial and error and got no solutions either.
A few possibilities can be immediately eliminated because of prime factor type rules and the rest by slog through the alternatives.
Bob
Children are not defined by school ...........The Fonz
You cannot teach a man anything; you can only help him find it within himself..........Galileo Galilei
Sometimes I deliberately make mistakes, just to test you! …………….Bob
Offline
Pages: 1