Which positive integers $m$ are such that $k^m - 1$ is divisible by $2^m$ for all odd numbers $k \ge 3$?

[b]Problem:[/b]For a positive integer $ n$,let $ V(n; b)$ be the number of decompositions of $ n$ into a product of one or more positive integers greater than $ b$. For example,$ 36 \equal{} 6.6 \equal{}4.9 \equal{} 3.12 \equal{} 3 .3. 4$, so that $ V(36; 2) \equal{} 5$.Prove that for all positive integers $ n$; b it holds that $ V(n;b)<\frac{n}{b}$. :)

What are the last two digits of $9^{8^{.^{.^{.^2}}}}$ ?

[b]p1.[/b] Consider the following function $f(x) = \left(\frac12 \right)^x - \left(\frac12 \right)^{x+1}$. Evaluate the infinite sum $f(1) + f(2) + f(3) + f(4) +...$ [b]p2.[/b] Find the area of the shape bounded by the following relations $$y \le |x| -2$$ $$y \ge |x| - 4$$ $$y \le 0$$ where |x| denotes the absolute value of $x$. [b]p3.[/b] An equilateral triangle with side length $6$ is inscribed inside a circle. What is the diameter of the largest circle that can fit in the circle but outside of the triangle? [b]p4.[/b] Given $\sin x - \tan x = \sin x \tan x$, solve for $x$ in the interval $(0, 2\pi)$, exclusive. [b]p5.[/b] How many rectangles are there in a $6$ by $6$ square grid? [b]p6.[/b] Find the lateral surface area of a cone with radius $3$ and height $4$. [b]p7.[/b] From $9$ positive integer scores on a $10$-point quiz, the mean is $ 8$, the median is $ 8$, and the mode is $7$. Determine the maximum number of perfect scores possible on this test. [b]p8.[/b] If $i =\sqrt{-1}$, evaluate the following continued fraction: $$2i +\frac{1}{2i +\frac{1}{2i+ \frac{1}{2i+...}}}$$ [b]p9.[/b] The cubic polynomial $x^3-px^2+px-6$ has roots $p, q$, and $r$. What is $(1-p)(1-q)(1-r)$? [b]p10.[/b] (Variant on a Classic.) Gilnor is a merchant from Cutlass, a town where $10\%$ of the merchants are thieves. The police utilize a lie detector that is $90\%$ accurate to see if Gilnor is one of the thieves. According to the device, Gilnor is a thief. What is the probability that he really is one? PS. You had better use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Denote by $\mathbb{N}$ the set of all positive integers. Find all functions $f:\mathbb{N}\rightarrow \mathbb{N}$ such that for all positive integers $m$ and $n$, the integer $f(m)+f(n)-mn$ is nonzero and divides $mf(m)+nf(n)$. [i]Proposed by Dorlir Ahmeti, Albania[/i]

Suppose that $m$ does not have a primitive root. Show that \[a^{ \frac{\phi(m)}{2}}\equiv 1 \; \pmod{m}\] for every $a$ relatively prime $m$.

Show that there is an infinite sequence $a_1,a_2,...$ of natural numbers such that $a^2_1+a^2_2+ ...+a^2_N$ is a perfect square for all $N$. Give a recurrent formula for one such sequence.

Let $p$ be a prime and $k$ be a positive integer. Set $S$ contains all positive integers $a$ satisfying $1\le a \le p-1$, and there exists positive integer $x$ such that $x^k\equiv a \pmod p$. Suppose that $3\le |S| \le p-2$. Prove that the elements of $S$, when arranged in increasing order, does not form an arithmetic progression.

Let be $n\geq 3$ fixed positive integer.Let be real numbers $a_1,a_2,...,a_n,b_1,b_2,...,b_n$ such that satisfied this conditions: [b]$i)$[/b] $ $ $a_n\geq a_{n-1}$ and $b_n\geq b_{n-1}$ [b]$ii)$[/b] $ $ $0<a_1\leq b_1\leq a_2\leq b_2\leq ... \leq a_{n-1}\leq b_{n-1}$ [b]$iii)$[/b] $ $ $a_1+a_2+...+a_n=b_1+b_2+...+b_n$ [b]$iv)$[/b] $ $ $a_{1}\cdot a_2\cdot ...\cdot a_n=b_1\cdot b_2\cdot ...\cdot b_n$ Show that $a_i=b_i$ for all $i=1,2,...,n$

A sequence of integers is defined as follows: $a_1=1,a_2=2,a_3=3$ and for $n>3$, $$a_n=\textsf{The smallest integer not occurring earlier, which is relatively prime to }a_{n-1}\textsf{ but not relatively prime to }a_{n-2}.$$Prove that every natural number occurs exactly once in this sequence. [i]M. Ivanov[/i]

Show that, for any integer $n$, the number $n^3 - 9n + 27$ is not divisible by $81$.

For natural numbers $n$ and $b$, let $V(n, b)$ denote the number of decompositions of $n$ into the product of integers each of which is greater than $b$: for example $$36 = 6\times 6 = 4\times 9 = 3\times 3\times 4 = 3\times 12,$$ i.e. $V(36,2) = 5$. Prove that $V(n, b) < n/b$ for all $n$ and $b$. (N.B. Vasiliev, Moscow)

Find all positive integers $p,q,r,s>1$ such that $$p!+q!+r!=2^s.$$

A sequence $(a_n)_{n=1}^{\infty}$ of positive integers satisfies the condition $a_{n+1} = a_n +\tau (n)$ for all positive integers $n$ where $\tau (n)$ is the number of positive integer divisors of $n$. Determine whether two consecutive terms of this sequence can be perfect squares.

Find the sum of $$\frac{\sigma(n) \cdot d(n)}{ \phi (n)}$$ over all positive $n$ that divide $ 60$. Note: The function $d(i)$ outputs the number of divisors of $i$, $\sigma (i)$ outputs the sum of the factors of $i$, and $\phi (i)$ outputs the number of positive integers less than or equal to $i$ that are relatively prime to $i$.

Prove that in any set consisting of $117$ pairwise distinct three-digit numbers, you can choose $4$ pairwise disjoint subsets in which the sums of numbers are equal.

A palindrome is a number that is the same when its digits are reversed. Find all numbers that have at least one multiple that is a palindrome.

Let $p$ be a prime and let $f(x) = ax^2 + bx + c$ be a quadratic polynomial with integer coefficients such that $0 < a, b, c \le p$. Suppose $f(x)$ is divisible by $p$ whenever $x$ is a positive integer. Find all possible values of $a + b + c$.

Find all pairs $(a,b)$ of positive integers such that $(ab)^2 - 4(a+b)$ is the square of an integer.

The sequence $\{a_n\}$ is defined by $a_0 = 1, a_1 = 2,$ and for $n \geq 2,$ $$a_n = a_{n-1}^2 + (a_0a_1 \dots a_{n-2})^2.$$ Let $k$ be a positive integer, and let $p$ be a prime factor of $a_k.$ Show that $p > 4(k-1).$

Prove that the sum of the squares of $1984$ consecutive positive integers cannot be the square of an integer.

Find the smallest prime that is the fifth term of an increasing arithmetic sequence, all four preceding terms also being prime.

Baron Munchhausen has a collection of stones, such that they are of $1000$ distinct whole weights, $2^{1000}$ stones of every weight. Baron states that if one takes exactly one stone of every weight, then the weight of all these $1000$ stones chosen will be less than $2^{1010}$, and there is no other way to obtain this weight by picking another set of stones of the collection. Can this statement happen to be true? [i](М. Антипов)[/i] [hide=Thanks]Thanks to the user Vlados021 for translating the problem.[/hide]

Find all natural numbers $n$ such that $$(n+3)^n=\sum_{k=3}^{n+2}k^n.$$

Prove that for every positive integer $t$ there is a unique permutation $a_0, a_1, \ldots , a_{t-1}$ of $0, 1, \ldots , t-1$ such that, for every $0 \leq i \leq t-1$, the binomial coefficient $\binom{t+i}{2a_i}$ is odd and $2a_i \neq t+i$.