We use cookies to personalise content and advertisements and to analyse access to our website. Furthermore, our partners for online advertising receive pseudonymised information about your use of our website. cookie policy and privacy policy.
 
+0  
 
+2
116
4
avatar+322 

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

 Apr 16, 2019
 #1
avatar
+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.

 Apr 16, 2019
 #2
avatar+322 
+1

Guest you cannot divide a number by a larger number to get an integer.

Badada  Apr 16, 2019
 #3
avatar
+1

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

 Apr 16, 2019
edited by Guest  Apr 16, 2019
edited by Guest  Apr 16, 2019
 #4
avatar+23041 
+2

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

 

see: https://web2.0calc.com/questions/a-nbsp-what-is-the-largest-positive-integer-n-such-that-1457-and-1754-leave-the-same-remainder-when-divided-by-n

 

laugh

 Apr 17, 2019

6 Online Users

avatar