Math
 👍
 👎
 👁
Respond to this Question
Similar Questions

college math
what is the remainder when the sum 1^5+2^5+3^5+...99^5+100^5 is divided by 4? again a mod problem that I don't know how to work.

Math
Find all numbers $r$ for which the system of congruences: x == r mod 6 x == 9 mod 20 x == 4 mod 45 has a solution.

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

solving trig. equations
tan(3x) + 1 = sec(3x) Thanks, pretend 3x equals x so tanx + 1 = secx we know the law that 1 + tanx = secx so tanx + 1 becomes secx and... secx = secx sec(3x) = sec(3x) [just put 3x back in for x you don't really have to change 3x

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

probability
how do we find the least residue of 1789 (mod 4), (mod 10), (mod 101)

physics
mod of a cap  b cap = ¡Ì2 then calculate the value of mod of a cap + ¡Ì3b acp

math
FIND THE MODULO CLASS TO WHICH THE NUMBER BELONGS FOR THE GIVEN MODULO SYSTEM 53 mod 12

DISCRETE MATHS
Prove that if n is an odd positive integer, then 1 ≡ n2 (mod 4).

Business
Is OB Mod a form of manipulation? And if it is, is it unethical for managers to manipulate the behavior of employees?

Math
Prove that if gcd(m,n)=1 then m^phi(n)+n^phi(m)=congruent 1 (mod mn)

math
how do we find the least residue of 1789 (mod 4), (mod 10), (mod 101)
You can view more similar questions or ask a new question.