Get motivated… try this quiz

Understand the problem

Let P be a regular 12 sided polygon. How many right triangles can be formed by the vertices of P?

Tutorial Problems… try these before watching the video.

1. Show that a regular 12 sided polygon must be cyclic.

2. Show that hypotenuse of any right triangle, whose vertices are vertices of the above polygon, must be diameter of the circle (in which the polygon is inscribed)

You may send solutions to support@cheenta.com. Though we usually look into internal students work, we will try to give you some feedback.

Now watch the discussion video

Subscribe to Cheenta’s youtube channel

Connected Program at Cheenta

Math Olympiad Program

Math Olympiad is the greatest and most challenging academic contest for school students. Brilliant school students from over 100 countries participate in it every year.

Cheenta works with small groups of gifted students through an intense training program. It is a deeply personalized journey toward intellectual prowess and technical sophistication.

Similar Problems

cos of sin of x in isi entrance

cos(sin(x)) function in ISI Entrance

A simple trigonometric equation from ISI Entrance. Try this problem. We also added a quiz, some related problems, and finally video.

Geometry of AM GM Inequality

Geometry of AM GM Inequality

AM GM Inequality has a geometric interpretation. Watch the video discussion on it and try some hint problems to sharpen your skills.

Counting triangles in ISI Entrance 2019

Counting triangles in ISI Entrance

Can you combine geometry and combinatorics? This ISI Entrance problems requires just that. We provide sequential hints, additional problems and video.

Paper folding geometry in ISI Entrance

Paper folding geometry in ISI Entrance

A problem from ISI Entrance that requires Paper folding geometry. We provide sequential hints so that you can try the problem!

An Hour of Beautiful Proofs

Every week we dedicate an hour to Beautiful Mathematics - the Mathematics that shows us how Beautiful is our Intellect. This week, I decided to do three beautiful proofs in this one-hour session... Proof of Fermat's Little Theorem ( via Combinatorics )It uses...

Inequality – In Equality

This article aims to give you a brief overview of Inequality, which can be served as an introduction to this beautiful sub-topic of Algebra. This article doesn't aim to give a list of formulas and methodologies stuffed in single baggage, rather it is specifically...
AM GM inequality in ISI Entrance

AM GM inequality in ISI Entrance

Arithmetic Mean and Geometric Mean inequality form a foundational principle. This problem from I.S.I. Entrance is an application of that.

How to solve an Olympiad Problem (Number Theory)?

Suppose you are given a Number Theory Olympiad Problem. You have no idea how to proceed. Totally stuck! What to do? This post will help you to atleast start with something. You have something to proceed. But as we share in our classes, how to proceed towards any...
Inverse and Bezout

How are Bezout’s Theorem and Inverse related? – Number Theory

The inverse of a number (modulo some specific integer) is inherently related to GCD (Greatest Common Divisor). Euclidean Algorithm and Bezout’s Theorem forms the bridge between these ideas. We explore these beautiful ideas.

invariance and combinatorics in ISI Entrance

How to use Invariance in Combinatorics – ISI Entrance Problem

Invariance is a fundamental phenomenon in mathematics. In this combinatorics problem from ISI Entrance, we discuss how to use invariance.