Chapter 7: Problem 9
If the complete graph \(K_{n}\) has 45 edges, what is \(n\) ?
/*! This file is auto-generated */ .wp-block-button__link{color:#fff;background-color:#32373c;border-radius:9999px;box-shadow:none;text-decoration:none;padding:calc(.667em + 2px) calc(1.333em + 2px);font-size:1.125em}.wp-block-file__button{background:#32373c;color:#fff;text-decoration:none}
Learning Materials
Features
Discover
Chapter 7: Problem 9
If the complete graph \(K_{n}\) has 45 edges, what is \(n\) ?
All the tools & learning materials you need for study success - in one app.
Get started for free
Let \(p, q, r, s\) be four distinct primes and \(m, n, k, \ell \in \mathbf{Z}^{+}\) How many edges are there in the Hasse diagram of all positive divisors of \((a) p^{3} ;(b) p^{m} ;\) (c) \(p^{3} q^{2} ;\) (d) \(p^{m} q^{n} ;\) (e) \(p^{3} q^{2} r^{4}\) (f) \(p^{m^{\prime \prime}} q^{n} r^{k} ;(g) p^{3} q^{2} r^{4} s^{7} ;\) and \((\mathrm{h}) p^{m} q^{n} r^{k} s^{L} ?\)
Let \(A=\\{1,2,3,4,5,6,7\\}\), For each of the following values of \(r\), determine an equivalence relation \(\mathscr{H}\) on \(A\) with \(|\mathscr{R}|=\) \(r\), or explain why no such relation exists. (a) \(r=6 ;\) (b) \(r=7 ;\) (c) \(r=8 ;\) (d) \(r=9\); (e) \(r=11 ;\) (f) \(r=22\) (h) \(r=30\); (i) \(r=31\) (f) \(r=22 ;\) (g) \(r=23\);
If \((A, \mathscr{})\) is a poset but not a total order, and \(\emptyset \neq B \subset A\), does it follow that \((B \times B) \cap \mathscr{R}\) makes \(B\) into a poset but not a total order?
Let \(n \in \mathbf{Z}^{+}\)with \(n>1\), and let \(A\) be the set of positive integer divisors of \(n\). Define the relation \(\mathscr{A}\) on \(A\) by \(x\). \(x y\) if \(x\) (exactly) divides \(y\). Determine how many ordered pairs are in the relation \(\mathscr{R}\) when \(n\) is (a) \(10 ;\) (b) \(20 ;\) (c) 40 ; (d) \(200 ;\) (e) 210 ; and (f) 13860 .
Let \(A=\\{v, w, x, y, z\\}\). Determine the number of relations on \(A\) that are (a) reflexive and symmetric; (b) equivalence relations; (c) reflexive and symmetric but not transitive; (d) equivalence relations that determine exactly two equivalence classes; (e) equivalence relations where \(w \in[x]\); (f) equivalence relations where \(v, w \in[x]\); (g) equivalence relations where \(w \in[x]\) and \(y \in[z]\); and (h) equivalence relations where \(w \in[x], y \in[z]\), and \([x] \neq[z]\)
What do you think about this solution?
We value your feedback to improve our textbook solutions.