Suppose n is a positive integer and there exists a primitive root modulo n. Prove that the only solutions to x^2 ? 1 (mod n) are x ? 1 (mod n) and x ? ?1 (mod n)
Review the information in the Learning Resources (including the Media) for this week dealing with how to perform a process flow analysis.
August 4, 20171. Assume that the company uses absorption costing. Compute the unit product cost for one gamelan.
August 4, 2017Suppose n is a positive integer and there exists a primitive root modulo n. Prove that the only solutions to x^2 ? 1 (mod n) are x ? 1 (mod n) and x ? ?1 (mod n)
1. For every positive integer b, show that there exists a positive integer n such that the polynomial x^2 ? 1 ? (Z/nZ)[x] has at least b roots.
2. Suppose n is a positive integer and there exists a primitive root modulo n. Prove that the only solutions to x^2 ? 1 (mod n) are x ? 1 (mod n) and x ? ?1 (mod n)
