<< Prev Showing: 16-20 of 418 Next >>
· 1-5 · 6-10 · 11-15 · 16-20 · 21-25 · 26-30 · 31-35 · 36-40 · 41-45 · 46-50 · 51-55 ·Discrete Math: Binary Relations
Please see the attached file for the fully formatted problems. 2. Let C = {2, 3, 4, 5} and D = {3, 4} and define a binary relation S from C to D as follows: for all (x, y) for all (x, y) C D, (x, y) S x y (Yes/No answers sufficient; explanation optional) a. Is 2 S 4? Is 4 S 3? Is (4, 4) S? Is (3, 2) S? b. Write S as a set of ordered pairs. 5. The congruence modulo 3 relation, T, is defined from Z to Z as follows: for all integers m and n, m T n 3 | (m - n). (Yes/No answers sufficient; explanation optional) a. Is 10 T 1? Is 1 T 10? Is (2, 2) T? ... click for more
Subject:
Math
Topic:
Discrete Structures
Posting ID:
6213
OTA ID:
101298
Discrete Math: Binary Relations
Please see the attached file for the fully formatted problems. SECTION 10.2 For #2: A binary relation is defined on the set A = {0, 1, 2, 3}. For the relation given, a. draw the directed graph (See drawing tips in the Overview) b. determine whether the relation is reflexive c. determine whether the relation is symmetric d. determine whether the relation is transitive Give a counterexample in each case in which the relation does not satisfy one of the properties. 2. R2 = {(0,0), (0, 1), (1, 1), (1, 2), (2, 2), (2, 3)} 16. Determine whether or not the given binary relation is reflexive, symmetric, transitive, or none of these. Justify your answers. F is the congruence modul... click for more
Subject:
Math
Topic:
Discrete Structures
Posting ID:
6214
OTA ID:
101298
Discrete math, see attachment
Subject:
Math
Topic:
Discrete Structures
Posting ID:
6215
OTA ID:
103300
Trees and Graphs: Does the Graph Exist?
Graphs and trees Section 11.5, #16 Either draw a graph with the given specifications or explain why no such graph exists. #16: tree, twelve vertices, fifteen edges Section 11.5, #18 Either draw a graph with the given specifications or explain why no such graph exists. #18: tree, five vertices, total degree 10
Subject:
Math
Topic:
Discrete Structures
Posting ID:
6988
OTA ID:
103137
Working with permutations and combinations
Permutations and coefficients (a) How many bit strings of length 7 are there? Explain. (b) How many bit strings of length 7 are there which begin with a 0 and end with a 1? Explain. (c) How many bit strings of length 7 is there that contain an even number of ones? Explain.
Subject:
Math
Topic:
Discrete Structures
Posting ID:
6999
OTA ID:
101298
<< Prev Showing: 16-20 of 418 Next >>
· 1-5 · 6-10 · 11-15 · 16-20 · 21-25 · 26-30 · 31-35 · 36-40 · 41-45 · 46-50 · 51-55 · 56-60 · 61-65 · 66-70 · 71-75 · 76-80 · 81-85 · 86-90 · 91-95 · 96-100 · 101-105 · 106-110 · 111-115 · 116-120 · 121-125 · 126-130 · 131-135 · 136-140 · 141-145 · 146-150 · 151-155 · 156-160 · 161-165 · 166-170 · 171-175 · 176-180 · 181-185 · 186-190 · 191-195 · 196-200 · 201-205 · 206-210 · 211-215 · 216-220 · 221-225 · 226-230 · 231-235 · 236-240 · 241-245 · 246-250 · 251-255 · 256-260 · 261-265 · 266-270 · 271-275 · 276-280 · 281-285 · 286-290 · 291-295 · 296-300 · 301-305 · 306-310 · 311-315 · 316-320 · 321-325 · 326-330 · 331-335 · 336-340 · 341-345 · 346-350 · 351-355 · 356-360 · 361-365 · 366-370 · 371-375 · 376-380 · 381-385 · 386-390 · 391-395 · 396-400 · 401-405 · 406-410 · 411-415 · 416-418 ·Page generated in 0.0961 seconds