olymmath

Putnam 1967 A6

  • Session A

Given real numbers (ai)(a_i) and (bi)(b_i) (for i=1,2,3,4i=1,2,3,4 ) such that a1b2≠a2b1.a_1 b _2 \ne a_2 b_1 . Consider the set of all solutions (x1,x2,x3,x4)(x_1 ,x_2 ,x_3 , x_4) of the simultaneous equations a1x1+a2x2+a3x3+a4x4=0  and  b1x1+b2x2+b3x3+b4x4=0a_1 x_1 +a _2 x_2 +a_3 x_3 +a_4 x_4 =0 \; \text{and}\; b_1 x_1 +b_2 x_2 +b_3 x_3 +b_4 x_4 =0 for which no xix_i is zero. Each such solution generates a 44 -tuple of plus and minus signs (by considering the sign of xix_i ). [list=a] [] Determine, with proof, the maximum number of distinct 44 -tuples possible. [] Investigate necessary and sufficient conditions on (ai)(a_i) and (bi)(b_i) such that the above maximum of distinct 44 -tuples is attained.

Dataset text AI-MO AoPS. 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 putnam/1967/a6 · Tag WZJ69TTGYF · Edit this page on GitHub · Keys: j next, k previous