John is playing a game in which he tries to obtain the highest number possible. He must put the symbols , $\times$, and - (plus, times, and minus) in the following blanks, using each symbol exactly once:\[ 2 \underline{\phantom{8}} 4 \underlined phantom{8}} 6 \underline{\hphantom{8}} 8. \]John cannot use parentheses or rearrange the numbers. What is the highest possible number that John could obtain

Nicolo paganini's numbers 1184 and 1210 are amicable. the proper divisors of 1184 are 1, 2, 4, 8, 16, 32, 37, 74, 148, 296, and 592. the proper divisors of 1210 are 1, 2, 5, 10, 11, 22, 55, 110, 121, 242, and 605. use the definition of amicable (friendly) numbers to show that they are indeed amicable. which of the folowing statement uses the definition of amicable numbers to show that 1184 and 1210 are indeed amicable? o a. o b. ° c. the sum of proper divisors of 1184 is 1210 and the sum of proper divisors of 1210 is 1184 the sum of proper divisors of 1184 is greater than 1210 and the sum of proper divisors of 1210 is greater than 1184 the sum of proper divisors of 1184 is less than 1210 and the sum of proper divisors of 1210 is less than 1184