answersLogoWhite

0


Best Answer

I'm guessing you want to solve for t so:

3t-6=t-2

u bring the t from the left side and subtract it from the 3t and u get 2t b/c 3-1 is 2

2t-6=2

then u bring the 6 over to the right side and u add it to the 2 and u get

2t=8

and then u divide 8 by 2 and u get

t=4

if u dont understand u shud probably go to an algebra teacher because they can explain it better

User Avatar

Wiki User

βˆ™ 15y ago
This answer is:
User Avatar

Add your answer:

Earn +20 pts
Q: How do you solve 3t-6 equals t-2?
Write your answer...
Submit
Still have questions?
magnify glass
imp
Related questions

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.


How do you solve St plus 3t6 For S?

Unfortunately, limitations of the browser used by Answers.com means that we cannot see most symbols. It is therefore impossible to give a proper answer to your question. Please resubmit your question spelling out the symbols as "plus", "minus", "times", "divided by", "equals".


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


How would you re-arrange h equals G x T2 over 2 to make g the subject?

g = 2h/t2


The equation p1v1 t1 equals p2v2 t2 is known as the what?

Avogardo's Law


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 4y plus x equals 8?

How do you solve 4y plus x equals 8


How do you solve 47 equals x21x equals?

121 is the answer


What is 330 equals 2tsquared?

2(t2) = 330: t2 = 165: t = 12.85 (2t)2 = 330: 2t = 18.16: t = 9.08


What P1v1 divided by t1p2v2 divided by t2 solve for t1?

This question refers to the combined gas law: (P1V1)/T1=(P2V2)/T2, where P is pressure, V is volume, and T is temperature in Kelvins.To solve for T1, rearrange the equation to isolate T1.T1=(P1V1T2)/(P2V2)


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.


How do you solve the quadratic equation t2 4t equals 21 by factoring?

Subtract 21 from both sides. If that's + 4t, the answer is (t - 3)(t + 7) and t = 3, -7 If that's - 4t, the answer is (t + 3)(t - 7) and t = -3, 7