#Determining the smalleest possible integers using Modulos

1 messages · Page 1 of 1 (latest)

young scaffoldBOT
#
  1. Wait patiently for a helper to come along.
  2. Once someone helps you, say thank you and close the thread with:
+close
  1. Feel free to nominate the person for helper of the week in #helper-nominations
  2. Do not ping the mods, unless someone is breaking the rules.
  3. If you're happy with the help you got here, and the server overall, you can contribute financially as well:
covert aurora
#

i dont know if im doing this right

#

i did 3a = 5 ( mod 11)

#

3a x 3 ^ -1 = 5 x 3 ^-1 ( Mod 11)

#

a = 5x 4 ( mod 11)

#

a = 9 ( mod 11)

#

where inverse of 3 modulo 11 is 4

amber mica
#

That is correct

#

I've checked 1 through 9

subtle wyvern
#

$5 \equiv 16 \equiv 27 ...$

waxen tulipBOT
#

!𒐪 ɹɐupoɯ⇂ㄥ8𝟝 𒐪!

636730392115675156.png
subtle wyvern
#

so you just increase 5 until you get something divisible by 3

covert aurora
#

+close