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
Anastaziya [24]
3 years ago
12

What is the answer to this?

Mathematics
1 answer:
rusak2 [61]3 years ago
6 0

Answer:

m<1 = 84

m<2 = 6

Step-by-step explanation:

6x + x - 8 = 90

Combine like-terms

7x - 8 = 90

Isolate the variable

7x = 98

Divide each side by 7

x = 14

--------------------------------------

m<1:

6(x)

Substitute

6(14)

Multiply

84

m<2:

(x - 8)

Substitute

(14 - 8)

Combine

6

You might be interested in
BRAINLIEST PLEASE HELP
Darina [25.2K]

The function is B, you can tell using the vertical line test through each point

7 0
3 years ago
Read 2 more answers
Ryan bought 4 2/3 pounds of apples for $0.75 per pound. how much did he pay for the apples
Nina [5.8K]

Answer:

$3.50

Step-by-step explanation:

4 2/3 x 0.75 = $3.50

4 0
2 years ago
Read 2 more answers
Determine whether the sequences converge.
Alik [6]
a_n=\sqrt{\dfrac{(2n-1)!}{(2n+1)!}}

Notice that

\dfrac{(2n-1)!}{(2n+1)!}=\dfrac{(2n-1)!}{(2n+1)(2n)(2n-1)!}=\dfrac1{2n(2n+1)}

So as n\to\infty you have a_n\to0. Clearly a_n must converge.

The second sequence requires a bit more work.

\begin{cases}a_1=\sqrt2\\a_n=\sqrt{2a_{n-1}}&\text{for }n\ge2\end{cases}

The monotone convergence theorem will help here; if we can show that the sequence is monotonic and bounded, then a_n will converge.

Monotonicity is often easier to establish IMO. You can do so by induction. When n=2, you have

a_2=\sqrt{2a_1}=\sqrt{2\sqrt2}=2^{3/4}>2^{1/2}=a_1

Assume a_k\ge a_{k-1}, i.e. that a_k=\sqrt{2a_{k-1}}\ge a_{k-1}. Then for n=k+1, you have

a_{k+1}=\sqrt{2a_k}=\sqrt{2\sqrt{2a_{k-1}}\ge\sqrt{2a_{k-1}}=a_k

which suggests that for all n, you have a_n\ge a_{n-1}, so the sequence is increasing monotonically.

Next, based on the fact that both a_1=\sqrt2=2^{1/2} and a_2=2^{3/4}, a reasonable guess for an upper bound may be 2. Let's convince ourselves that this is the case first by example, then by proof.

We have

a_3=\sqrt{2\times2^{3/4}}=\sqrt{2^{7/4}}=2^{7/8}
a_4=\sqrt{2\times2^{7/8}}=\sqrt{2^{15/8}}=2^{15/16}

and so on. We're getting an inkling that the explicit closed form for the sequence may be a_n=2^{(2^n-1)/2^n}, but that's not what's asked for here. At any rate, it appears reasonable that the exponent will steadily approach 1. Let's prove this.

Clearly, a_1=2^{1/2}. Let's assume this is the case for n=k, i.e. that a_k. Now for n=k+1, we have

a_{k+1}=\sqrt{2a_k}

and so by induction, it follows that a_n for all n\ge1.

Therefore the second sequence must also converge (to 2).
4 0
3 years ago
2.) AN *
WINSTONCH [101]

Answer:

is this a joke i have no clue

Step-by-step explanation:

maybe A is this math or sumthing? lol SUM-thing  

4 0
3 years ago
Enter the degree of the polynomial below.
Rainbow [258]
The degree of a polynomial is found by looking at the largest exponent. Here your answer will be 11, or C.

Hope this helps, and please mark brainliest!
4 0
3 years ago
Other questions:
  • Miranda and her family share a family data plan for their cell phones this month her mom used 400 her father used 350 and her li
    6·1 answer
  • It takes a machine 15 hour to assemble a toy.
    5·1 answer
  • Please help me 4 1/7 + 1/2
    12·2 answers
  • Use the rational zero theorem to determine all possible rational zeros of f(x)=3x^3-2x^2+5x+9
    13·1 answer
  • I will be giving brainliest {431, 154, 254, 244, 244, 276, 263, 389, 253, 274, 205}
    12·2 answers
  • Plz Help, I will give Brainliest!!!
    10·1 answer
  • 18 ÷ 0.25? <br><br><br>middle school math​
    5·1 answer
  • Determine if the relation is a function.
    9·1 answer
  • Need help for all of these
    14·1 answer
  • Please help!!!!!!!
    12·1 answer
Add answer
Login
Not registered? Fast signup
Signup
Login Signup
Ask question!