Let a_1, a_2, a_3, ldots$a_1, a_2, a_3, \ldots$ be in an A.P. such that sum_k=1^12 a_2k-1 = -frac725 a_1, a_1 neq 0$\sum_{k=1}^{12} a_{2k-1} = -\frac{72}{5} a_1, a_1 \neq 0$. If sum_k=1^n a_k = 0$\sum_{k=1}^{n} a_k = 0$, then n$n$ is:

### Related Formula Sum of an Arithmetic Progression: S_m = fracm2[2a_1 + (m-1)d]$$S_m = \frac{m}{2}[2a_1 + (m-1)d]$$ ### Core Logic Express the odd terms summation in terms of a_1$a_1$ and d$d$, establish their linear dependency, and then solve for n$n$ where total sum vanishes. ### Step 1: Simplify the Given Summation The summation represents the sum of 12$12$ terms: a_1 + a_3 + a_5 + dots + a_23$a_1 + a_3 + a_5 + \dots + a_{23}$. This is an A.P. with initial term a_1$a_1$ and common difference 2d$2d$. frac122[2a_1 + 11(2d)] = -frac725a_1$$\frac{12}{2}[2a_1 + 11(2d)] = -\frac{72}{5}a_1$$ 6[2a_1 + 22d] = -frac725a_1 implies 12a_1 + 132d = -frac725a_1$$6[2a_1 + 22d] = -\frac{72}{5}a_1 \implies 12a_1 + 132d = -\frac{72}{5}a_1$$ ### Step 2: Relate initial term to common difference Multiply through by 5$5$ to eliminate the fraction: 60a_1 + 660d = -72a_1 implies 132a_1 + 660d = 0 implies a_1 = -5d$$60a_1 + 660d = -72a_1 \implies 132a_1 + 660d = 0 \implies a_1 = -5d$$ ### Step 3: Solve for n Set the general sum of n$n$ terms to 0$0$: fracn2[2a_1 + (n-1)d] = 0 implies 2a_1 + (n-1)d = 0$$\frac{n}{2}[2a_1 + (n-1)d] = 0 \implies 2a_1 + (n-1)d = 0$$ Substitute a_1 = -5d$a_1 = -5d$: 2(-5d) + (n-1)d = 0 implies -10d + nd - d = 0 implies nd = 11d$$2(-5d) + (n-1)d = 0 \implies -10d + nd - d = 0 \implies nd = 11d$$ Since a_1 neq 0$a_1 \neq 0$, d neq 0$d \neq 0$, which yields: n = 11$n = 11$ ### Pattern Recognition The condition a_1 = -5d$a_1 = -5d$ means the sequence starts positive/negative and counts down symmetrically. A sum of n$n$ terms equals zero when the middle term or balanced pairs completely wipe each other out, pointing directly to n = 2(5) + 1 = 11$n = 2(5) + 1 = 11$. ### Evaluation Rubric / Model Answer null ### Chapter Mix Class 11 Mathematics: Sequences and Series