What is the largest positive integer n such that 1457 and 368 leave the same remainder when divided by n?

Badada Apr 16, 2019

#1**+1 **

n=1; a=(1457 % n);b=(368%n);if(a==b, goto4,goto5);printa,b,n; n++; if(n<2000, goto1, discard=0;

Rem n

0 0 1

2 2 3

8 8 9

5 5 11

5 5 33

71 71 99

5 5 121

5 5 363

**368 368 1089**

**So, the largest n =1,089 with the remainder of 368.**

Guest Apr 16, 2019

#3**+1 **

YES, You can in "Modular Math"!!. It is perfectly valid! See here: **https://www.wolframalpha.com/input/?i=368+mod+1089**

Guest Apr 16, 2019

edited by
Guest
Apr 16, 2019

edited by Guest Apr 16, 2019

edited by Guest Apr 16, 2019