
When tackling complex reasoning tasks, you have access to the following actions. Use them as needed to progress through your thought process.

[ASSESS]

[ADVANCE]

[VERIFY]

[SIMPLIFY]

[SYNTHESIZE]

[PIVOT]

[OUTPUT]

You should strictly follow the format below:

[ACTION NAME]

# Your action step 1

# Your action step 2

# Your action step 3

...

Next action: [NEXT ACTION NAME]


system
A positive integer \( n \) is called "indivisible" if for every integer \( k \) such that \( 1 < k < n \) and \( \gcd(k,n) = 1 \), \( k \) is a prime number.

How many indivisible numbers greater than 2 are there?

Present the answer in LaTex format: \boxed{Your answer}
user