All categories

3 years ago

For all real values of m, 8 + 3(m - 5) =?

Mathematics

1 answer:

sineoko [7]3 years ago

7 0

Answer:

We have the value as 3m-7

Step-by-step explanation:

It is given that we have the real number m. Now we are required to find the simplified form or the value of the expression: $8 + 3(m - 5)$

Thus we can write it as:

$8 + 3(m - 5)\\=8 + 3m-3\cdot \:5$

Here we have to use the property:

$a\left(b-c\right)=ab-ac$

So now we have:

$8 + 3m-3\cdot \:5\\=8+3m-15\\=3m-7$

So this is the required final value of the expression.

You might be interested in

6th-grade math, fill out the table! :)

Svetradugi [14.3K]

Answer:

21 wins, table is attached.

Step-by-step explanation:

The ratio of 7 wins to 2 losses is 7:2. A ratio is just saying that every time one value is increased by 7, the other is increased by 2.

So we can fill out the table, in every iteration wins increases by 7 and losses increases by 2.

When we fill this out, we find that when losses is 6, wins is 21, so when you have 2 losses you have 21 wins.

Hope this helped!

4 0

3 years ago

The question is in the image below.

sineoko [7]

Answer:

The Recursive Formula for the sequence is:

$\:a_n=\frac{1}{5}\left(a_{n-1}\right)$ ; a₁ = 125

Hence, option D is correct.

Step-by-step explanation:

We know that a geometric sequence has a constant ratio 'r'.

The formula for the nth term of the geometric sequence is

$a_n=a_1\cdot r^{n-1}$

where

aₙ is the nth term of the sequence

a₁ is the first term of the sequence

r is the common ratio

We are given the explicit formula for the geometric sequence such as:

$a_n=125\left(\frac{1}{5}\right)^{n-1}$

comparing with the nth term of the sequence, we get

a₁ = 125

r = 1/5

Recursive Formula:

We already know that

a₁ = 125

r = 1/5

We know that each successive term in the geometric sequence is 'r' times the previous term where 'r' is the common ratio.

i.e.

$a_n=ra_{n-1}$

Thus, substituting r = 1/5

$\:a_n=\frac{1}{5}\left(a_{n-1}\right)$

and a₁ = 125.

Therefore, the Recursive Formula for the sequence is:

$\:a_n=\frac{1}{5}\left(a_{n-1}\right)$ ; a₁ = 125

Hence, option D is correct.

3 0

3 years ago

Helppppppppplppppppp

irinina [24]

Answer:

number 1 is 2 number 2 is 15 number 4 is 30

Step-by-step explanation:

6 0

3 years ago

List the ordered pairs in the equivalence relations produced by these partitions of {a, b, c, d, e, f, g}: a) {a,b},{c,d},{e,f,g

finlep [7]

Answer:

a) {a,b} , {c,d} , {e,f,g},{a , b } = {(a,a) (b,b) (a,b) (b,a)},{c , d } = {(c,c) (d,d) (c,d) (d , c) } ,{e,f,g} = {(e,e) (e,f) (f,e) (e,g) (f,f) (f,g) ( g,e) (g,f)(g,g)}

b) { (a,a)(b,b)(c,c)(c,d)(d,c)(d,d)(e,e)(e,f)(f,e)(f,f)(g,g)

c) {(a,a)(a,b)(b,b)(b,a)(a,c)(c,a)(b,c)(c,b)(c,c)(d,a)(a,d)(b,d)(d,b)(d,c)(c,d)(d,d)(c,c)(c,f)(f,c)(f,f)(c,g)(g,c)(f,g)(g,f)(g,g)

Step-by-step explanation:

a) {a,b} , {c,d} , {e,f,g}

{a , b } = {(a,a) (b,b) (a,b) (b,a)}

{c , d } = {(c,c) (d,d) (c,d) (d , c) }

{e,f,g} = {(e,e) (e,f) (f,e) (e,g) (f,f) (f,g) ( g,e) (g,f) (g,g)}

b) {a} ,{b},{c,d} ,{e,f},{g}

{ (a,a)(b,b)(c,c)(c,d)(d,c)(d,d)(e,e)(e,f)(f,e)(f,f)(g,g)}

c) {a,b,c,d},{e,f,g}

{(a,a)(a,b)(b,b)(b,a)(a,c)(c,a)(b,c)(c,b)(c,c)(d,a)(a,d)(b,d)(d,b)(d,c)(c,d)(d,d)(c,c)(c,f)(f,c)(f,f)(c,g)(g,c)(f,g)(g,f)(g,g)

4 0

3 years ago

120-2x=30, what’s x?

KiRa [710]

Step-by-step explanation:

-2x=30-120

-2x = -90

=x = -90/-2

=x = +45

4 0

3 years ago