The part about logical reasoning in www.haizhiyin.cn's SAT math problem-solving method is unique in the SAT math exam, but it is not common in domestic exams. This kind of topic has nothing to do with mathematical operation, but it is very novel. At first glance, it's confusing, but in fact, it's very easy to solve the problem as long as you master the right methods. So, how to solve the SAT mathematical logic reasoning problem? Example: Number of Families with Conservative Nights Jackson 10 Karan 5 Epstein 8 Liu 6 Benton 8 The table above shows the number of conservative nights tha. During the 14 night, each of the five families stayed in a hotel. If the accommodation time of the Liu family does not overlap with the accommodation time of the Benton family, which night in 14 may only have one of the five families staying in this hotel? A. The third B. The fifth C. The sixth D. The eighth E. The 10 problem only needs the help of line segments. Be clear at a glance. Since the original text says "the check-in of the Liu family does not overlap with the check-in of the Benton family" and the two families add up to exactly 14 night, we might as well set this 14 night as a line segment with a length of 14cm. From 6cm: Liu Bentong's family ︳ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ Because the Jackson family stayed the longest among the other families, it can be seen from his family. This problem can be simply translated into a line segment with the length of 10cm moving back and forth in the range of 14cm, or exposing the leftmost space of 0~4cm (excluding 4). Or leave the rightmost area of 10~ 14cm (excluding 10). So only these two areas are not covered by the Jackson family, which means that only one family can live in the first three days or the last three days. The answer is a.