## Thinking Mathematically (6th Edition)

Suppose that the pairwise comparison method is used to determine the winner in an election. In an election with $n$ candidates, the number of comparisons, C, that must be made is determined by the formula $C = \frac{n~(n-1)}{2}$ We can find how many comparisons must be made if there are eight candidates. In this case, $n=8$. $C = \frac{n~(n-1)}{2}$ $C = \frac{8~(8-1)}{2}$ $C = 28$ If there are eight candidates, 28 comparisons must be made.
{"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 1, "mathjax_display_tex": 0, "mathjax_asciimath": 0, "img_math": 0, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0, "katex": 0, "math-container": 0, "wp-katex-eq": 0, "align": 0, "equation": 0, "x-ck12": 0, "texerror": 0}