Find the smallest possible value of a whole number 'y' if it leaves a remainder of 3 when divided by 5,6 or 9.

We want to find such that

6 and 9 are not coprime, so we split the moduli according to and to get the system

If we take

we can see that

By the Chinese remainder theorem, we've found that any satisfying

will satisfy each congruence above, and that any solution of the form for any integer will work.

The smallest possible value of these occurs for , so that 3 is the least positive solution.

6.9

step-by-step explanation:

simple math really

6 1/2 times 0.6 = 3.9

but if you are just doing 6 and not 6 1/2 then the answer is 3.6

false

step-by-step explanation:

false : it can not go to 9 the highest that part can go is 7

here is your proof