Congruence, Mathematics

a) Let n = (abc)7. Prove that n ≡ a + b + c (mod 6).

b) Use congruences to show that 4|32n  - 1 for all integers n ≥ 0.

Posted Date: 3/23/2013 12:58:31 AM | Location : United States







Related Discussions:- Congruence, Assignment Help, Ask Question on Congruence, Get Answer, Expert's Help, Congruence Discussions

Write discussion on Congruence
Your posts are moderated
Related Questions

We contain a piece of cardboard i.e. 14 inches by 10 inches & we're going to cut out the corners as illustrates below and fold up the sides to form a box, also illustrated below. F

Explain the Graphical Technique of Linear Equations by using this figure.

Q. Show Inverse Trigonometric Functions? Ans. Many functions, including trig functions, are invertible. The inverse of trig functions are called ‘inverse trig functions'.

the 10 miles assigned to the chess club start at the 10 mile point and go to the 20 mile point when the chess club members have cleaned 5/8 of their 10 mile section between which m

Properties of the Indefinite Integral 1.  ∫ k f ( x ) dx = k ∫ f ( x ) dx where k refer for any number.  Thus, we can factor multiplicative constants out of indefinite integral




If the p th term of an AP is q and the q th term is p. P.T its n th term is (p+q-n). Ans:    APQ a p = q a q = p a n = ? a + (p-1) d = q a + (q-1) d = p