https://www.gregmat.com/problems/quant?problem=how-many-lists-of-3-numbers-exist-where
This question specifies a “unique mode” for every list of numbers, however the solution says the numbers in the list must take the form [(1,2,3,4)5,5] where, for example, [1,5,5] and [2,5,5] are both separate lists and valid answers. But how can these both be vaild answers if they do not have unique modes? The mode of both is 5. In fact, any list in the format [(1,2,3,4)5,5] OR [5,5, (6,7,8,9,10)] will have the SAME mode: 5. How can all of these answers be part of the solution if they do not meet the requirement for having a unique mode?