Mathematics Homework Solutions
Problem
#106825

Discrete Structures

1) If f is the mod-5 function, compute each of the following.
a) f(17)
b) f(48)
c) f(169)

3) Convert (1011101)2 to base 16 (i.e., hex)

4) Find the sum of products expansion of this Boolean function F(x,y) that equals 1 if and only if x = 1.

Note: one can write out the phrase "y complement" to represent the notation for the complement of y.


Solution Summary

This is a set of discrete structures questions involving sum of products, converting to a base, and mod functions.

Solution
What is this?
By OTA - Overall OTA Rating
Yinon Shafrir, PhD - 5/5
Purchase Cost Now
$2.19 CAD (was ~$7.98)
Included in Download
  • Plain text response
  • Attached file(s):
    • BM 106825.doc
    • BM 106825.pdf
$2.19 Instant Download
Add to Cart
Why you can trust BrainMass.com
  • Your Information is Secure
  • Best Online Academic Help Service
  • Students find real academic Success
Related Solutions
  • System of Congruence. - I need to know how to find the system of congruence for the following: x = 5 (mod 6) x = 3 (mod 10) x = 8 (mod 15)
  • Proofs using the mod function. - Prove that ((ax mod M) +b) mod M = (ax + b) mod M when M is a positive integer, and a, b and x are nonnegative integers.
  • Algebaic Number Theory - Determine if the congruence has solutions....determine the complete solution (see attached)
  • Discrete mathematics proofs - 1) Prove that all integers a,b,p, with p>0 and q>0 that ((a+b) mod p)mod q = (a mod p) mod q + (b mod p) mod q Or give a counterexample 2) prove for all integers a,b,p,q with p>0 and q>0 that ( ...
  • Fermat's Little Theorem - Use Fermat's Little Theorem to compute 3^302 mod 5, 3^302 mod 7, and 3^302 mod 11. Use your results to find 3 ^ 302 mod 385 (note 385 = 5 . 7 . 11.)
Browse