Answer:
A
Step-by-step explanation:
Hey There!
So these triangles are congruent so segment CD is equal to segment DB
so to find x we use the equation
7x+10=10x+7
now we solve for x
step 1 subtract each side by 7
10-7=3
7-7 cancels out
now we have 7x+3=10x
step 2 subtract each side by 7 x
10x-7x=3x
7x-7x= cancels out
now we have
3x=3
step 3 divide each side by 3
3/3=1
3/3 cancels out
now we have
x=1
Answer:
the answer is D 1+ /19;
Step-by-step explanation:
Answer:
Greatest sack = 42
1 candy bar and 3 lollipops
<em></em>
Step-by-step explanation:
Represent Candy bars with C and Lollipops with L
![C = 42](https://tex.z-dn.net/?f=C%20%3D%2042)
![L= 126](https://tex.z-dn.net/?f=L%3D%20126)
Solving (a): Greatest number of treat sacks
To solve this, we simply calculate the GCF of C and L
![42 = 2^1 * 3^1 * 7^1](https://tex.z-dn.net/?f=42%20%3D%202%5E1%20%2A%203%5E1%20%2A%207%5E1)
![126 = 2^1 * 3^2 * 7^1](https://tex.z-dn.net/?f=126%20%3D%202%5E1%20%2A%203%5E2%20%2A%207%5E1)
Hence, the GCF is
![GCF = 2^1 * 3^1 * 7^1](https://tex.z-dn.net/?f=GCF%20%3D%202%5E1%20%2A%203%5E1%20%2A%207%5E1)
![GCF = 42](https://tex.z-dn.net/?f=GCF%20%3D%2042)
Hence, greatest number of sack is 42
Solving (b): Number of treat in each sack.
To do this, we simply divide the number of C and L by the calculated GCF
For C:
![Treats = \frac{C}{GCF}](https://tex.z-dn.net/?f=Treats%20%3D%20%5Cfrac%7BC%7D%7BGCF%7D)
![Treats = \frac{42}{42}](https://tex.z-dn.net/?f=Treats%20%3D%20%5Cfrac%7B42%7D%7B42%7D)
![Treats = 1](https://tex.z-dn.net/?f=Treats%20%3D%201)
For L:
![Treats = \frac{L}{GCF}](https://tex.z-dn.net/?f=Treats%20%3D%20%5Cfrac%7BL%7D%7BGCF%7D)
![Treats = \frac{126}{42}](https://tex.z-dn.net/?f=Treats%20%3D%20%5Cfrac%7B126%7D%7B42%7D)
![Treats = 3](https://tex.z-dn.net/?f=Treats%20%3D%203)
<em>Hence, 1 candy bar and 3 lollipops</em>
Answer:
12,6,3
Step-by-step explanation:
its dividing by half
5 years you will make the same salary equaling $35,000