olymmath

SE-SKOLORNAS 1971

Swedish Mathematical Competition 1971.

Other problems

Problem 1

Show that (1+a+a2)2<3(1+a2+a4)\left(1 + a + a^2\right)^2 < 3\left(1 + a^2 + a^4\right) for real a≠1a \neq 1 .

Problem 2

An arbitrary number of lines divide the plane into regions. Show that the regions can be colored red and blue so that neighboring regions have different colors.

Problem 3

A table is covered by 1515 pieces of paper. Show that we can remove 77 pieces so that the remaining 88 cover at least 8/158/15 of the table.

Problem 4

Find 655333+655343+655353+655363+655373+655383+65539332765⋅32766+32767⋅32768+32768⋅32769+32770⋅32771\frac{65533^3 + 65534^3 + 65535^3 + 65536^3 + 65537^3 + 65538^3+ 65539^3}{32765\cdot 32766 + 32767\cdot 32768 + 32768\cdot 32769 + 32770\cdot 32771}

Problem 5

Show that max⁡∣x∣≤t∣1−acos⁡x∣≥tan⁡2t2\max\limits_{|x|\leq t} |1 - a \cos x| \geq \tan^2 \frac{t}{2} for aa positive and t∈(0,π2)t \in (0, \frac{\pi}{2}) .

Problem 6

9999 cards each have a label chosen from 1,2,…,991,2,\dots,99 , such that no (non-empty) subset of the cards has labels with total divisible by 100100 . Show that the labels must all be equal.