taiwan-gsat 2010 Q1

taiwan-gsat · Other · gsat__math Permutations & Arrangements Counting or Combinatorial Problems on APs

1. If each term in the sequence $a_{1}, a_{2}, \ldots, a_{k}, \ldots, a_{10}$ is either 1 or $-1$, how many possible values can $a_{1} + a_{2} + \cdots + a_{k} + \cdots + a_{10}$ take?
(1) 10
(2) 11
(3) $P_{2}^{10}$
(4) $C_{2}^{10}$
(5) $2^{10}$

& 2 & \multirow{2}{*}{A} & 13 & 6 & \multirow{3}{*}{E} & 23 & 9

1. If each term in the sequence $a_{1}, a_{2}, \ldots, a_{k}, \ldots, a_{10}$ is either 1 or $-1$, how many possible values can $a_{1} + a_{2} + \cdots + a_{k} + \cdots + a_{10}$ take?\\
(1) 10\\
(2) 11\\
(3) $P_{2}^{10}$\\
(4) $C_{2}^{10}$\\
(5) $2^{10}$

Paper Questions

Q1 Q2 Q3 Q4 Q5 Q6 Q7 Q8 Q9 Q10 Q11 Q12