Share
Explore BrainMass

Modular proofs

A. Let =2 +1 (2 (Power 2(power n))) Plus 1. Prove that P is a prime Dividing , then the smallest m such that P (2 -1) is m = 2 (hint use the
Division Algorithm and Binomial Theorem)

Please see attached.

Attachments

Solution Summary

There are a variety of proofs in this solution regarding modular arithmetic.

$2.19