6/(x-8)=2/(x+6)
times both sides by (x-8)(x+6)
6(x+6)=2(x-8)
distribute
6x+36=2x-16
minus 2x both sides
4x+36=-16
miinus 36 both sides
4x=-52
divide both sides by 4
x=-13
Answer:
2
Step-by-step explanation:
Let's solve the given system of equations.
<u>Given system</u>
x +3y= 10 ----(1)
-2x -2y= 4 ----(2)
From (2):
-2(x +y)= 4
Dividing both sides by -2:
x +y= -2 ----(2)
Thus, options 3 and 4 are incorrect as x +y≠ -2.
(1) -(2):
(x +3y) -(x +y)= 10 -(-2)
Expand:
x +3y -x -y= 10 +2
2y= 12
Divide both sides by 2:
y= 12 ÷2
y= 6
Substitute y= 6 into (2):
x +6= -2
x= -6 -2
x= -8
Options (1) and (2) differs only by the value of the expression of -x +y. Thus, let's find its value in the given system of equations.
-x +y
= -(-8) +6
= 8 +6
= 14
Thus, option 2 is the correct option.
The circumference would be 6 inches because you do 3 times 2
Answer:
Step-by-step explanation:
Method #1
We can draw a <em>right triangle</em> on the graph upon where the points are located and use the Pythagorean Theorem:
* Whenever we talk about distance, we ONLY want the NON-NEGATIVE root.
_______________________________________________
Method #2
Or, we can use the Distance Formula:
![\sqrt{[-x_1 + x_2]^{2} + [-y_1 + y_2]^{2}} = D](https://tex.z-dn.net/?f=%5Csqrt%7B%5B-x_1%20%2B%20x_2%5D%5E%7B2%7D%20%2B%20%5B-y_1%20%2B%20y_2%5D%5E%7B2%7D%7D%20%3D%20D)
[2, 7] [3, −3]
![\sqrt{[-3 + 2]^{2} + [3 + 7]^{2}} = D](https://tex.z-dn.net/?f=%5Csqrt%7B%5B-3%20%2B%202%5D%5E%7B2%7D%20%2B%20%5B3%20%2B%207%5D%5E%7B2%7D%7D%20%3D%20D)
![\sqrt{[-1]^{2} + 10^{2}} = D](https://tex.z-dn.net/?f=%5Csqrt%7B%5B-1%5D%5E%7B2%7D%20%2B%2010%5E%7B2%7D%7D%20%3D%20D)
** You see? It does not matter which method you choose, as long as you are doing the work correctly.
I am delighted to assist you anytime.
// Input value is usernum.
// This code snippet sums 1 + 3 + 5 + ... + usernum
// The answer is stored in the variable summedvalue.
N = (int) (usernum+1)/2; // maximum number of integers to be summed
int *v = malloc(N*sizeof(int)); // allocate storage for array v
// Calculate the number of loop counts and assign array v..
count = 0;
k = 1;
while (1) {
if (k>usernum) { // do not extend v beyond usernum
break;
}
v(count) = k; // assign an odd integer to v, including usenum
count++;
k += 2; // k is an odd number
if k>usernum { // handle usernum as odd or even
k = usernum;
}
}
n = count; // the size of array v.
// Calculate the sum in a for loop
summedvalue = 0; // initialize summedvalue
for (i=0; i<=n; i++) {
summedvalue += v(i);
}
