All categories

3 years ago

Evaluate the function for x = 3 * f(x) = x2 – 2x + 6

Mathematics

1 answer:

inn [45]3 years ago

4 0

Answer:

Step-by-step explanation:

Hello! Thanks for letting me answer your question! If you have any more questions feel free to ask me! If not, Have a WONDERFUL day and Please don't forget to consider making me Brainliest on your question today!

You might be interested in

I am a 2 dimensional shape that has 5 obtuse angles. I do not have any sides that are parallel.

S_A_V [24]

2 Dimensional shape with 5 obtuse angle is Pentagon.

7 0

3 years ago

How many minutes will it take each of them to arrive at the scene?

elixir [45]

Step-by-step explanation:

If you were to expand your research to include other genres, you'd find that most scenes in most movies are no more than three minutes long, which means no more than three pages of script. It's not an iron-clad rule; scenes can be twenty minutes long. But it's a very useful rule of thumb.

8 0

3 years ago

A party rental company has chairs and tables for rent. The total cost to rent 5 chairs and 3 tables is $31.the total cost to ren

san4es73 [151]

Answer:

$1.25 & $10.25

Step-by-step explanation:

Let c be the cost of renting one chair and t be the cost of renting table. We're given two equations:

#1. 5c + 3t = 37

#2. 2c + 6t =64

We have a system of equations. Using our system of equations calculator, we can solve this problem any of 3 ways below:

Chairs (c) cost $1.25
Tables (t) cost $10.25

6 0

3 years ago

Two Social Security numbers (see Exercise 8.12) match zeros if a digit of one number is zero iff the corresponding digit of the

Roman55 [17]

Answer:

Proved

Step-by-step explanation:

From the given parameters, we have:

$n = 9$ i.e. the length of each security numbers

$r = 2$ i.e. 2 security numbers

Required

In 513 security numbers, 2 must have matching zeros

To do this, we make use of Pigeonhole principle.

First, we calculate the number of all security numbers not having matching zeros.

Each of the 9 digits can be selected in 2 ways.

2 ways implies that each digit is either 0 or not

So, total selection is:

$Total = 2^9$

$Total = 512$

Apply Pigeonhole principle

The principle states that: suppose there are n items in m containers, where $n>m$ , then there is at least one container that contains more than 1 item.