olymmath

USAMO 1995 Problem 2

  • Day 1

A trigonometric map is any one of sin, cos, tan, arcsin, arccos and arctan. Show that given any positive rational number x\mathrm{x}, one can find a finite sequence of trigonometric maps which take 0 to x\mathrm{x}. [So we need to show that we can always find a sequence of trigonometric maps ti\mathrm{t}_{\mathrm{i}} so that: x1=t0(0),x2=t1(x1),…,xn=tn\mathrm{x}_{1}=\mathrm{t}_{0}(0), \mathrm{x}_{2}=\mathrm{t}_{1}\left(\mathrm{x}_{1}\right), \ldots, \mathrm{x}_{\mathrm{n}}=\mathrm{t}_{\mathrm{n}}. 1(xn−1),x=tn(xn)⋅]\left.1\left(\mathrm{x}_{\mathrm{n}-1}\right), \mathrm{x}=\mathrm{t}_{\mathrm{n}}\left(\mathrm{x}_{\mathrm{n}}\right) \cdot\right]

Dataset text NuminaMath olympiads. 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

Locator usamo/1995/p2 · Tag 9MZV3404TX · Edit this page on GitHub · Keys: j next, k previous