Modular Arithmetic 3

Modular Arithmetic 3 - Problem # 4 In multiplication...

Info iconThis preview shows pages 1–2. Sign up to view the full content.

View Full Document Right Arrow Icon
Problem # 4 In multiplication tables, the last row is always a reverse of the first row. Since N - 1 is always a coprime with N, then according to Problem #5, the last row must be a permutation of the first one. It's a very specific permutation. The number a m in column m staisfies a m = m·(N - 1) (mod N). But we have m·(N - 1) = -m = N - m (mod N) which exactly means that the last row is the reverse of the first. Problem # 5 In multiplication tables modulo N, rows corresponding to numbers coprime with N contain permutations of the first row. Let m be coprime to N. Let a and b be two different remainders of division by N. Then ma = mb (mod N) would imply m(a - b) = 0 (mod N) which, in turn, leads to (a - b) = 0 (mod N). Assuming b < a, we have a positive number less than N divisible by N. Contradiction. Hence a = b. Problem # 6 For prime (N + 1), multiplication tables offer multiple and simultaneous solutions to the rook problem: on an N×N board position N rooks so that none may capture another. To solve, select
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Image of page 2
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 12/11/2010 for the course MATH 311 taught by Professor Coluos during the Spring '10 term at UNMSM.

Page1 / 2

Modular Arithmetic 3 - Problem # 4 In multiplication...

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online