For any integer k > 1, the term "length of an integer" refers to the number of positive prime factors, not necessarily distinct, whose product is equal to k. for example, if k = 24, the length of k is equal to 4, since 24 = 2 × 2 × 2 × 3. if x and y are positive integers such that x > 1, y > 1, and x + 3y < 1,000, what is the maximum possible sum of the length of x and the length of y?

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.

answer: .75 km

step-by-step explanation:

(sin 42)/31. = sinx)/37

sinx = 37 (sin42)/31

= 37× 0.66/31 = 0.787

x= 51.9

other angle opposite to y = 180-51.9-42

= 180- 93.9 =86.1

so

sin42)/31 = sin 86.1)/y

0.021 = 0.997 /y

y= 0.997/0.021 =47.47