+0  
 
0
49
3
avatar

For some integers a,b, a=b (mod x). Find x in terms of a and b.

It appears the answer is a-b, but I'm not sure how to prove it without modular arithmetic, which I don't really understand.

Is there a simple way to prove and explain this without mods?

Guest Dec 7, 2018
 #1
avatar+3213 
+1

What I'm seeing is that if you take the prime factors of (a-b) as a set

 

And take all length permutations of that set and then take the product of the elements in that permutation

 

All those values will be values of x such that a = b mod x

 

I don't know of any way to show this without using any modular arithmetic at all.

Rom  Dec 7, 2018
 #3
avatar
+1

I see, thanks anyways!

Guest Dec 7, 2018
 #2
avatar
0

[deleted]

Guest Dec 7, 2018
edited by Guest  Dec 7, 2018

9 Online Users

New Privacy Policy

We use cookies to personalise content and advertisements and to analyse access to our website. Furthermore, our partners for online advertising receive information about your use of our website.
For more information: our cookie policy and privacy policy.