MathDB

Problems(8)

24 robots with a 70degree field of view

Source: Iran MO 3rd round 2016 mid-terms - Combinatorics P3

9/6/2016
There are 2424 robots on the plane. Each robot has a 7070^{\circ} field of view. What is the maximum number of observing relations? (Observing is a one-sided relation)
Irancombinatoricsgraph theoryDirected graphs
Sequences and polynomials

Source: Iranian 3rd round 2016 first Algebra exam

8/13/2016
Do there exists many infinitely points like (x1,y1),(x2,y2),...(x_1,y_1),(x_2,y_2),... such that for any sequences like {b1,b2,...b_1,b_2,...} of real numbers there exists a polynomial P(x,y)R[x,y]P(x,y)\in R[x,y] such that we have for all ii : P(xi,yi)=biP(x_{i},y_{i})=b_{i}
algebrapolynomial
Iran geometry

Source: Iranian 3rd round 2016 first geometry exam problem 3

8/14/2016
Let ABCABC be a triangle and let AD,BE,CFAD,BE,CF be its altitudes . FA1,DB1,EC1FA_{1},DB_{1},EC_{1} are perpendicular segments to BC,AC,ABBC,AC,AB respectively. Prove that : ABCABC~A1B1C1A_{1}B_{1}C_{1}
geometry
Golden Residue

Source: Iran MO 3rd round 2016 mid-terms - Number Theory P3

9/6/2016
Let mm be a positive integer. The positive integer aa is called a golden residue modulo mm if gcd(a,m)=1\gcd(a,m)=1 and xxa(modm)x^x \equiv a \pmod m has a solution for xx. Given a positive integer nn, suppose that aa is a golden residue modulo nnn^n. Show that aa is also a golden residue modulo nnnn^{n^n}.
Proposed by Mahyar Sefidgaran
number theorymodular arithmeticIran
Angle bisectors

Source: Iran MO 3rd round 2016 finals - Geometry P3

9/5/2016
Given triangle ABC\triangle ABC and let D,E,FD,E,F be the foot of angle bisectors of A,B,CA,B,C ,respectively. M,NM,N lie on EFEF such that AM=ANAM=AN. Let HH be the foot of AA-altitude on BCBC. Points K,LK,L lie on EFEF such that triangles AKL,HMN\triangle AKL, \triangle HMN are correspondingly similiar (with the given order of vertices) such that AK∦HMAK \not\parallel HM and AK∦HNAK \not\parallel HN.
Show that: DK=DLDK=DL
geometryangle bisectorIran
Functional Equation

Source: Iran MO 3rd round 2016 finals - Algebra P3

9/1/2016
Find all functions f:R+R+f:\mathbb {R}^{+} \rightarrow \mathbb {R}^{+} such that for all positive real numbers x,y:x,y:
f(y)f(x+f(y))=f(x)f(xy)f(y)f(x+f(y))=f(x)f(xy)
algebrafunctional equationfunctionIran
Number Theory

Source: Iran MO 3rd round 2016 finals - Number Theory P3

9/4/2016
A sequence P={an}P=\left \{ a_{n} \right \} is called a Permutation \text{Permutation} of natural numbers (positive integers) if for any natural number m,m, there exists a unique natural number nn such that an=m.a_n=m.
We also define Sk(P)S_k(P) as: Sk(P)=a1+a2++akS_k(P)=a_{1}+a_{2}+\cdots +a_{k} (the sum of the first kk elements of the sequence).
Prove that there exists infinitely many distinct Permutations \text{Permutations} of natural numbers like P1,P2,P_1,P_2, \cdots such that:: k,i<j:Sk(Pi)Sk(Pj)\forall k, \forall i<j: S_k(P_i)|S_k(P_j)
number theoryIran
Coloring a 30*30 table

Source: Iran MO 3rd round 2016 finals -Combinatorics P3

9/6/2016
A 30×3030\times30 table is given. We want to color some of it's unit squares such that any colored square has at most kk neighbors. ( Two squares (i,j)(i,j) and (x,y)(x,y) are called neighbors if ix,jy0,1,1(mod30)i-x,j-y\equiv0,-1,1 \pmod {30} and (i,j)(x,y)(i,j)\neq(x,y). Therefore, each square has exactly 88 neighbors) What is the maximum possible number of colored squares if::
a)k=6a) k=6
b)k=1b)k=1
modular arithmeticcombinatoricstableColoring