help required with modulo arithmatic please

[procyon]

Hi,

It's years since I was at school and I haven't used modulo arithmetic since then. I now find I need to refresh my memory on it. I think I'm right with this assumption

if \(\displaystyle x=4\ mod\ 10\) then it can be written \(\displaystyle x=10m+4\) where m is an integer \(\displaystyle \ge\ 0\)

Is there any deduction I can make about \(\displaystyle x\ mod\ 16\) ?

Thanks for any help

 

[tkhunny]

Why does m have to be non-negative?

 

[procyon]

Why does m have to be non-negative?

In the problem I am working on, \(\displaystyle x>0\) or in the particular example given, \(\displaystyle x\ge4\)

 

[procyon]

The intersection of the two sets is infinite without more constraints than you have specified. I suspect that if you refine your question, you will see your answer.

Thanks JeffM,

Unfortunately x is not unique and both constraints apply, so I guess I'll have to do some more number crunching.

Thanks again

Pro