How many numbers of $ n $ digits formed only with $ 1,9,8 $ and $ 6 $ divide themselves by $ 3 $ ?

Let $\{a_n \}_{n=0}^{\infty}$ be a sequence given recrusively such that $a_0=1$ and $$a_{n+1}=\frac{7a_n+\sqrt{45a_n^2-36}}{2}$$ for $n\geq 0$ Show that : a) $a_n$ is a positive integer. b) $a_n a_{n+1}-1$ is a square of an integer. [i]Proposed by Stefan Gyurki (Matej Bel University, Banska Bystrica).[/i]

Let $ m,n\ge 2 $ and consider a rectangle formed by $ m\times n $ unit squares that are colored, either white, or either black. A [i]step[/i] is the action of selecting from it a rectangle of dimensions $ 1\times k, $ where $ k $ is an odd number smaller or equal to $ n, $ or a rectangle of dimensions $ l\times 1, $ where $ l $ is and odd number smaller than $ m, $ and coloring all the unit squares of this chosen rectangle with the color that appears the least in it. [b]a)[/b] Show that, for any $ m,n\ge 5, $ there exists a succession of [i]steps[/i] that make the rectagle to be single-colored. [b]b)[/b] What about $ m=n+1=5? $

A certain frog that was placed on a vertex of a convex polygon chose to jump to another vertex, either clockwise skipping one vertex, either counterclockwise skipping two vertexes, and repeated the procedure. If the number of jumps that the frog made is equal to the number of sides of the polygon, the frog has passed through all its vertexes and ended up on the initial vertex, what´s the set formed by all the possible values that this number can take? [i]Andrei Eckstein[/i]

At a math contest there were $ 50 $ participants, where they were given $ 3 $ problems each to solve. The results have shown that every candidate has solved correctly at least one problem, and that a total of $ 100 $ problems have been evaluated by the jury as correct. Show that there were, at most, $ 25 $ winners who got the maximum score.

For a natural number $ n, $ a string $ s $ of $ n $ binary digits and a natural number $ k\le n, $ define an $ n,s,k$ [i]-block[/i] as a string of $ k $ consecutive elements from $ s. $ We say that two $ n,s,k\text{-blocks} , $ namely, $ a_1a_2\ldots a_k,b_1b_2\ldots b_k, $ are [i]incompatible[/i] if there exists an $ i\in\{1,2,\ldots ,k\} $ such that $ a_i\neq b_i. $ Also, for two natural numbers $ r\le n, l, $ we say that $ s $ is $ r,l $ [i]-typed[/i] if there are, at most, $ l $ pairwise incompatible $ n,s,r\text{-blocks} . $ Let be a $ 3,7\text{-typed} $ string $ t $ consisting of $ 10000 $ binary digits. Determine the maximum number $ M $ that satisfies the condition that $ t $ is $ 10,M\text{-typed} . $ [i]Cătălin Gherghe[/i]

At a math contest which has $ 5 $ problems, each candidate has solved $ 3 $ problems. Among these candidates, for any group of $ 5 $ candidates that we might choose, we see that there is a problem which all members of the group had solved it. Prove that there is a problem solved by all candidates.

Given a poistive integer $ m, $ determine the smallest integer $ n\ge 2 $ such that for any coloring of the $ n^2 $ unit squares of a $ n\times n $ square with $ m $ colors, there are, at least, two unit squares $ (i,j),(k,l) $ that share the same color, where $ 1\le i,j,k,l\le n,i\neq j,k\neq l. $ [i]American Mathematical Monthly[/i]

At a table tennis tournament, each one of the $ n\ge 2 $ participants play with all the others exactly once. Show that, at the end of the tournament, one and only one of these propositions will be true: $ \text{(1)} $ The players can be labeled with the numbers $ 1,2,...,n, $ such that $ 1 $ won $ 2, 2 $ won $ 3,...,n-1 $ won $ n $ and $ n $ won $ 1. $ $ \text{(2)} $ The players can be partitioned in two nonempty subsets $ A,B, $ such that whichever one from $ A $ won all that are in $ B. $

In order to study a certain ancient language, some researchers formatted its discovered words into expressions formed by concatenating letters from an alphabet containing only two letters. Along the study, they noticed that any two distinct words whose formatted expressions have an equal number of letters, greater than $ 2, $ differ by at least three letters. Prove that if their observation holds indeed, then the number of formatted expressions that have $ n\ge 3 $ letters is at most $ \left[ \frac{2^n}{n+1} \right] . $

A cube with an edge of $ n $ cm is divided in $ n^3 $ mini-cubes with edges of legth $ 1 $ cm. Only the exterior of the cube is colored. [b]a)[/b] How many of the mini-cubes haven't any colored face? [b]b)[/b] How many of the mini-cubes have only one colored face? [b]c)[/b] How many of the mini-cubes have, at least, two colored faces? [b]d)[/b] If we draw with blue all the diagonals of all the faces of the cube, upon how many mini-cubes do we find blue segments?

An ant can move from a vertex of a cube to the opposite side of its diagonal only on the edges and the diagonals of the faces such that it doesn’t trespass a second time through the path made. Find the distance of the maximum journey this ant can make.

Let be a structure formed by $ n\ge 4 $ points in space, four by four noncoplanar, and two by two connected by a wire. If we cut the $ n-1 $ wires that connect a point to the others, the remaining point is said to be [i]isolated.[/i] The structure is said to be [i]disconnected[/i] if there are at least two points for which there isn´t a chain of wires connecting them. So, initially, it´s not disconnected. $ \text{(1)} $ Prove that, by cutting a number smaller or equal with $ n-2, $ the structure won´t become disconnected. $ \text{(2)} $ Determine the minimum number of wires that needs to be cut so that the remaining structure is disconnected, yet every point, not isloated.

Show that if the point $ M $ is situated in the interior of a square $ ABCD, $ then, among the segments $ MA,MB,MC,MD, $ [b]a)[/b] at most one of them is greater with a factor of $ \sqrt 5/2 $ than the side of the square. [b]b)[/b] at most two of them are greater than the side of the square. [b]c)[/b] at most three of them are greater with a factor of $ \sqrt 2/2 $ than the side of the square.

Bayus has eight slips of paper, which are labeled 1$, 2, 4, 8, 16, 32, 64,$ and $128.$ Uniformly at random, he draws three slips with replacement; suppose the three slips he draws are labeled $a, b,$ and $c.$ What is the probability that Bayus can form a quadratic polynomial with coefficients $a, b,$ and $c,$ in some order, with $2$ distinct real roots?