HELPPPO i need that solved

Step-by-step explanation:

3*U/E = T                Multiply both sides by E

3*U*E / E = T*E       Combine

3U = TE                   Divide by 3

U = TE/3

That is your answer. You cannot come to any numerical answer because you do not know the values for T and E

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.