Skip to content

kcelebi/InscribedTriangles

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

15 Commits
 
 
 
 
 
 
 
 
 
 

Repository files navigation

InscribedTriangles

See the demonstration here.

alt text

This Demonstration shows all possible triangles that can be inscribed in a polygon of n sides and counts the number of noncongruent kinds of triangles.

The function IntegerPartitions[] is able to accurately calculate the number of possible noncongruent triangles that can be inscribed in a polygon with n sides. Example:

IntegerPartitions[n, {3}]

About

WolframDemonstrations demo Mathematica code

Resources

License

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published