Found problems: 34
Let $a$ be an integer and $n$ a positive integer . Show that the sum :
$$\sum_{k=1}^{n} a^{(k,n)}$$ is divisible by $n$ , where $(x,y)$ is the greatest common divisor of the numbers $x$ and $y$ .
There are some papers of the size $5\times 5$ with two sides which are divided into unit squares for both sides. One uses $n$ colors to paint each cell on the paper, one cell by one color, such that two cells on the same positions for two sides are painted by the same color. Two painted papers are consider as the same if the color of two corresponding cells are the same. Prove that there are no more than
$$\frac{1}{8}\left( {{n}^{25}}+4{{n}^{15}}+{{n}^{13}}+2{{n}^{7}} \right)$$ pairwise distinct papers that painted by this way.
In the figure below, $3$ of the $6$ disks are to be painted blue, $2$ are to be painted red, and $1$ is to be painted green. Two paintings that can be obtained from one another by a rotation or a reflection of the entire figure are considered the same. How many different paintings are possible?
[asy]
size(100);
pair A, B, C, D, E, F;
A = (0,0);
B = (1,0);
C = (2,0);
D = rotate(60, A)*B;
E = B + D;
F = rotate(60, A)*C;
draw(Circle(A, 0.5));
draw(Circle(B, 0.5));
draw(Circle(C, 0.5));
draw(Circle(D, 0.5));
draw(Circle(E, 0.5));
draw(Circle(F, 0.5));
[/asy]
$\textbf{(A) } 6 \qquad \textbf{(B) } 8 \qquad \textbf{(C) } 9 \qquad \textbf{(D) } 12 \qquad \textbf{(E) } 15$
Let $s=\frac{AB+BC+AC}{2}$ be half-perimeter of triangle $ABC$. Let $L$ and $N$be a point's on ray's $AB$ and $CB$, for which $AL=CN=s$. Let $K$ is point, symmetric of point $B$ by circumcenter of $ABC$. Prove, that perpendicular from $K$ to $NL$ passes through incenter of $ABC$.
Solution for problem [url=http://www.artofproblemsolving.com/Forum/viewtopic.php?f=125&t=365714&p=2011659#p2011659]here[/url]
Marie is painting a $4 \times 4$ grid of identical square windows. Initially, they are all orange but she wants to paint $4$ of them black. How many ways can she do this up to rotation and reflection?
You have three colors $\{\text{red}, \text{blue}, \text{green}\}$ with which you can color the faces of a regular octahedron (8 triangle sided polyhedron, which is two square based pyramids stuck together at their base), but you must do so in a way that avoids coloring adjacent pieces with the same color. How many different coloring schemes are possible? (Two coloring schemes are considered equivalent if one can be rotated to fit the other.)
A circular disc is divided into $12$ equal sectors and one of $6$ different colours is used to colour each sector. No two adjacent sectors can have the same colour. Find the number of such distinct colorings possible.
In the figure below, $3$ of the $6$ disks are to be painted blue, $2$ are to be painted red, and $1$ is to be painted green. Two paintings that can be obtained from one another by a rotation or a reflection of the entire figure are considered the same. How many different paintings are possible?
[asy]
size(100);
pair A, B, C, D, E, F;
A = (0,0);
B = (1,0);
C = (2,0);
D = rotate(60, A)*B;
E = B + D;
F = rotate(60, A)*C;
draw(Circle(A, 0.5));
draw(Circle(B, 0.5));
draw(Circle(C, 0.5));
draw(Circle(D, 0.5));
draw(Circle(E, 0.5));
draw(Circle(F, 0.5));
[/asy]
$\textbf{(A) } 6 \qquad \textbf{(B) } 8 \qquad \textbf{(C) } 9 \qquad \textbf{(D) } 12 \qquad \textbf{(E) } 15$
Let $n$ be a positive integer. For any $k$, denote by $a_k$ the number of permutations of $\{1,2,\dots,n\}$ with exactly $k$ disjoint cycles. (For example, if $n=3$ then $a_2=3$ since $(1)(23)$, $(2)(31)$, $(3)(12)$ are the only such permutations.) Evaluate
\[ a_n n^n + a_{n-1} n^{n-1} + \dots + a_1 n. \][i]Proposed by Sammy Luo[/i]