mfb said:
Let's consider the set of n*a+m*b mod (ab) for n=0 to b-1 and m=0 to a-1. We get (ab) different results ..
Fact 1. for n=0 to b-1 and m=0 to a-1 we get ab
diffrent results. Will it give us
different results?
Fact 2: For every n mod b where n<b there will be unique/different results.
Fact 3: for every n*a mod b*a where n<b then there will be unique results and some gaps. This will also work for n = b-1, so
Fact 4: for every (b-1)*a mod b*a there will be unique results and some gaps.
Fact 5: (b-1)*a + (a-1) * b might be more than ab, seems contradict fact 1. Will (a-1)*b fil the gaps?
5.1 Let's add (b-1)*a with sequences of m*b where m=0..a-1
Before that.
Sequence of (b-1)*a mod a is 0.
((b-1)*a + a*b) will give an overlap result.
because ((b-1)*a + a *b) mod a = 0.
and
((b-1)*a + a*b) mod ab = -a; ((b-1)*a) mod ab = -a
But (b-1)*a + (a-1)*b will not give an overlap result.
((b-1)*a + (a-1)*b) mod a = -b
((b-1)*a + (a-1)*b) mod ab = -a-b.
So, for ((b-1)*a + m*b) mod a where m = 1..a-1 there wouldn't be overlap result.
So the (a-1)*b gaps will be reduced by a-1. So there will be (a-1)*b-(a-1) = (a-1)*(b-1) gaps.
5.2 Do 5.1 again with (b-2) * a
Again ((b-2) * a + m*b) mod a wil produce the exact result as in 5.1
But there wouldn't be any conflict with ((b-2) * a + m*b) mod ab, because it's like shifting/decreasing all the filled number by a
So there will be (a-1)*(b-1)-(a-1) = (a-1)*(b-2) gaps.
5.3 Do 5.1 again until (b-b) * a
So there will be (a-1)*(b-b) gaps. = 0 gaps!
So here is the proof for
mfb said:
Let's consider the set of n*a+m*b mod (ab) for n=0 to b-1 and m=0 to a-1. We get (ab) different results ..
There are
ab different results.