Purchase Solution

Discrete math questions on relations and functions

Not what you're looking for?

Ask Custom Question

Logic & Set Theory; Boolean Algebra; Relations & Functions

1. How do we distinguish relations from functions?

2. What sort of relation is friendship, using the human or sociological meaning of the word? Is it necessarily reflexive, symmetric, antisymmetric, or transitive? Explain why it is or is not any of these. What other types of interpersonal relationships share one or more of these properties? Explain.

3. Reduce the following Boolean product to zero OR a fundamental product: xyx'z.c

4. Write the dual of the following Boolean equation: a+a'b = a+b

Purchase this Solution
Solution Summary

The solution gives detailed steps on answering 4 discrete math questions on relations, functions, reflexive, symmetric, transitive, Boolean product and Boolean equation.

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.

Solving quadratic inequalities

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

Graphs and Functions

This quiz helps you easily identify a function and test your understanding of ranges, domains , function inverses and transformations.

Geometry - Real Life Application Problems

Understanding of how geometry applies to in real-world contexts

Know Your Linear Equations

Each question is a choice-summary multiple choice question that will present you with a linear equation and then make 4 statements about that equation. You must determine which of the 4 statements are true (if any) in regards to the equation.

View More Free Quizzes
Related BrainMass Solutions

  • Discrete Math : Counting and Relations

    58676 Discrete Math : Counting and Relations Basics of Counting 32. How many functions are there from the set {1, 2, ... , n}, where n is a positive integer, to the set {0, 1}? Relations & Relation Properties 24.

  • Discrete Math - Relations

    505491 Discrete Math - Relations Let B = {0,{1},{2},{1,2}}; we define a relation on B. The pairs are of the form (X.Y) with X and Y subsets of {1,2}. We set XRY if absX = absY. Find the relations.

  • Recurrence relations, compound interest, polynomials, number of combinations, & iteration

    339106 Recurrence relations, compound interest, polynomials Please help with the following discrete math involving recurrence relations, compound interest, polynomials, number of combinations and iteration. 14.

  • Discrete math questions

    I can only answer complete questions. The solution gives detailed steps on some questions about discrete math. All formula and calculations are shown and explained.

  • Discrete Math- Equivalence Relations

    506432 Discrete Math- Equivalence Relations Please help with the following problem regarding discrete math. I need a clear explanation of what an equivalence relation is with an examples.

  • Discrete Math : Show that the symmetric closure of the union of 2 relations is the union of their symmetric closures.

    59426 Discrete Math : Show that the symmetric closure of the union of 2 relations is the union of their symmetric closures. Show that the symmetric closure of the union of 2 relations is the union of their symmetric closures.

  • Discrete Math : Set Relations

    19774 Discrete Math : Set Relations Let SIGMA = {a,b} be an alphabet. a. List between braces the elemnts of SIGMA4. the set of strings of length over SIGMA. b. Let A = SIGMA1 U SIGMA2 and B = SIGMA3 U SIGMA4.

  • Collection of subsets for equivalence relations

    Discrete Math Please scroll down to see work on next page for this problem. Still unsure how this proof is proved. This is not always true. Relation is not necessarily equivalence relation.

  • Steps on solving 4 discrete math questions

    576250 Steps on solving 4 discrete math questions Please see attached file with questions and provide ALL work so that I can understand how you arrived at the answers. Thank you. - 1.

View More Related Solutions