Jump to content

Talk:Codebusters

From Wiki - Scioly.org
Revision as of 20:13, 22 August 2017 by Raxu (talk | contribs) (Created page with "==Modular Arithmetic== Go Person! Wow the page was well made within days! The modular arithmetic is presented a little differently than usual: the [math]\equiv[/math] operato...")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Latest comment: 22 August 2017 by Raxu in topic Modular Arithmetic

Modular Arithmetic

Go Person! Wow the page was well made within days!

The modular arithmetic is presented a little differently than usual: the [math]\equiv[/math] operator is usually used, with statements like [math]29\equiv3\pmod{26}[/math]. This would not fit well in this context because of the definition [math]E(x)=ax+b\bmod{m}[/math].

The current version, however, runs into the trouble that [math] (12a+4b)\bmod{26}=92[/math] is an incorrect statement - the Modulo operation usually gives the smallest nonnegative value that is equivalent.

There is really no easy fix to this problem. The one I'm thinking of is to make a Code Busters/Modular Arithmetic page just for modular arithmetic, so we can go over both definitions and not make the page super long.

--Raxu (talk) 20:13, 22 August 2017 (UTC)Reply