0
150
Add your answer:
Earn +20 pts
What numbers go into 150?
75x2=150
A multiplicative inverse of 5 module 7 is?
A multiplicative inverse of 5 mod7 would be a number n ( not a unique one) such that 5n=1Let's look at the possible numbers5x1=5mode 75x2=10=3 mod 75x3=15=1 mod 7 THAT WILL DO IT3 is the multiplicative inverse of 5 mod 7.What about the others? 5x4=20, that is -1 mod 7 or 65x5=25 which is 4 mod 75x6=30 which is -5 or 2 mod 7How did we know it existed? Because 7 is a prime. For every prime number p and positive integer n, there exists a finite field with pn elements. This is an important theorem in abstract algebra. Since it is a field, it must have a multiplicative inverse. So the numbers mod 7 make up a field and hence have a multiplicative inverse.
What is the answer to 75x2-108?
-35
What numbers go into 150?
75x2=150
How many times does 100 go into 75?
75 goes into 100 one time because if you multiply it by 2, you get 75x2=150.
What is the least common multiple of 25 75 and 100?
Solution:Using Prime Factorization:LCM 25- 5x5 75- 5x3x5 100- 5x5x2x2 Commons: 5,5 Now 5x5=25x3=75x2=150x2=300 The answer is 300 ANSWER:300
What is the binary number equivalent to the decimal number 150?
Here's an easy way to convert decimal to binary. 150 = 75x2 + 0 75 = 37x2 + 1 37 = 18x2 + 1 18 = 9x2 + 0 9 = 4x2 + 1 4 = 2x2 + 0 2 = 1x2 + 0 1 = 0x2 + 1 Then place the 'remainder' values in order from bottom to top. 150 (decimal) = 10010110 (binary) This equates to, 27 + 24 + 22 + 21 = 128 + 16 + 4 + 2 = 150
A multiplicative inverse of 5 module 7 is?
A multiplicative inverse of 5 mod7 would be a number n ( not a unique one) such that 5n=1Let's look at the possible numbers5x1=5mode 75x2=10=3 mod 75x3=15=1 mod 7 THAT WILL DO IT3 is the multiplicative inverse of 5 mod 7.What about the others? 5x4=20, that is -1 mod 7 or 65x5=25 which is 4 mod 75x6=30 which is -5 or 2 mod 7How did we know it existed? Because 7 is a prime. For every prime number p and positive integer n, there exists a finite field with pn elements. This is an important theorem in abstract algebra. Since it is a field, it must have a multiplicative inverse. So the numbers mod 7 make up a field and hence have a multiplicative inverse.
