SOLUTION: Connet all the vertices with 2 colours, such that there exists no triangle with all 3 sides of the same colour. (Triangles not connected by vertices on each point do not count) If

Question 847372: Connet all the vertices with 2 colours, such that there exists no triangle with all 3 sides of the same colour. (Triangles not connected by vertices on each point do not count) If this is impossible, please explain, or prove why.
The vertices are arranged as such:
⠀�⠀⠀�
�⠀⠀⠀⠀�
⠀�⠀⠀�
Each line should connect to every vertice to each other. There should be 20 triangles.
Answer by richard1234(7193) (Show Source): You can put this solution on YOUR website!
You're coloring six points, no three of which are collinear, with two colors. That means there will be three points with the same color, and hence a triangle with all vertices having that color. Therefore it is impossible.
RELATED QUESTIONS
If there is a jar with 60 balls, with 5 different colours (i.e. 12 balls of each colour), (answered by stanbon)

In a Christmas display, the probability that all the lights are the same colour is 0.50, (answered by greenestamps)

Fundamental Ideas Points, Lines, and Planes Postulates and Theorems Segments,... (answered by richard1234)

Balls of the same size and weight are placed in a container. There are 8 different... (answered by greenestamps)

I have 4 spinner and there are 3 colours on the spinner red, blue and orange. If i spin... (answered by venugopalramana,longjonsilver)

Find all possible triangles with b=4, c=5 and angle B = 25 degrees. If no such triangle... (answered by Photonjohn)

Members of the Iroquois nation played a game in which there were 6 flat disks which had... (answered by ewatrrr)

if you have 2 triangles with all 3 angles of 1 triangle equal to all 3 angles of the... (answered by solver91311)

Find all values of k such that the triangle in R3 with vertices A(1,3,-1), B (0,5,-2),... (answered by josgarithmetic)