Question

[10] Discrete Math: Binary number mod 3. Find 11011010010101110101101110111110012 mod 3 For full credit, you should...

[10] Discrete Math: Binary number mod 3.

Find 11011010010101110101101110111110012 mod 3

For full credit, you should show a solution that doesn’t use a calculator (you may use the fingers of one hand as computing device).

Math   Advanced-Math   
0 0
Add a commentTranscribed image text
Next >

Homework Answers

Answer #1

0 0
Know the answer?
Your Answer:

Post as a guest

Your Name:

What's your source?

Earn Coins

Coins can be redeemed for fabulous gifts.

Log In

Sign Up

Not the answer you're looking for?
Ask your own homework help question
Similar Questions
Discrete Math In this problem, we will implement the RSA algorithm to encrypt and decrypt the...
Discrete Math In this problem, we will implement the RSA algorithm to encrypt and decrypt the message ”148”.For this exercise, you may want to use some kind of calculator that can compute the mod function. 1. Set the primes p and q as follows:p=31 and q=47. What are the values for N and φ? 2.The value for e is chosen to be 11. Use Euclid’s algorithm to verify that e and φ are relatively prime and to find d, the...
discrete math (3) with full proof Use the Well Ordering principle to show that a set...
discrete math (3) with full proof Use the Well Ordering principle to show that a set S of positive integers includes 1 and which includes n+ 1, whenever it includes n, includes every positive integer.
Evaluations. You don’t need a calculator or long-division to solve this problem (for full credit, your...
Evaluations. You don’t need a calculator or long-division to solve this problem (for full credit, your solutions should be as simple as possible). Show how you arrive at your results. (a) Evaluate (170007 − 17003) mod 17 (b) Evaluate 200000 mod 18 (c) Evaluate (9274 − 507) mod 3 (d) Evaluate 8126 mod 9 (e) Evaluate 22 mod 5, 24 mod 5, 28 mod 5, 216 mod 5, 217 mod 5. (f) Evaluate 1111 mod 13.
Convert a 10 digit binary number that has 3 decimal digits (of your own choosing) to...
Convert a 10 digit binary number that has 3 decimal digits (of your own choosing) to decimal (show all steps) . Find the twos complement of the following number: (show all steps) 88 decimals (first convert to binary)
Discrete Math question (generating functions) Use the generating function method to find how many ways 10...
Discrete Math question (generating functions) Use the generating function method to find how many ways 10 identical Green Tree Pythons can be distributed within four numbered cages, where the first two of their new homes require an even (but non-zero) number of snakes, the third cage must have an odd number, and with the last cage holding at least three reptiles?
4. RSA For some of the questions below you may want to use a high precision...
4. RSA For some of the questions below you may want to use a high precision calculator e.g. a. Given n = 55 we choose e = 7 to complete the public key for RSA. Explain why this value works but e = 8 doesn’t. ______________________________________________________________________________________________________ ______________________________________________________________________________________________________ b. What is d given e = 7? ______________________ Remember: you need to find and inverse of e (mod φ(n)). Show work. c. What is the number 2 encrypted as? _______________. Show work.
Graph Theory, discrete math question: Let G be a graph with 100 vertices, and chromatic number...
Graph Theory, discrete math question: Let G be a graph with 100 vertices, and chromatic number 99. Prove a lower bound for the clique number of G. Any lower bound will do, but try to make it as large as you can. Please follow this hint my professor gave and show your work, Thank you!! Hint: can you prove that the clique number is at least 1? Now how about 2? Can you prove that the clique number must be...
Discrete Math: The Birthday Problem investigates the minimum number of people needed to have better than...
Discrete Math: The Birthday Problem investigates the minimum number of people needed to have better than a 50% chance of at least two people have the same birthday. Calculating this probability shows that n = 23 yields a probability of approximately .506. Use the probabilistic algorithm called the Monte Carlo algorithm and find the number of people in a room that yields an approximate probability greater than .75. Please use the following list to complete the problem ● Adopt the...
3. Let x be a number between 400 and 900 (i.e. the lower and upper bounds...
3. Let x be a number between 400 and 900 (i.e. the lower and upper bounds for x are 400 and 900 respectively). • Anna knows that the remainder of dividing x over 11 is 10. • Bob knows that x ≡ 4 (mod 13). • Carl knows that x Mod 17 is equal to 13. a) Find x. b) Show that when only Anna and Bob share their information, we cannot find a unique solution for x. c) What...
Combinatorial Math: Find the number of nonnegative integer solutions to the equation a+b+c=249. We are given:...
Combinatorial Math: Find the number of nonnegative integer solutions to the equation a+b+c=249. We are given: 10 ≤ a ≤ 30  (you can use an ellipsis between values in this factor instead of listing them all) b is even and b > 50 c ≥ 144 a) Set up the generating function. Do not multiply it out. Do not use a, b or c in the function. Use x as the variable. The first factor should relate to a, the second...
ADVERTISEMENT
Need Online Homework Help?

Get Answers For Free
Most questions answered within 1 hours.

Ask a Question
ADVERTISEMENT