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
maxonik [38]
3 years ago
12

Which expression is equivalent to A+ A+ A+ B+ B+ B

Mathematics
1 answer:
lakkis [162]3 years ago
4 0

3a + 3b

combine like terms: a+a+a=3a

b+b+b=3b

3a +3b

                         

                     

You might be interested in
Evaluate −3w − 6p for w=2 and p = −7
kap26 [50]

-3w-6p when w=2 and p=-7

-3(2)-6(-7)

= -6 + 42

= 36

7 0
3 years ago
Read 2 more answers
Use the Euclidean Algorithm to compute the greatest common divisors indicated. (a) gcd(20, 12) (b) gcd(100, 36) (c) gcd(207, 496
coldgirl [10]

Answer:

(a) gcd(20, 12)=4

(b) gcd(100, 36)=4

(c) gcd(496,207 )=1

Step-by-step explanation:

The Euclidean algorithm is an efficient method for computing the greatest common divisor of two integers, without explicitly factoring the two integers.

The Euclidean algorithm solves the problem:

<em>                                   Given integers </em>a, b<em>, find </em>d=gcd(a,b)<em />

Here is an outline of the steps:

  1. Let a=x, b=y.
  2. Given x, y, use the division algorithm to write x=yq+r.
  3. If r=0, stop and output y; this is the gcd of a, b.
  4. If r\neq 0, replace (x,y) by (y,r). Go to step 2.

The division algorithm is an algorithm in which given 2 integers N and D, it computes their quotient Q and remainder R.

Let's say we have to divide N (dividend) by D (divisor). We will take the following steps:

Step 1: Subtract D from N repeatedly.

Step 2: The resulting number is known as the remainder R, and the number of times that D is subtracted is called the quotient Q.

(a) To find gcd(20, 12) we apply the Euclidean algorithm:

20 = 12\cdot 1 + 8\\ 12 = 8\cdot 1 + 4\\ 8 = 4\cdot 2 + 0

The process stops since we reached 0, and we obtain gcd(20, 12)=4.

(b) To find gcd(100, 36) we apply the Euclidean algorithm:

100 = 36\cdot 2 + 28\\ 36 = 28\cdot1 + 8\\ 28 = 8\cdot 3 + 4\\ 8 = 4\cdot 2 + 0

The process stops since we reached 0, and we obtain gcd(100, 36)=4.

(c) To find gcd(496,207 ) we apply the Euclidean algorithm:

496 = 207\cdot 2 + 82\\ 207 = 82\cdot 2 + 43\\ 82 = 43\cdot 1 + 39\\ 43 = 39\cdot 1 + 4\\ 39 = 4\cdot 9 + 3\\ 4 = 3\cdot 1 + 1\\ 3 = 1\cdot 3 + 0

The process stops since we reached 0, and we obtain gcd(496,207 )=1.

3 0
3 years ago
A number line has marks A question mark, negative 2, B question mark, 0, 1, C-2, 3, D question mark, 5, E 6.
slavikrds [6]

Answer:

What number is represented by point B = -1  

Which point represents the number 2? = C

3 0
3 years ago
Read 2 more answers
3. What is the value of x​
ad-work [718]

Answer:

10

Step-by-step explanation:

using HYPOTHENUS theorem

8^2 + 6^2 = x^2

64 + 36= 100

√100=10

3 0
3 years ago
Read 2 more answers
Sooo Help please I'm Not smart lol&lt;33
Oksana_A [137]
Each hiker will receive 6 ounces each.
3 0
3 years ago
Read 2 more answers
Other questions:
  • Help me please,Thanks
    10·1 answer
  • What is the y in 14-6y=44
    6·2 answers
  • What is the approximate side length of a square game board with and area of 188 in. squared.
    7·2 answers
  • A tin of baked beans weighs 532g .The tins are sold in packs of 4.How much would 2 packs weigh .Write the answer in Kilograms .​
    13·2 answers
  • HELP PLS I WILL GIVE BRAINLIEST. NO LINKS!!!
    12·1 answer
  • HELPPPPPPPP What is angle “BEC” ??
    15·1 answer
  • What is 11/12 divided by 1/3
    9·2 answers
  • The graph of quadratic functiong is shown on the grid. The coordinates of the x-intercepts, they-intercept, and the vertex are i
    14·1 answer
  • How would you write 845 as a multiplication expressions
    11·1 answer
  • Classify the triangle by angles and sides and find its area .
    6·1 answer
Add answer
Login
Not registered? Fast signup
Signup
Login Signup
Ask question!