Mathematics Homework Solutions
#46821
Discrete Structures
Let A = {1, 2, 3, 4, 5, 6, 12} and define the relation R on A by m R n iff m|n.
Write the definitions of the properties, reflexive, antisymmetric and transitive and the use the definitions to determine whether each property holds for this relation.
(a) Is this relation a partial ordering relation? Why? If so, draw its Hasse diagram.
(b)Write the (Boolean, that is, the yes/no) matrix of this relation.
This shows how to determine if given properties hold for a relation, write the Boolean matrix, and draw the Hasse diagram.
What is this?
By OTA - Overall OTA Rating
Departed OTA
Purchase Cost Now
$2.19 CAD (was ~$7.98)
Included in Download
- Plain text response
- Attached file(s):
- Discrete+structures.doc
Why you can trust BrainMass.com
- Your Information is Secure
- Best Online Academic Help Service
- Students find real academic Success
- Reflexive, Antisymmetric and Transitive Properties : Hasse Diagram and Boolean Matrix - Please see the attached file for the fully formatted problems. Let A = {1, 2, 3, 4, 5, 6,12} and define the relation R on A by m R n iff m|n. Write the definitions of the properties, reflexive, a ...
- A binary relation R is defined in terms of a given matrix. Define what it means for a relation to be (a) reflexive, (b), antisymmetric, and (c) transitive. Also, determine which of these are properties of R. - For the set A = {a, b, c}, let R be the relation on A which is defined by the following 3 by 3 matrix M_R: ---------------------------------------- Row 1: 1 0 1 Row 2: 1 1 0 Row 3: 0 1 1 ...
- Discrete - Let A = {1, 2, 3, 4, 5, 6,12} and define the relation R on A by m R n iff m|n. Write the definitions of the properties, reflexive, antisymmetric and transitive and the use of the definitions to d ...
- Discrete Math - Definitions : Combinatorics, Enumeration, Permutation, Relation on A, Rn, Reflexive, Symmetric, Antisymmetric and Transitive - On the following terms could you please give my an English text description - in your own words. Thanks. 1. Combinatorics: 2. Enumeration: 3. Permutation: 4. Relation on A: 5. Rn: 6. Reflexive ...
- Binary Relations : Reflexive, Symmetric, Antisymmetric, and/or Transitive - Determine whether the binary relation R on Z, where aRb means |a-b| <= 1, is reflexive, symmetric, antisymmetric, and/or transitive.
