Subcontests
(5)How to solve this?
Let {an}n=1∞ be a sequence of positive integers such that a1=1. For each n≥1, an+1 is the smallest positive integer, distinct from a1,a2,...,an, such that gcd(an+1an+1,ai)=1 for each i=1,2,...,n. Prove that every positive integer appears in {an}n=1∞. Bramerican Geo?
Let ABC be a triangle and Ω its circumcircle. Let the internal angle bisectors of ∠BAC,∠ABC,∠BCA intersect BC,CA,AB on D,E,F, respectively. The perpedincular line to EF through D intersects EF on X and AD intersects EF on Z. The circle internally tangent to Ω and tangent to AB,AC touches Ω on Y. Prove that (XYZ) is tangent to Ω. Good pairs
A pair (a,b) of positive integers is good if gcd(a,b)=1 and for each pair of sets A,B of positive integers such that A,B are, respectively, complete residues system modulo a,b, there are x∈A,y∈B such that gcd(x+y,ab)=1. For each pair of positive integers a,k, let f(N) the number of b≤N such b has k distinct prime factors and (a,b) is good. Prove that
n→∞liminff(n)/(logn)kn≥ek