1answer.
Ask question
Login Signup
Ask question
All categories
  • English
  • Mathematics
  • Social Studies
  • Business
  • History
  • Health
  • Geography
  • Biology
  • Physics
  • Chemistry
  • Computers and Technology
  • Arts
  • World Languages
  • Spanish
  • French
  • German
  • Advanced Placement (AP)
  • SAT
  • Medicine
  • Law
  • Engineering
Bad White [126]
3 years ago
6

3(x-2) + 7x = 1/2(6x-2)

Mathematics
1 answer:
victus00 [196]3 years ago
7 0

Answer:

x=5/8

Step-by-step explanation:

11x-6=3x-1

-3x        -3x

8x-6=-1

   +6   +6

8x=5

8/8   5/8

x=5/8

You might be interested in
-10 = 2 – 21 <br> Solve for the variable
Arturiano [62]

-10=-19 is the answer goodluck

5 0
2 years ago
Ayanna plans to bake 3 types of cookies to take to a party. She needs to be sure that she has enough flour. The chocolate cookie
djyliett [7]
The children brought 2+1+114=414 cups of flour and 14+12+34=112 cups of butter.

They have enough flour for

414÷34===174×43173523
batches and they have enough butter for

112÷13===32×3192412
batches, so the butter is the limiting factor. Thus, they can make 4 whole batches of a dozen cookies each.
7 0
2 years ago
Read 2 more answers
I will give brainliest answer
adell [148]

Answer: A=351.68 cm²

Step-by-step explanation:

To find the area of the shaded region, we would subtract the area of the circle by the area of the inner circle.

Area of Circle

A=\pi r^2

A=\pi (11)^2

A=121\pi

Area of inner (white) circle

A=\pi r^2

A=\pi (3)^2

A=9\pi

Now that we have the area to the circle and inner circle, we would subtract to find the area of the shaded region.

A=121\pi -9\pi

A=112\pi

A=351.68 cm^2

3 0
3 years ago
Question above. (BRAINLY WANTS ME TO MAKE THE QUESTION 20 CHARACTERS LONG)
stepladder [879]

Answer:

10. 32 & 37

11. 3 & 4

(っ◔◡◔)っ ♥ Hope It Helps, Please Consider giving Brainliest ♥

(P.S. if you need an explanation just ask in comments)

7 0
3 years ago
The scheme where you can find the greatest common divisor of two integers by repetitive application of the division algorithm is
HACTEHA [7]

Answer:

False

Step-by-step explanation:

Euclidean Algorithm is the algorithm that allows us to find the greatest common divisor (gcd) of two integers by repetitive application of the division algorithm.

A division algorithm is an algorithm which, given two integers N and D, computes their quotient and/or remainder.

Quotient and/or Remainder = \frac{N}{D}

8 0
3 years ago
Other questions:
  • How to solve equation by factoring 3x^2+16x-44=0
    14·1 answer
  • What is this simplified?
    15·2 answers
  • MATH HELP!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!! PLEASE reposting cause no one answered them
    15·1 answer
  • A group of veterinary researchers plan a study to estimate the average number of enteroliths in horses suffering from them. The
    10·1 answer
  • What percent of 67.5 is 7.02
    5·1 answer
  • What is the interquartile range of this data set? <br><br> Key: 1|5 means 15
    12·1 answer
  • Choose the point-slope form of the equation below that represents the line that passes through the points (-3, 2) and (2,1).
    12·1 answer
  • Solve for x. 4 In (4x) = 16
    6·2 answers
  • Hiii please help thanks
    13·2 answers
  • A copy machine makes 44 copies per minute . how many copies does it make in 3 minutes and 45 seconds
    15·1 answer
Add answer
Login
Not registered? Fast signup
Signup
Login Signup
Ask question!