MathDB

Problems(5)

Triangle Properties

Source:

10/21/2010
Let a,b,ca,b,c denote the sides of a triangle and [ABC][ABC] the area of the triangle as usual.
(a)(a) If 6[ABC]=2a2+bc6[ABC] = 2a^2+bc, determine A,B,CA,B,C. (b)(b) For all triangles, prove that 3a2+3b2c243[ABC]3a^2+3b^2 - c^2 \ge 4 \sqrt{3} [ABC].
geometrytrigonometrygeometry unsolved
Students getting the top mark in n subjects

Source:

11/7/2010
Students have taken a test paper in each of n3n \ge 3 subjects. It is known that in any subject exactly three students got the best score, and for any two subjects exactly one student got the best scores in both subjects. Find the smallest nn for which the above conditions imply that exactly one student got the best score in each of the nn subjects.
combinatorics unsolvedcombinatorics
Sparse Subsets

Source:

12/9/2010
Let n>1n > 1 be an integer.
A set S{0,1,2,,4n1}S \subseteq \{ 0, 1, 2, \cdots , 4n - 1 \} is called ’sparse’ if for any k{0,1,2,,n1}k \in \{ 0, 1, 2, \cdots , n - 1 \} the following two conditions are satisfied:
(a)(a) The set S{4k2,4k1,4k,4k+1,4k+2}S \cap \{4k - 2, 4k - 1, 4k, 4k + 1, 4k + 2 \} has at most two elements;
(b)(b) The set S{4k+1,4k+2,4k+3}S \cap \{ 4k +1, 4k +2, 4k +3 \} has at most one element. Prove that there are exactly 87n18 \cdot 7^{n-1} sparse subsets.
combinatorics unsolvedcombinatorics
Nice Floors

Source:

12/9/2010
Solve the equation for positive integers m,nm, n: m2n+n2m=mn+nm+mn\left \lfloor \frac{m^2}n \right \rfloor + \left \lfloor \frac{n^2}m \right \rfloor = \left \lfloor \frac mn + \frac nm \right \rfloor +mn
floor functionnumber theory unsolvednumber theory
Find all Polynomials

Source:

12/9/2010
Find all polynomials PP with integer coefficients which satisfy the property that, for any relatively prime integers aa and bb, the sequence {P(an+b)}n1\{P (an + b) \}_{n \ge 1} contains an infinite number of terms, any two of which are relatively prime.
algebrapolynomialmodular arithmeticinductionnumber theoryrelatively primealgebra unsolved