Applied Cryptography.

1. mod mod Let p, N be integers with pl. Prove that for any integer x, llxmodN] mod p] = Xmod that, in contrast, [[Xmodp] mod N] need not equal [XmodN Show