Results 1 to 2 of 2

- May 28th 2008, 12:24 PM #1

- Joined
- May 2008
- Posts
- 13

## abmod(2^n) == abdiv(2^n) if 2^n + 1 ??

Hi,

I am stuck with the following problem:

What is the result of (ab mod (2^n + 1)), if (ab mod (2^n)) = (ab div (2^n))? Is this case possible if a and b were whole numbers in the range of {1,2,...,2^n} and 2^n +1 was a prime number? Can you please explain the answer just a little bit?

2^n denotes 2 raised to the power of n.

ab div n means the quotient when ab is divided by n.

Thanks a lot in advance.

- May 28th 2008, 03:25 PM #2