A journalist wants to report on the island of scoundrels and knights, where all inhabitants are either scoundrels (and they always lie) or knights (and they always tell the truth). The journalist interviews each inhabitant exactly once and
gets the following answers:
$A_1$: On this island there is at least one scoundrel,
$A_2$: On this island there are at least two scoundrels,
$...$
$A_{n-1}$: On this island there are at least $n-1$ scoundrels,
$A_n$: On this island everybody is a scoundrel.
Can the journalist decide whether there are more scoundrels or more knights?
1. **Define Variables and Initial Conditions:**
   Let \( k \) be the number of scoundrels on the island. The total number of inhabitants is \( n \).

2. **Case \( k = 0 \):**
   - If there are no scoundrels (\( k = 0 \)), then all inhabitants are knights.
   - According to the problem, \( A_1 \) states that there is at least one scoundrel. Since knights always tell the truth, \( A_1 \) would be false, which contradicts the assumption that all inhabitants are knights.
   - Therefore, \( k = 0 \) is not possible.

3. **Case \( 1 \le k \le n \):**
   - If there is at least one scoundrel (\( 1 \le k \le n \)), we need to analyze the statements \( A_1, A_2, \ldots, A_n \).
   - \( A_1 \) states that there is at least one scoundrel. If this statement is true, the speaker must be a knight. If it is false, the speaker must be a scoundrel.
   - Similarly, \( A_2 \) states that there are at least two scoundrels, and so on up to \( A_n \), which states that everyone is a scoundrel.

4. **Determine the Truthfulness of Statements:**
   - For \( A_1 \) to \( A_k \), the statements are true because there are at least \( k \) scoundrels. Therefore, the speakers of these statements must be knights.
   - For \( A_{k+1} \) to \( A_n \), the statements are false because there are not more than \( k \) scoundrels. Therefore, the speakers of these statements must be scoundrels.

5. **Conclusion:**
   - If there are \( k \) scoundrels, then the first \( k \) statements are true, and the remaining \( n - k \) statements are false.
   - This implies that there are exactly \( k \) knights and \( k \) scoundrels, meaning the number of scoundrels is equal to the number of knights.

\[
\boxed{\text{The number of scoundrels is equal to the number of knights.}}
\]