Loading [MathJax]/extensions/TeX/mathchoice.js
 
+0  
 
0
2014
3
avatar

When working modulo m, the notation a^-1 is used to denote the residue b for which , if any exists. For how many integers a satisfying 0 < a < 100 is it true that ?

Please hurry up guys!!

 Aug 28, 2018
edited by Guest  Aug 28, 2018

Best Answer 

 #1
avatar+26399 
+5

When working modulo m, the notation is used to denote the residue for which ,
if any exists.
For how many integers a satisfying is it true that ?

 

 

One Integer solution

 

laugh

 Aug 29, 2018
 #1
avatar+26399 
+5
Best Answer

When working modulo m, the notation is used to denote the residue for which ,
if any exists.
For how many integers a satisfying is it true that ?

 

 

One Integer solution

 

laugh

heureka Aug 29, 2018
 #2
avatar
+1

Er... I don't think that it is...

For one, it says integers

Second, my friend has seen this before and he says it's not 1

 Aug 29, 2018
 #3
avatar+2236 
+4

Solving it this way gives:

 

 

Well blimey! You’re right. (I’m surprised because Heureka can do mod problems while napping.)

 

GA

 Aug 30, 2018

2 Online Users

avatar