Suppose that p is a prime number ≥ 3 and r1, r2...rp is a complete residue system of modulo p. Prove that r1+r2+...+rp is divisible by p.
Suppose that p is a prime number. Show that 0, (p-1)!/2, (p-1)!/3, ..., (p-1)!/(p-1) is a complete residue system modulo p.
Suppose that p is a prime number ≥ 3. We can write 1 + 1/2 + 1/3 + 1/(p-1) = a/b with (a,b) =1. Prove that p divides a. Please see the attached file for the fully formatted problem.
Cartesian Products and Finite Sets and Algebra of Composition of Functions (10 Problems)
I'd like to know the deductive techniques to prove each. A short and correct proof for each is all that is required. OR please provide some help on how to solve them. Please see the attached file for the fully formatted problems.
Logic problem : P implies (Q implies R)
This problem is about the proof of Theorem 1 implies Theorem 2 as discussed in class. Regard Theorem 1 as a statement P and Theorem 2 as the statement "Q implies R". Then the statement "Theorem 1 implies Theorem 2" can be expressed as "P implies (Q implies R)". Theorem 2” is can be expressed as P implies (Q implies H)”. a) S ...continues
Proof by Induction : Cartesian Products and Finite Sets
Please see the attached file for the fully formatted problems.
Proofs : Algebra of Composition of Functions
Please see the attached file for the fully formatted problems.
Number Theory. 400 level. Introductory Course in Undergraduate.
Topics usually include the Euclidean algorithm, primes and unique factorization, congruences, Chinese Remainder Theorem, Hensel's Lemma, Diophantine equations, arithmetic in polynomial rings, primitive roots, quadratic reciprocity and quadratic fields. (See attached file for full problem description)
Number Theory. 400 level. Introductory Course in Undergraduate.
Topics usually include the Euclidean algorithm, primes and unique factorization, congruences, Chinese Remainder Theorem, Hensel's Lemma, Diophantine equations, arithmetic in polynomial rings, primitive roots, quadratic reciprocity and quadratic fields. (See attached file for full problem description)
Number Theory. 400 level. Introductory Course in Undergraduate.
Topics usually include the Euclidean algorithm, primes and unique factorization, congruences, Chinese Remainder Theorem, Hensel's Lemma, Diophantine equations, arithmetic in polynomial rings, primitive roots, quadratic reciprocity and quadratic fields. (See attached file for full problem description)
