MathDB

Problems(8)

Inequality

Source: Iran 3rd round 2017 first Algebra exam

8/7/2017
Let a,b,ca,b,c and dd be positive real numbers such that a2+b2+c2+d24a^2+b^2+c^2+d^2 \ge 4. Prove that (a+b)3+(c+d)3+2(a2+b2+c2+d2)4(ab+bc+cd+da+ac+bd)(a+b)^3+(c+d)^3+2(a^2+b^2+c^2+d^2) \ge 4(ab+bc+cd+da+ac+bd)
inequalitiesmixing
Number theory: sequence

Source: Iran 3rd round 2017 Number theory first exam-P2

8/9/2017
Consider a sequence {ai}i1\{a_i\}^\infty_{i\ge1} of positive integers. For all positvie integers nn prove that there exists infinitely many positive integers kk such that there is no pair (m,t)(m,t) of positive integers where m>nm>n and kn+an=tm(m+1)+amkn+a_n=tm(m+1)+a_m
number theorynumber theory with sequencesSequence
Iran geometry

Source: Iran MO 3rd round 2017 mid-terms - Geometry P2

8/10/2017
Let ABCDABCD be a trapezoid (AB<CD,ABCDAB<CD,AB\parallel CD) and PADBCP\equiv AD\cap BC. Suppose that QQ be a point inside ABCDABCD such that QAB=QDC=90BQC\angle QAB=\angle QDC=90-\angle BQC. Prove that PQA=2QCD\angle PQA=2\angle QCD.
geometrytrapezoidAngle Chasing
easy number theory from iran

Source: Iran third round 2017 number theory , final exam

9/1/2017
For prime number qq the polynomial P(x)P(x) with integer coefficients is said to be factorable if there exist non-constant polynomials fq,gqf_q,g_q with integer coefficients such that all of the coefficients of the polynomial Q(x)=P(x)fq(x)gq(x)Q(x)=P(x)-f_q(x)g_q(x) are dividable by qq ; and we write: P(x)fq(x)gq(x)(modq)P(x)\equiv f_q(x)g_q(x)\pmod{q} For example the polynomials 2x3+2,x2+1,x3+12x^3+2,x^2+1,x^3+1 can be factored modulo 2,3,p2,3,p in the following way:
{X2+1(x+1)(x+1)(mod2)2x3+2(2x1)3(mod3)X3+1(x+1)(x2x+1)\left\{\begin{array}{lll} X^2+1\equiv (x+1)(-x+1)\pmod{2}\\ 2x^3+2\equiv (2x-1)^3\pmod{3}\\ X^3+1\equiv (x+1)(x^2-x+1) \end{array}\right.
Also the polynomial x22x^2-2 is not factorable modulo p=8k±3p=8k\pm 3.
a) Find all prime numbers pp such that the polynomial P(x)P(x) is factorable modulo pp: P(x)=x42x3+3x22x5P(x)=x^4-2x^3+3x^2-2x-5 b) Does there exist irreducible polynomial P(x)P(x) in Z[x]\mathbb{Z}[x] with integer coefficients such that for each prime number pp , it is factorable modulo pp?
number theorypolynomialalgebra
P2- first combinatorics exam of 2017 Iran MO 3rd round

Source: 2017 Iran MO 3rd round, first combinatorics exam P2

9/12/2017
An angle is considered as a point and two rays coming out of it. Find the largest value on nn such that it is possible to place nn 6060 degree angles on the plane in a way that any pair of these angles have exactly 44 intersection points.
Irancombinatorics
Iran Geometry

Source: Iran MO 3rd round 2017 finals - Geometry P2

9/3/2017
Assume that PP be an arbitrary point inside of triangle ABCABC. BPBP and CPCP intersects ACAC and ABAB in EE and FF, respectively. EFEF intersects the circumcircle of ABCABC in BB' and CC' (Point EE is between of FF and BB'). Suppose that BPB'P and CPC'P intersects BCBC in CC'' and BB'' respectively. Prove that BBB'B'' and CCC'C'' intersect each other on the circumcircle of ABCABC.
geometrycircumcircle
Complex Polynomial

Source: Iran 3rd round-2017-Algebra final exam-P2

9/2/2017
Let P(z)=adzd++a1z+a0P(z)=a_d z^d+\dots+ a_1z+a_0 be a polynomial with complex coefficients. The reversereverse of PP is defined by P(z)=a0zd+a1zd1++adP^*(z)=\overline{a_0}z^d+\overline{a_1}z^{d-1}+\dots+\overline{a_d} (a) Prove that P(z)=zdP(1z)P^*(z)=z^d \overline{ P\left( \frac{1}{\overline{z}} \right) } (b) Let mm be a positive integer and let q(z)q(z) be a monic nonconstant polynomial with complex coefficients. Suppose that all roots of q(z)q(z) lie inside or on the unit circle. Prove that all roots of the polynomial Q(z)=zmq(z)+q(z)Q(z)=z^m q(z)+ q^*(z) lie on the unit circle.
algebrapolynomialcomplex numbersIran
P2- second combinatorics exam of 2017 Iran MO 3rd round

Source: 2017 Iran MO 3rd round, second combinatorics exam P2

9/12/2017
Two persons are playing the following game on a n×mn\times m table, with drawn lines: Person #1\#1 starts the game. Each person in their move, folds the table on one of its lines. The one that could not fold the table on their turn loses the game. Who has a winning strategy?
Irancombinatorics