Which of the following sets of ordered pairs is a function? A { ( 6 , 1 ) , ( 7 , 3 ) , ( 4 , 2 ) , ( 6 , 2 ) } { ( 6 , 1 ) , ( 7 , 3 ) , ( 4 , 2 ) , ( 6 , 2 ) } B { ( 1 , 3 ) , ( 2 , 4 ) , ( − 1 , − 3 ) , ( − 2 , − 4 ) } { ( 1 , 3 ) , ( 2 , 4 ) , ( − 1 , − 3 ) , ( − 2 , − 4 ) } C { ( 8 , 1 ) , ( 7 , 0 ) , ( 7 , − 1 ) , ( 8 , 2 ) } { ( 8 , 1 ) , ( 7 , 0 ) , ( 7 , − 1 ) , ( 8 , 2 ) } D { ( − 2 , 4 ) , ( − 2 , 3 ) , ( − 2 , 2 ) , ( − 2 , 1 ) } Please answer fast

16

Step-by-step explanation:

We must find integers x, y with the most amount of prime divisors, not necessarily distinct, such that x + 3y < 1,000.

Obviously, this is achieved when the divisor is the least prime 2. So, we must find integers n, m such that

since , then n must be 9. For n=9 we find the greatest integer m such that  

and we find m=7

 and   ,  are the numbers we are looking for and the sum of their length is 9+7 = 16.

So, 16 is the maximum possible sum of the length of x and the length of y.