HMMT 二月 2017 · 冲刺赛 · 第 11 题
HMMT February 2017 — Guts Round — Problem 11
题目详情
英文原题
- [ 7 ] Consider the graph in 3-space of
0 = xyz ( x + y )( y + z )( z + x )( x − y )( y − z )( z − x ) .
This graph divides 3-space into N connected regions. What is N ?
解析
英文解析
- [ 7 ] Consider the graph in 3-space of
0 = xyz ( x + y )( y + z )( z + x )( x − y )( y − z )( z − x ) .
This graph divides 3-space into N connected regions. What is N ?
Proposed by: Evan Chen
Answer: 48
Note that reflecting for each choice of sign for x, y, z , we get new regions. Therefore, we can restrict tothe case where x, y, z > 0 . In this case, the sign of the expression only depends on ( x − y )( y − z )( z − x ) .
It is easy to see that for this expression, every one of the 3! = 6 orderings for { x, y, z } contributes aregion.
Therefore, our answer is 2 · 3! = 48 .3