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
lakkis [162]
3 years ago
8

How do I solve this limits problem?

Mathematics
1 answer:
motikmotik3 years ago
6 0

Each piece of this function is continuous on its respective domain (because all polynomials are continuous functions), meaning

• 2 - x exists for all x < -1

• x exists for all -1 ≤ x < 1

• (x - 1)² exists for all x ≥ 1

So this really just leaves the points where the pieces are split up, i.e. x = -1 and x = 1. At both of these points, the two-sided limit exists as long as the one-side limits from both sides exist and are equal to one another.

At x = -1, as I said in my comment, you have

\displaystyle \lim_{x\to-1^-}f(x) = \lim_{x\to-1}(2-x) = 2-(-1) = 3

while

\displaystyle \lim_{x\to-1^+}f(x) = \lim_{x\to-1}x = -1

But -1 ≠ 3, so the two-sided limit

\displaystyle\lim_{x\to-1}f(x)

does not exist. So a = -1 is one of the points you would list.

At x = 1, we have

\displaystyle \lim_{x\to1^-}f(x) = \lim_{x\to1}x = 1

while

\displaystyle \lim_{x\to1^+}f(x) = \lim_{x\to1}(x-1)^2 = (1-1)^2 = 0

and again the one-sided limits don't match, so this two-sided limit also does not exist, making a = 1 the other answer.

You might be interested in
What is the answer to - (- 12) + z over 6
Vesnalui [34]
I believe the answer is Z+12 over 6


4 0
3 years ago
Prove or give a counterexample:
ozzi

Answer:

See proof below.

Step-by-step explanation:

True

For this case we need to use the following theorem "If v_1, v_2,....v_k are eigenvectors of an nxn matrix A and the associated eigenvalues \lambda_1, \lambda_2,...,\lambda_k are distinct, then v_i's are linearly independent". Now we can proof the statement like this:

Proof

Let A a nxn matrix and we can assume that A has n distinct real eingenvalues let's say \lambda_1, \lambda_2, ....,\lambda_n

From definition of eigenvector for each one \lambda_i needs to have associated an eigenvector v_i for 1 \leq i \leq n

And using the theorem from before , the n eigenvectors v_1,....,v_n are linearly independent since the \lambda_i 1\leq i \leq n are distinct so then we ensure that A is diagonalizable.

4 0
3 years ago
Find circumference when pi is 22/7
sashaice [31]

Answer:

what is radius

Step-by-step explanation:

tell me what is the radius

8 0
3 years ago
Solve the system of equations by the addition method. If the system does not have a single ordered pair as a​ solution, state wh
Damm [24]

Answer:

dependent

Step-by-step explanation:

The given system is :

15x-18=3y

5x=y+6

Rewrite the equations in standard form to get:

15x-3y=18

5x-y=6

Multiply the bottom equation by 3.

15x-3y=18

15x-3y=18

Sub both equations:

0-0=0

0=0

We got an identity

The system is dependent  because there are infinitely many solutions

6 0
4 years ago
What is 7.25 in word form
Minchanka [31]
<span>7.25 = s</span><span>even and twenty-five hundredths</span>
<span>Hope I helped:P </span>
3 0
4 years ago
Read 2 more answers
Other questions:
  • Solve for x and y. Round to the nearest tenth if necessary.
    12·1 answer
  • Describe the sampling distribution of x-bar for samples of size 20 drawn from a normal population with a mean of 50 and standard
    10·1 answer
  • What is 5 5 7 × 3 1 5
    5·1 answer
  • How do I find the area with this figure?
    5·1 answer
  • Which is the BEST estimate for the product of 3.1*10^4
    11·1 answer
  • Fill in the blanks:
    8·1 answer
  • A license plate has 3 digits from 0 to 9, followed by 3 letters. how many different license plates are possible?
    10·2 answers
  • 9-1 Similar Polygons
    15·1 answer
  • 75=n+12 what is the full problem and check your answers with simplifacation
    13·1 answer
  • The quotient of 5 and the sum of 10 and twice y.
    13·1 answer
Add answer
Login
Not registered? Fast signup
Signup
Login Signup
Ask question!