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?

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.Com

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
RELATED QUESTIONS
Compared to the number of online connections that they had at the beginning of the year,... (answered by Boreal)

A tree diagram has two stages. Stage 1 has two nodes and stage 2 has four nodes. In... (answered by MathLover1)

An office has 8 rooms, and it is necessary to connect every room to every other room with (answered by Alan3354)

GRAPH THEORY - definitions I want to understand the term "simple graph". I understand... (answered by richard1234)

Mathematical Connections 9-4 p.574#1 1. Explain the difference between odds and... (answered by stanbon)

what is the equation of the line Year t 0 1 2 3 4 Connections (answered by josgarithmetic)

This is a real life question, just curious how to figure it. I have a ceiling fan part... (answered by Alan3354)

Consider the random graph G(n,p) on n vertices, where the probability of an edge between... (answered by ikleyn)

Consider the random graph G(n,p) on n vertices, where the probability of an edge between... (answered by ikleyn)