If there were a solution to the equation x to the n plus y to the n plus
If there were a solution to the equation x to the n plus y to the n plus z to the n equals zero, it would be an example of the Wall-Sun-Sun type of these numbers. An elementary proof that the quantity of these numbers less than x divided by x over log x is equal to one was provided by Paul Erdos and Alte Selberg. In 2013, Yitan Zhang found that the number of pairs of this type of number differing by less than 70 million was infinite. By considering all of them multiplied together and then (*) adding one, which is not divisible by the heretofore multiplied numbers, Euclid proved that there are an infinitely many of them. That every number greater than one can be factored into a unique representation with these numbers is the fundamental theorem of arithmetic. For 10 points, name this type of number divisible by only one and itself.
If there were a solution to the equation x to the n plus y to the n plus
prime numbers