1. Forum
  2. Usenet
  3. SCI.CRYPT.RANDOM-NUMBERS

  • Simple math question

    From Richard Outerbridge@21:1/5 to All on Sat May 13 13:14:31 2017
    Is there an algebraic simplification of x = ( y mod a ) mod b,
    with y given, a an odd prime, and a co-prime to b?

    Thanks!
    __outer

    /ps karl.frank: it's been exposed for public ridicule, yes.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Richard Outerbridge@21:1/5 to Richard Outerbridge on Sun May 14 08:03:02 2017
    On 2017-05-13 17:14:31 +0000, Richard Outerbridge said:

    Is there an algebraic simplification of x = ( y mod a ) mod b,
    with y given, a an odd prime, and a co-prime to b?

    I know, bad form. Perhaps the simplest form might be:

    x = ( y mod 3 ) mod 2

    ?
    __outer

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)