0
Add your answer:
Earn +20 pts
Evaluate 6-6-5 in the mod 12 system?
-5
What is 3 plus 4 plus 1 in the mod 5 system?
3
What is the greatest common factor of 80 and 45?
The GCF of 45 and 80 is 5. Prime factors: 45 = 5x3x3 80 = 5x2x2x2x2 the only prime factor in both is 5, and so the highest common factor is 5. Alternative method: 80 mod 45 = 35 45 mod 35 = 10 35 mod 10 = 5 10 mod 5 = 0 so HCF = 5.
PROVE THAT nnn-n is divisible by 6?
A number is divisible by 6 if it is divisible by 2 and 3. Look at 333-3 which is 330 The sum of the digits is 6 and it is even so it is divisible by 6 Now consider 222-2 which I picked because unlike 333, 222 has even digits. 222-2=220, one again even number so divisible by 2 but NOT divisible by 3 so NOT divisible by 6 So it look like this is not true for all n For any odd n, we have the following 1. nnn-n ends in 0 so it is even if we can show it is divisible by 3 we are done. but 777-7 is 770 which is NOT divisible by 3 so it is NOT true. For some n it is true, but not for all n... Now when will nnn-n be divisible by 3. only when n+n is a multiple of 3, ie n=33,66, 99 an that is it! So we could easily prove that nnn-n is divisible by 6 if and only if n=3,6,or 9 ----------------------------- If by nnn, you mean n3, a proof is as follows: n=0,1,2,3,4, or 5 (mod 6) If n=0 (mod 6), we have (0 (mod 6))((0(mod 6))2-1)=0 (mod 6). [Since the first term is zero] If n=1 (mod 6), we have (1 (mod 6))((1(mod 6))2-1)=0 (mod 6) [Since 1-1=0]. If n=2 (mod 6), we have (2 (mod 6))((2(mod 6))2-1)=(2*3) (mod 6) = 6 (mod 6)=0 (mod 6). If n=3 (mod 6), we have (3 (mod 6))((3(mod 6))2-1)=(3*8) (mod 6) = 24 (mod 6) = 0 (mod 6). If n=4 (mod 6), we have (4 (mod 6))((4(mod 6))2-1)=(4*15) (mod 6) = 60 (mod 6) = 0 (mod 6). If n=5 (mod 6), we have (5 (mod 6))((5(mod 6))2-1)=(5*24) (mod 6) = 120 (mod 6) = 0 (mod 6). If you're not comfortable with the modular arethmetic, you can substitue 6m+_, where the blank is each of the numbers 0 through 5 (since every number can be expressed either as a multiple of six, or as a multiple of six plus some number between 1 and 5 --the remainder when the number is divided by six). Taking our example with 5, you would get: (n)(n2-1) can be written as (6m+5)((6m+5)2-1), where m is an integer. Simplifying this, you get: (6m+5)((6m+5)2-1) (6m+5)((6m2+60m+25-1) 6m*6m2+6m*60m+6m*25-6m+5*6m2+5*60m+5*25+5(-1) 6m*6m2+6m*60m+6m*25-6m+5*6m2+5*60m+5*24 Since m is an integer and each term is divisible by 6, (n)(n2-1) is divisible by 6 for integers that can be expressed as 6m+5. You would then repeat the process for each of 0 through 4 to complete the proof. Clearly, if you are comfortable with it, modular arithmetic is the less cumbersome way to proceed.
Will I get an A on your mod 5 maths exam?
If you are willing to pay
Evaluate 2 x 4 x 2 in the mod 5 system?
evaluate 2x4x2 in the mod 5 system
How do you evaluate 6-6 -5 in the mod 12 system?
(6-6)-5 in mod 12
Evaluate 6-6-5 in the mod 12 system?
-5
What are the release dates for The Mod Squad - 1968 Run Lincoln Run 5-16?
The Mod Squad - 1968 Run Lincoln Run 5-16 was released on: USA: 4 January 1973
What is 23 in the modular 9 system?
5 mod 9
Find the value of 327 in the mod 7 system?
the answer is 5
Find the value of y in the mod 9 system 5 x y equals 4?
Find the value of y in the mod 9 system.5 x y = 4
What is remainder when 5 to the power of 30 is divided by 7?
Look at the powers of 5 mod 7: 5¹ mod 7 = 5 5² mod 7 = 5 × (5¹ mod 7) mod 7 = (5 × 5) mode 7 = 25 mod 7 = 4 5³ mod 7 = 5 × (5² mod 7) mod 7 = (5 × 4) mod 7 = 20 mod 7 = 6 5⁴ mod 7 = 5 × (5³ mod 7) mod 7 = (5 × 6) mod 7 = 30 mod 7 = 2 5⁵ mod 7 = 5 × (5⁴ mod 7) mod 7 = (5 × 2) mod 7 = 10 mod 7 = 3 5⁶ mod 7 = 5 × (5⁵ mod 7) mod 7 = (5 × 3) mod 7 = 15 mod 7 = 1 5⁷ mod 7 = 5 × (5⁶ mod 7) mod 7 = (5 × 1) mod 7 = 5 mod 7 = 5 At this point, it is obvious that the remainders will repeat the cycle {5, 4, 6, 2, 3, 1} There are 6 remainders in the cycle, so the remainder of 30 divided by 6 will tell you which remainder to use; if the remainder is 0, use the 6th element. 30 ÷ 6 = 5 r 0 →use the 6th element which is 1, so 5³⁰ ÷ 7 will have a remainder of 1. 1 ≡ 5³⁰ mod 7.
What is 2 x 4 x 2 in the mod 5 system?
8
What is 3 plus 4 plus 1 in the mod 5 system?
3
What is the value of y in the mod 9 system 5 x y equals 4?
4/5
Value of 327 in the mod 7 system?
327 Ξ 645 (mod 7) (6 x 72) + (4 x 7) + 5 = 294 + 28 + 5 = 327
