All categories

3 years ago

Find the output, y, when the input,x, is 6. y=

Mathematics

1 answer:

deff fn [24]3 years ago

8 0

Answer:

y = 8

General Formulas and Concepts:

Algebra I

Reading a Cartesian Plane
Coordinates
Functions

Step-by-step explanation:

What the question is asking is for the y-value when the x-value is equal. According to the graph, when x = 6, y = 8. Therefore, y = 8.

You might be interested in

Lily charges $60 for 5 tutoring sessions. What is the cost PER session?

slava [35]

$60 divided by 5 = $12

$12 per session.

Pls mark me brainliest!

4 0

3 years ago

Read 2 more answers

A multiple choice test has two parts. There are 4^12 ways to answer the 12 questions in Part A. There are 4^5 ways to answer the

LiRa [457]

Using the Fundamental Counting Theorem and the probability concept, it is found that:

There are $4^{17}$ ways to answer all 17 questions.

$4^{-17}$ probability you will get them all right.

<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$

<h3>What is a probability?</h3>

A probability is given by the number of desired outcomes divided by the number of total outcomes.

In this problem:

The questions in part A and in part B are independent.

For the 12 questions in part A, there are $4^{12}$ ways to answer, hence $n_1 = 4^{12}$ .

For the 5 questions in part B, there are $4^{5}$ ways to answer, hence $n_2 = 4^{5}$ .

Then:

$N = n_1 \times n_2 = 4^{12} \times 4^5 = 4^{17}$

There are $4^{17}$ ways to answer all 17 questions.

Only one outcome in which all the guesses are correct, hence:

$p = \frac{1}{4^{17}} = 4^{-17}$ probability you will get them all right.

You can learn more about the Fundamental Counting Theorem at brainly.com/question/24314866

8 0

3 years ago

Help me plz thx so much

rewona [7]

She paid $30 bucks total.

8 0

3 years ago

Permutation:

Kruka [31]

Formula for permutation is:

$\boxed{ \tt^{n} C_{r} = \frac{n!}{r!(n - r)!} }$

<h3>Calculation, </h3>

Plug in the values:

Required number of ways = ²C7

n = 7
r = 5

$\sf \frac{7!}{5!(7 - 5)!}$

$\sf \frac{7 \times 6 \times \cancel{5!}}{ \cancel{5! }\times 2!}$

$\sf \frac{7 \times 6 }{ 2!}$

$\sf \frac{42 }{ 2!}$

$\sf \frac{42 }{ 2} = 21$

Thus, The players can be selected in 21 different ways!!~

3 0

2 years ago

Read 2 more answers

Find the gradient of the line segment between the points (-1,2) and (-2,3).

Svetach [21]

Answer:

The gradient of the line segment between the two points is -1

Step-by-step explanation:

The gradient of the line segment between two points is also known as the slope,

We can find this by using the formula; y₂ - y₁ / x₂ - x₁

The points given to us are;(-1,2) and (-2,3).

This implies x₁ = -1 , y₁=2 x₂ = -2 y₂= 3

We can now proceed to insert our values into the formula;

Gradient = y₂ - y₁ / x₂ - x₁

= 3 - 2 / -2-(-1)

= 1 / -2 + 1

=1/-1

Gradient = -1

Therefore the gradient of the line segment between the two points is -1

8 0

3 years ago