1. Postulates and Paragraph Proofs
Sign In
2 Computers | 3 Computers |
---|---|
4 Computers | 6 Computers |
Number of Computers | Number of Connections |
---|---|
2 | 1 |
3 | 3 |
4 | 6 |
5 | 10 |
6 | 15 |
We will draw diagrams for the networks if Diego has 2, 3, 4, or 6 computers. To do that, we will first plot one point for each computer and then connect all of the points to each other.
2 Computers | 3 Computers |
---|---|
4 Computers | 6 Computers |
Number of Computers | Number of Connections |
---|---|
2 | 1 |
3 | 3 |
4 | 6 |
5 | 10 |
6 | 15 |
n-1
If we add these connections together, we can find the total number of connections. (n-1)+(n-2)+(n-3)+...+1 Since the terms of the addition are consecutive numbers, we can use the formula for summation of consecutive numbers and write the final form of our expression. n(n-1)/2