Problem on permutations & combinations

Click For Summary
SUMMARY

The problem presented involves calculating the maximum number of triangles that can be formed from 8 non-collinear points in a plane, with the condition that no two triangles share more than one vertex. The solution requires understanding combinatorial geometry and the properties of triangles. The maximum number of triangles that can be formed under these constraints is 8, as each triangle can share only one vertex with another triangle.

PREREQUISITES
  • Combinatorial geometry
  • Understanding of triangle properties
  • Basic principles of permutations and combinations
  • Graph theory concepts related to vertex sharing
NEXT STEPS
  • Study combinatorial geometry principles
  • Learn about the properties of triangles in geometry
  • Explore advanced permutations and combinations techniques
  • Research graph theory applications in geometry
USEFUL FOR

Mathematicians, students studying combinatorial geometry, educators teaching geometry concepts, and anyone interested in solving complex geometric problems.

riddhish
Messages
6
Reaction score
0
:cry: I can't solve it, please helpppp!
problem :- there are 8 points in a plane (non collinear) find the maximum number of triangles formed out of these points such that no 2 triangles have more than one common vertex.
 
Mathematics news on Phys.org
How have you tried solving it?
 

Similar threads

  • · Replies 2 ·
Replies
2
Views
1K
  • · Replies 6 ·
Replies
6
Views
2K
  • · Replies 6 ·
Replies
6
Views
2K
  • · Replies 1 ·
Replies
1
Views
1K
  • · Replies 10 ·
Replies
10
Views
3K
  • · Replies 6 ·
Replies
6
Views
3K
Replies
1
Views
2K
  • · Replies 4 ·
Replies
4
Views
2K
  • · Replies 3 ·
Replies
3
Views
6K
  • · Replies 8 ·
Replies
8
Views
1K