0
Add your answer:
Earn +20 pts
How do you solve t to the second power equals 78?
If T2 = 78, then T = 78(1/2) or the square root of 78, or about 8.83.
What is the solution to t2-16t plus 65 equals 0?
It has no solutions because the discriminant of b2-4ac is less than zero
How do you factor T2 plus 4T?
T(t + 4)
How do you factor t2 plus 6t-7?
(t + 7)(t - 1)
What is 330 equals 2tsquared?
2(t2) = 330: t2 = 165: t = 12.85 (2t)2 = 330: 2t = 18.16: t = 9.08
Can you Factor t times t plus 7 equals 4 times 3 plus 2t?
If you mean t(t+7) = 4(3+2t), then it is factored. If you meant solve for 't', then the solution is t = t2 - 12.
How do you solve t to the second power equals 78?
If T2 = 78, then T = 78(1/2) or the square root of 78, or about 8.83.
What is the solution to t2-16t plus 65 equals 0?
It has no solutions because the discriminant of b2-4ac is less than zero
V1 equals 30L V2 equals 74L T1 equals 280K T2 equals?
Using equation of Charles's law, we get, V1T2=V2T1 30 xT2 = 74 x 280 => T2 =74 x 280/30 T2 = 690.67 K
T2 minus 59t plus 54 minus 82t2 plus 60t?
t2 - 59t + 54 - 82t2 + 60t = - 81t2 + t + 54
How would you re-arrange h equals G x T2 over 2 to make g the subject?
g = 2h/t2
How do you factor T2 plus 4T?
T(t + 4)
The equation p1v1 t1 equals p2v2 t2 is known as the what?
Avogardo's Law
Factor 77-18T plus T2?
(t - 7)(t - 11)
How do you factor t2 plus 6t-7?
(t + 7)(t - 1)
What is 330 equals 2tsquared?
2(t2) = 330: t2 = 165: t = 12.85 (2t)2 = 330: 2t = 18.16: t = 9.08
An algorithm that shows nth term in Fibonacci sequence and determines wheather they are prime?
PRINT: Fibonacci sequence number n, is it prime? PRINT: n: READ: n for( i EQUALS 0; WHILE i Less Than n-2; Add 1 to i each loop) { temp = t1 + t2 // t2 is current number, t1 is last number t1 = t2 t2 = temp } for( i EQUALS 2; WHILE i Less Than (t2 DIVIDED BY 2); Add 1 to i each loop) { if( t2 MOD i == 0) { NOT PRIME } } PRIME NOTE: MOD is % in most programming languages, it gives the remainder when the first number is divided by the second.
