SOLUTION: Let N = abcabc and M = defdef, where a,b,c,d,e,f ∈ {0,1,...,9} are distinct digits and a,d > 0. Determine all solutions to N = 9*M/64.

Algebra ->  Permutations -> SOLUTION: Let N = abcabc and M = defdef, where a,b,c,d,e,f ∈ {0,1,...,9} are distinct digits and a,d > 0. Determine all solutions to N = 9*M/64.      Log On


   



Question 1162657: Let N = abcabc and M = defdef, where a,b,c,d,e,f ∈ {0,1,...,9} are distinct digits and a,d > 0. Determine all solutions to N = 9*M/64.
Answer by ikleyn(52781) About Me  (Show Source):
You can put this solution on YOUR website!
.

As I understand the problem, it asks to find all INTEGER solutions.


Notice that any number of the form  abcabc is  this product  1001*abc,  and 1001 is  7*11*13.


So, in order for  %289%2AM%29%2F64  be an integer, where  M = defdef = 1001*def = 7*11*13*def, the number def must be multiple of 64.


From this  HINT, complete the solution on your own.