Suppose aaa, bbb, and ccc are positive integers where b=2ab = 2ab=2a, c=3ac = 3ac=3a, and a+b+c=6024a+b+c=6024a+b+c=6024. Find the number of factors of 10 in the expression a!b!c!=m⋅10na!b!c!=m\cdot 10^na!b!c!=m⋅10n where mmm and nnn are integers and mmm is not divisible by 10.
Given a natural number n>1n > 1n>1. We call a positive common fraction (not necessarily in its simplest form) good if the sum of its numerator and denominator equals nnn. Prove that any positive common fraction, whose denominator is les…
For any natural number nnn, the fraction 21n+414n+3\frac{21n + 4}{14n + 3}14n+321n+4 is irreducible.
In three piles there are 51,4951, 4951,49 , and 555 stones, respectively. You can combine any two piles into one pile or divide a pile consisting of an even number of stones into two equal piles. Is it possible to get 105105105 piles with one ston…
Vasya wrote down 11 natural numbers in one notebook. Petya wrote down the greatest common divisors of each pair of numbers recorded in Vasya's notebook in another notebook. It turned out that every number written in one of the two notebooks…
may be challenge for beginner section, but anyone is able to solve it if you really try. show that for every natural n>1n > 1n>1 we have: (n−1)2∣ nn−1−1(n-1)^2|\ n^{n-1}-1(n−1)2∣ nn−1−1
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…
In a notebook, there are nnn integers written in descending order a1>a2>…>ana_{1}>a_{2}>\ldots>a_{n}a1>a2>…>an and their sum is 2520. It is known that the kkk-th number aka_{k}ak, except for the last one, obtained at k=nk=nk=n, is (k+1)(k+1)(k+1) times smaller than the su…
How many positive rational numbers less than π\piπ have denominator at most 7 when written in lowest terms? (Integers have denominator 1.)
nnn is composite. 1<a1<a2<...<ak<n1<a_1<a_2<...<a_k<n1<a1<a2<...<ak<n - all divisors of nnn . It is known, that a1+1,...,ak+1a_1+1,...,a_k+1a1+1,...,ak+1 are all divisors for some mmm (except 1,m1,m1,m ). Find all such nnn .
Find all natural numbers nnn such that n2n^2n2 does not divide n!n!n!.
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).
A function fff from the set of positive integers N+\mathbf{N}_{+}N+ to itself satisfies: for any m,n∈N+m, n \in \mathbf{N}_{+}m,n∈N+, (m2+n)2(m^2 + n)^2(m2+n)2 is divisible by f2(m)+f(n)f^2(m) + f(n)f2(m)+f(n). Prove that for every n∈N+n \in \mathbf{N}_{+}n∈N+,…
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.
Given 25 vessels with capacities 1,2,…,251, 2,\ldots, 251,2,…,25 liters, in how many ways can you choose ten of them such that any two selected vessels can be used to measure out exactly 1 liter of water? (An unlimited amount of water is available, and i…
Let x1<x2<…<x2024x_1<x_2< \ldots <x_{2024}x1<x2<…<x2024 be positive integers and let pi=∏k=1i(xk−1xk)p_i=\prod_{k=1}^{i}(x_k-\frac{1}{x_k})pi=∏k=1i(x for i=1,2,…,2024i=1,2, \ldots, 2024i=1,2,…,2024 . What is the maximal number of positive integers among the pip_ipi ?
Petya gave Vasya a number puzzle. Petya chose a digit XXX and said, "I am thinking of a three digit number that is divisible by 11. The hundreds digit is XXX and the tens digit is 3. Find the units digit." Vasya was excited because he k…
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 .