# mod-5 and Boolean Functions

Not what you're looking for?

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.

##### Purchase this Solution

##### Solution Summary

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

##### Solution Preview

Please see the attached file.

When we apply the function f(q)=qmod(n) to the integer q, the function returns the remainder of the division of q by n:

Now we apply mod(5) to 17.

Since

Dividing 17 by 5 results in 3 and a remainder of 2

Hence:

By this token:

The conversion Table from binary to decimal to hexadecimal ...

##### Purchase this Solution

##### Free BrainMass Quizzes

##### Exponential Expressions

In this quiz, you will have a chance to practice basic terminology of exponential expressions and how to evaluate them.

##### Multiplying Complex Numbers

This is a short quiz to check your understanding of multiplication of complex numbers in rectangular form.

##### Probability Quiz

Some questions on probability

##### Geometry - Real Life Application Problems

Understanding of how geometry applies to in real-world contexts

##### Solving quadratic inequalities

This quiz test you on how well you are familiar with solving quadratic inequalities.