10 Problems with Functions, Sets, Recurrence Relations, Modular Operations, and Equivalence

  1. Home
  2. Homework Library
  3. Computer Science
  4. Discrete Math
  5. 10 Problems with Functions, Sets, Recurrence Relations, Modular Operations, and Equivalence

QuestionQuestion

See Question.pdf

Solution PreviewSolution Preview

This material may consist of step-by-step explanations on how to solve a problem or examples of proper writing, including the use of citations, references, bibliographies, and formatting. This material is made available for the sole purpose of studying and learning - misuse is strictly forbidden.

9)
We need to prove the relation is reflexive, symmetric and transitive.
For reflexivity, this means (a,b) R (a,b) This is true since a*b=b*a => R is reflexive.
For symmetry, this means if (a,b) R (c,d), then ad=bc.
On the other hand, cb=da (we reverted the order)=> (c,d) R (a,b)=> R is a symmetric relation.
For transitivity, we assume that (a,b) R (c,d) and also (c,d) R (e,f).
In this case it means that ad=bc and also cf=de
We multiply the two equalities side by side => adcf=bcde => adcf-bcde=0=> (af-be)cd=0...
$75.00 for this solution

PayPal, G Pay, ApplePay, Amazon Pay, and all major credit cards accepted.

Find A Tutor

View available Discrete Math Tutors

Get College Homework Help.

Are you sure you don't want to upload any files?

Fast tutor response requires as much info as possible.

Decision:
Upload a file
Continue without uploading

SUBMIT YOUR HOMEWORK
We couldn't find that subject.
Please select the best match from the list below.

We'll send you an email right away. If it's not in your inbox, check your spam folder.

  • 1
  • 2
  • 3
Live Chats