We call a function ggg special if g(x)=af(x)g(x)=a^{f(x)}g(x)=af(x) (for all xxx ) where aaa is a positive integer and fff is polynomial with integer coefficients such that f(n)>0f(n)>0f(n)>0 for all positive integers nnn . A function is called an *exp…
Find the minimum value of kkk such that there exists two sequence ai,bi{a_i},{b_i}ai,bi for i=1,2,⋯ ,ki=1,2,\cdots ,ki=1,2,⋯,k that satisfies the following conditions. (i) For all i=1,2,⋯ ,k,i=1,2,\cdots ,k,i=1,2,⋯,k, ai,bia_i,b_iai,bi is the element of…
On a circle, n>1n > 1n>1 points are marked, called positions, dividing it into equal arcs. The positions are numbered clockwise from 0 to n−1n-1n−1. Vasya places a token on one of these positions. The following actions, called moves, are re…
Given nnn different natural numbers, prove that for the following cases: 1. n=5n=5n=5 2. n=1989n=1989n=1989 there exists an infinite arithmetic sequence of positive integers such that its first term is not greater than its common difference…
If there exist integers aia_iai and bib_ibi (for 1≤i≤φ(n)1 \leq i \leq \varphi(n)1≤i≤φ(n)) such that aia_iai, bib_ibi, ai+bia_i + b_iai+bi, and ai−bia_i - b_iai−bi (for 1≤i≤φ(n)1 \leq i \leq \varphi(n)1≤i≤φ(n)) all form a reduced residue system modulo nnn,…
Determine all digits zzz such that for every integer k≥1k \geq 1k≥1, there exists an integer n≥1n \geq 1n≥1 such that the decimal representation of n9n^{9}n9 ends with at least kkk digits zzz.
Given that xxx and yyy are positive integers such that xy10xy^{10}xy10 is perfect 33rd power of a positive integer, prove that x10yx^{10}yx10y is also a perfect 33rd power!
Knowing that 23 October 1948 was a Saturday, which is more frequent for New Year's Day, Sunday or Monday?
Let f(x)=x3−x+1f(x) = x^3 - x + 1f(x)=x3−x+1 and let SSS be the set of integers {0,1,2,…,20}\{0, 1, 2, \dots, 20\}{0,1,2,…,20}. Find the number of integers s∈Ss \in Ss∈S such that f(s)f(s)f(s) has a remainder of zero when divided by 777.
Prove that if the congruences a≡b(modn1),…,a≡b(modnk)a \equiv b \pmod{n_1}, \ldots, a \equiv b \pmod{n_k}a≡b(modn1),…,a≡b(modnk) hold, then a≡b(modn)a \equiv b \pmod{n}a≡b(modn), where n=lcm(n1,…,nk)n = \text{lcm}(n_1, \ldots, n_k)n=lcm(n1,…,nk).
Let yyy be a non-zero natural number. Show that y−1y-1y−1 divides y(y2)−2yy+1+1y^{\left(y^{2}\right)} - 2 y^{y+1} + 1y(y2)−2yy+1+1.
a) What is the probability that the square of a randomly chosen integer ends in the digit 1? What is the probability that the cube of a randomly chosen integer ends in the digits 11? b) What is the probability that the tenth power of a ran…
Let f(x)=3x+2f(x) = 3x + 2f(x)=3x+2. Define f(2)(x)=f(f(x))f^{(2)}(x) = f(f(x))f(2)(x)=f(f(x)) and f(k+1)(x)=f(f(k)(x))f^{(k+1)}(x) = f(f^{(k)}(x))f(k+1)(x)=f(f(k)(x)) for k∈N∗k \in \mathbf{N}^{*}k∈N∗. Prove that there exists a positive integer mmm such that f(99)(m)f^{(99)}(m)f(99)(m) is divisible by 1997.
ppp is an odd prime congruent to 2mod 32 \mod 32mod3. Prove that at most p−1p-1p−1 members of the set {m2−n3−1 ∣ 0<m,n<p}\{m^2 - n^3 - 1 \;|\; 0 < m, n < p\}{m2−n3−1∣0<m,n<p} are divisible by ppp.
Integers x,y,zx,y,zx,y,z and a,b,ca,b,ca,b,c satisfy x2+y2=a2,y2+z2=b2z2+x2=c2.x^2+y^2=a^2,\enspace y^2+z^2=b^2\enspace z^2+x^2=c^2.x2+y2=a2,y2+z Prove that the product xyzxyzxyz is divisible by (a) 555 , and (b) 555555 .
Determine all triples (p,q,r)(p, q, r)(p,q,r) of positive integers, where p,qp, qp,q are also primes, such that r2−5q2p2−1=2\frac{r^2-5q^2}{p^2-1}=2p2−1r2−5q2=2 .
Find the sum of the first 10 elements that appear both in the arithmetic progression {5,8,11,14,…}\{5, 8, 11, 14, \ldots\}{5,8,11,14,…} and in the geometric progression {10,20,40,80,…}\{10, 20, 40, 80, \ldots\}{10,20,40,80,…}.
A group of students form a circle and start counting continuously from 1. Congcong calls out "25" and "99", and Mingming calls out "8" and "119". What is the minimum number of students in this group?
Find all positive integer solutions x,y,z x, y, zx,y,z of the equation 3x+4y=5z. 3^x +{} 4^y ={} 5^z.3x+4y=5z.
Let ω(n)\omega(n)ω(n) denote the number of prime divisors of a natural number n>1n > 1n>1. Prove that for an infinite set of values nnn, the inequalities ω(n)<ω(n+1)<ω(n+2)\omega(n) < \omega(n+1) < \omega(n+2)ω(n)<ω(n+1)<ω(n+2) hold.