Op 26-11-2021 om 10:22 schreef remy.au...@gmail.com
> a little aside
> have you ever seen from far or near something that looks like this arithmetic
> (n/2)%2=1 (1,0,0,0,0,0,0,0,0)
> (n/3*2)%3=1 (0,1,0,0,0,0,0,0,0)
> (n/5*4)%5=1 (0,0,1,0,0,0,0,0,0)
> (n/7*3)%7=1 (0,0,0,1,0,0,0,0,0)
Ok, so here you are showing a list of modular inverses of (n/f) modulo f.
Since n/f and f are coprime, it's guaranteed the inverse exists.
But can you explain why you are showing this.
> now if I want to do an addition for example 25+5
> I add 5 to all the modulo of 25
ok, the sum of the moduli is the modulus of the sum (a%n+b%n == (a+b)%n
(mod n)). That is what you are showing here I guess.
> and so I can do
'and so' is a big step (at least to me).
I am not sure how this is related to the lists above. I can remove the
25, and then I find that n1=x=x2=..=x8=whatever. I like the result, and
I am trying to understand why it is so. May take me a while.
I just tried with n=2*3*5, but then it doesn't seem to work.
> except that here I can do a little fun with the x's as I want
> x=5 ,x1=10,x2=20,x3=25....
> well on the other hand I don't see what it can be used for but in math we like useless stuff
> so I want a possible return or link on something that already exists
I don't know of any, but it is fun to play with.