Školjka

%V0 Solve the equation $\frac{1}{\sin x}+\frac{1}{\cos x}=\frac 1p$ where $p$ is a real parameter. Discuss for which values of $p$ the equation has at least one real solution and determine the number of solutions in $[0, 2\pi)$ for a given $p.$

%V0 For which real numbers $p$ does the equation $x^{2}+px+3p=0$ have integer solutions ?

%V0 Let $a,b,c$ be reals and $$f(a, b, c) = \left| \frac{ |b-a|}{|ab|} +\frac{b+a}{ab} -\frac 2c \right| +\frac{ |b-a|}{|ab|} +\frac{b+a}{ab} +\frac 2c$$ Prove that $f(a, b, c) = 4 \max \{\frac 1a, \frac 1b,\frac 1c \}.$

%V0 An alphabet consists of $n$ letters. What is the maximal length of a word if we know that any two consecutive letters $a,b$ of the word are different and that the word cannot be reduced to a word of the kind $abab$ with $a\neq b$ by removing letters.

%V0 What is the greatest number of balls of radius $1/2$ that can be placed within a rectangular box of size $10 \times 10 \times 1 \ ?$

%V0 Given a finite sequence of integers $a_{1},$ $a_{2},$ $...,$ $a_{n}$ for $n\geq 2.$ Show that there exists a subsequence $a_{k_{1}},$ $a_{k_{2}},$ $...,$ $a_{k_{m}},$ where $1\leq k_{1}\leq k_{2}\leq...\leq k_{m}\leq n,$ such that the number $a_{k_{1}}^{2}+a_{k_{2}}^{2}+...+a_{k_{m}}^{2}$ is divisible by $n.$ Note by Darij: Of course, the $1\leq k_{1}\leq k_{2}\leq ...\leq k_{m}\leq n$ should be understood as $1\leq k_{1}<k_{2}<...<k_{m}\leq n;$ else, we could take $m=n$ and $k_{1}=k_{2}=...=k_{m},$ so that the number $a_{k_{1}}^{2}+a_{k_{2}}^{2}+...+a_{k_{m}}^{2}=n^{2}a_{k_{1}}^{2}$ will surely be divisible by $n.$