SOLUTION: 1 node has zero connections, 2 nodes has 1 connection, 3 nodes has 3 connections, and 4 nodes has 6 connections. how many connections exist with n nodes?
Algebra ->
Sequences-and-series
-> SOLUTION: 1 node has zero connections, 2 nodes has 1 connection, 3 nodes has 3 connections, and 4 nodes has 6 connections. how many connections exist with n nodes?
Log On
Question 1067235: 1 node has zero connections, 2 nodes has 1 connection, 3 nodes has 3 connections, and 4 nodes has 6 connections. how many connections exist with n nodes? Answer by Boreal(15235) (Show Source):
You can put this solution on YOUR website! each node can make a connection with every other except itself.
Half of the connections are repeated.
It is n(n-1)/2
n=1, 1*0=0
n=2, 2*1/2=1
n=3, 3*2/2=3
n=4, 4*3/2=6
