Make 'a' divisible by 'b'

[Mr. Desperate]

We are given two positive integers 'a' and 'b'. In one move you can increase 'a' by 1 or 2 or 5.
Find the minimum number of moves we need to make 'a' divisible by 'b'.

 

[Dr.Peterson]

Please follow our guidelines by telling us what you are learning, what you have tried, and what other thoughts you have.

Posting Guidelines (Summary)

Welcome to our tutoring boards! :) This page summarizes main points from our posting guidelines. As our name implies, we provide math help (primarily to students with homework). We do not generally post immediate answers or step-by-step solutions. We don't do your homework. We prefer to help...

www.freemathhelp.com

The context may be very important.

Unless you have learned something specific that you think is relevant, I would probably start by trying out some specific numbers. If nothing else, that would help me clarify what I think the problem means, which is by no means entirely clear. Showing us such examples, and your conclusions from them, would be one way to show work even if you have no idea how to actually solve the problem. (I myself don't.)

 

[Steven G]

Isn't the solution going to be dependent on the difference between a and b??