discrete math
 👍 0
 👎 0
 👁 87
Respond to this Question
Similar Questions

Math
Let a, b, and m be integers, and m ≥ 2. Prove that: ab ≡ [ (a mod m) · (b mod m) ] (mod m). So I tried proof by cases: Assume ab ≡ [(a mod m) ∙ (b mod m)] mod m is true. Then ab mod m = [(a mod m) ∙ (b mod m)] mod m,
asked by Kid on November 9, 2018 
Math
Which Statements of congruence are true and which are false and why? 177 _= 17 (mod 8) 871 _= 713 (mod 29) 1322 _= 5294 (mod 12) 5141 _= 8353 (mod 11) 13944 _= 8919 (mod 13) 67 x 73 _= 1 x 3 (mod 5) 17 x 18 x 19 x 20 _= 4! (mod 8)
asked by Jimmy on October 29, 2012 
math
Which Statements of congruence are true and which are false and why? 177 _= 17 (mod 8) 871 _= 713 (mod 29) 1322 _= 5294 (mod 12) 5141 _= 8353 (mod 11) 13944 _= 8919 (mod 13) 67 x 73 _= 1 x 3 (mod 5) 17 x 18 x 19 x 20 _= 4! (mod 8)
asked by Jimmy on October 24, 2012 
Math
Which Statements of congruence are true and which are false and why? 177 _= 17 (mod 8) 871 _= 713 (mod 29) 1322 _= 5294 (mod 12) 5141 _= 8353 (mod 11) 13944 _= 8919 (mod 13) 67 x 73 _= 1 x 3 (mod 5) 17 x 18 x 19 x 20 _= 4! (mod 8)
asked by Jimmy on October 22, 2012 
Math (Proof)
Prove that if ab = ac (mod n) and a is relatively prime to n, then b = c (mod n). Proof: a and n are relatively prime and from ab = ac(mod n), we have n(abac), so na(bc). Since (a,n)=1 (relatively prime), we get n(bc). hence
asked by Michael on February 14, 2013 
Math
Prove that a^3 ≡ a (mod 3) for every positive integer a. What I did: Assume a^3 ≡ a (mod 3) is true for every positive integer a. Then 3a^3 ≡ 3a (mod 3). (3a^3  3a)/3 = k, where k is an integer a^3  a = k Therefore, a^3
asked by Kid on November 14, 2018 
math
Which two is true as i'm confused A) 3+7 ß 10 mod 15 17 + 9 ß 4 mod 21 12 + 14 ß 0 mod 26 B) 4+11 ß 2 mod 13 9+7 ß 4 mod 12 13 + 13 ß 1 mod 25 C) 5+9 ß 4 mod 10 16 + 13 ß 3 mod 26 12 + 7 ß 6 mod 14 d)2+7
asked by Mctagger on June 14, 2011 
Discrete Math
Let a, b, c, and d be integers, and let n be a positive integer. Prove that if a is congruent to c mod n and b is congruent to d mod n, then (ab) is congruent to (cd) mod n
asked by Samantha on December 4, 2010 
Proofs and numbers
Prove the following theorem: Suppose p is a prime number, r, s are positive integers and x is an arbitrary integer. Then we have x^r identical to x^s (mod p) whenever r is identical to s (mod 11).for x belongs to an integer
asked by yin on November 28, 2012 
@Peter, earlier question
Peter, I found your question interesting and have been messing with it for a while www.jiskha.com/questions/1789041/Ethelwenttothefarmersmarkettobuysomeeggsnotinadozencartonsonthe I finally made up a short computer
asked by Reiny on March 19, 2019