# Permutation and combination problem with coins

## Homework Statement

Hello, it is a permutation / combination approach question, however, having thought about an hour i can't get any idea how it should be solved.

Question is

A coin is flipped n times, where n>=3

Find the number of ways to obtain

I am not asking for answers. I have the answers but I don't understand... I don't know how to understand the problem from the definition of permutation and combination.

## The Attempt at a Solution

"At least two heads" would mean "NOT 0 heads or 1 head". There are $2^n$ ways to arrange n letters that can be "H" or "T". How many ways are there to arrange HTTTT...T?