olymmath

Putnam 1973 A2

  • Session A

A-2. Consider an infinite series whose nnth term is ±(1/n)\pm(1 / n), the ±\pm signs being determined according to a pattern that repeats periodically in blocks of eight. [There are 282^{8} possible patterns of which two examples are: ++−−−−+++−−−+−−−\begin{array}{l} ++----++ \\ +---+--- \end{array}

The first example would generate the series 1+(1/2)−(1/3)−(1/4)−(1/5)−(1/6)+(1/7)+(1/8)+(1/9)+(1/10)−(1/11)−(1/12)−⋯ .]\begin{array}{l} 1+(1 / 2)-(1 / 3)-(1 / 4)-(1 / 5)-(1 / 6)+(1 / 7)+(1 / 8) \\ +(1 / 9)+(1 / 10)-(1 / 11)-(1 / 12)-\cdots .] \end{array} (a) Show that a sufficient condition for the series to be conditionally convergent is that there be four "+" signs and four "-" signs in the block of eight. (b) Is this sufficient condition also necessary? [Here "convergent" means "convergent to a finite limit."]

Dataset text PutnamGAP. Quoted with source.

Solutions

No solution is on olymmath yet. Official and human solutions come first when they arrive. AI solutions come after them, with a label.

Add a solution

Similar problems

These problems have the most words in common with this statement.

Locator putnam/1973/a2 · Tag QH3RE4T3CJ · Edit this page on GitHub · Keys: j next, k previous