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

Explanation

To solve the problem of selecting 3 vertices from a regular polygon of 10 sides such that no two vertices are consecutive, we can follow these steps:

### Step 1: Understand the Problem
We have a regular polygon with 10 vertices. We need to select 3 vertices such that no two of them are adjacent.

### Step 2: Represent the Vertices
Label the vertices of the polygon as \( A_1, A_2, A_3, A_4, A_5, A_6, A_7, A_8, A_9, A_{10} \).

...