Home Competitions ILL 1983 Problem 33
Let F ( n ) F(n) F ( n ) be the set of polynomials P ( x ) = a 0 + a 1 x + ⋯ + a n x n P(x) = a_0+a_1x+\cdots+a_nx^n P ( x ) = a 0 + a 1 x + ⋯ + a n x n , with a 0 , a 1 , . . . , a n ∈ R a_0, a_1, . . . , a_n \in \mathbb R a 0 , a 1 , ... , a n ∈ R and 0 ≤ a 0 = a n ≤ a 1 = a n − 1 ≤ ⋯ ≤ a [ n / 2 ] = a [ ( n + 1 ) / 2 ] . 0 \leq a_0 = a_n \leq a_1 = a_{n-1 } \leq \cdots \leq a_{[n/2] }= a_{[(n+1)/2]}. 0 ≤ a 0 = a n ≤ a 1 = a n − 1 ≤ ⋯ ≤ a [ n /2 ] = a [( n + 1 ) /2 ] . Prove that if f ∈ F ( m ) f \in F(m) f ∈ F ( m ) and g ∈ F ( n ) g \in F(n) g ∈ F ( n ) , then f g ∈ F ( m + n ) . fg \in F(m + n). f g ∈ F ( m + n ) .
Dataset text AoPS wiki problems . Quoted with source.
Solutions
No solution is on olymmath yet. Official and human solutions come first when they arrive. AI solutions come after them, with a label.
Add a solution
Similar problems
These problems have the most words in common with this statement.
Locator ill/1983/p33 · Tag WMEJQ3KD6K · Edit this page on GitHub · Keys: j next, k previous