We consider an integer $n \ge 3,$ the set $S=\{1,2,3,\ldots,n\}$ and the set $\mathcal{F}$ of the functions from $S$ to $S.$ We say that $\mathcal{G} \subset \mathcal{F}$ is a generating set for $\mathcal{H} \subset \mathcal{F}$ if any function in $\mathcal{H}$ can be represented as a composition of functions from $\mathcal{G}.$ a) Let the functions $a:S \to S,$ $a(n-1)=n,$ $a(n)=n-1$ and $a(k)=k$ for $k \in S \setminus \{n-1,n\}$ and $b:S \to S,$ $b(n)=1$ and $b(k)=k+1$ for $k \in S \setminus \{n\}.$ Prove that $\{a,b\}$ is a generating set for the set $\mathcal{B}$ of bijective functions of $\mathcal{F}.$ b) Prove that the smallest number of elements that a generating set of $\mathcal{F}$ has is $3.$

Let be nine nonzero decimal digits $ a_1,a_2,a_3,b_1,b_2,b_3,c_1,c_2,c_3 $ chosen such that the polynom $$ \left( 100a_1+10a_2+a_3 \right) X^2 +\left( 100b_1+10b_2+b_3 \right) X +100c_1+10c_2+c_3 $$ admits at least a real solution. Prove that at least one of the polynoms $ a_iX^2+b_iX+c_i\quad (i\in\{1,2,3\}) $ admits at least a real solution. [i]Nicolae Mușuroia[/i]