All categories

3 years ago

HELP PLEASE IM DESPERATE!!! PLEASEPLEASE!!! FIND ALL POSSIBLE VALUES OF X!

Mathematics

2 answers:

frosja888 [35]3 years ago

4 0

X>2 and x>10 because x is greater than 2 and less than 10 so the triangle is always possible “mark me as the brainliest please”

DENIUS [597]3 years ago

3 0

Answer:

x>2 and x<10

Step-by-step explanation:

Using Triangle Inequalities, this is the ranges because when x is greater than 2 and less than 10, a triangle is always possible and forms.

You might be interested in

Kieran and Ariana are biking on a trail. Kieren begins 8 miles ahead of Ariana and bikes at an average speed of 4 miles per hour

Fittoniya [83]

I'm so sorry if this was confusing for you but just saying the answer clearly is (4,24)

3 0

3 years ago

Read 2 more answers

Given ABD =≈ CBD

vredina [299]

Answer:

AD BC only

Step-by-step explanation:

3 0

3 years ago

Read 2 more answers

When Joseph first starts working at a grocery store, his hourly rate is $10. For each year he works at the grocery store, his ho

stiks02 [169]

Answer: R(t) = 10 + 0.50t

Step-by-step explanation:

From the question, we've been informed that Joseph's hourly rate is $10 and that for every year he works at the grocery store, his hourly rate increases by $0.50.

Therefore, the function will be

R(t) = 10 + 0.50t

4 0

3 years ago

3.) Simplify. -8a – 3b + 6b – 5a + 9b

DanielleElmas [232]

-8a-3b+6b-5a+9b= -13a-18b

-8a-5a=-13a

3b+6b+9b=18b

Hopes that helps

7 0

3 years ago

A lottery game requires that a person select in uppercase or lowercase letter followed by two different two-digit numbers (where

Irina-Kira [14]

Using the Fundamental Counting Theorem, it is found that there are 416,520 ways to fill out a lottery ticket.

<h3>What is the Fundamental Counting Theorem?</h3>

It is a theorem that states that if there are n things, each with $n_1, n_2, \cdots, n_n$ ways to be done, each thing independent of the other, the number of ways they can be done is:

$N = n_1 \times n_2 \times \cdots \times n_n$

In this problem:

First, one uppercase or lowercase letter is chosen, there are 26 of each, hence $n_1 = 52$ .

Then, two different two-digit numbers are chosen, and there are 90 of them, hence $n_2 = 90, n_3 = 89$ , as the third digit has to be different of the second.

Then:

$N = n_1n_2n_3 = 52(90)(89) = 416520$

There are 416,520 ways to fill out a lottery ticket.

To learn more about the Fundamental Counting Theorem, you can take a look at brainly.com/question/24314866

5 0

3 years ago