Forgot password? New user? Sign up

Existing user? Log in

A regular polygon of $10$ sides is constructed. In how many ways can $3$ vertices be selected so that no two vertices are consecutive ?

Problem Loading...

Note Loading...

Set Loading...