Plz can someone help me with number 5?

How do you find the area and perimeter of a rectangle. And how do you find the area and perimeter of a square?

cupoosta [38]

Answer:

The perimeter of a rectangle is P = 2 b + 2 h , where is the base (or width) and is the height (or length). If a rectangle is a square, with sides of length , the formula for perimeter is P s q u a r e = 2 s + 2 s = 4 s and the formula for area is A s q u a r e = s ⋅ s = s 2

Step-by-step explanation:

5 0

3 years ago

Use the parabola tool to graph the quadratic function f(x) =-5x2 -2

enot [183]

Your first point would be on (0, 2), the vertex. Then, put a point on (-2, 22). Hope that helps!

3 0

3 years ago

1. Prove or give a counterexample for the following statements: a) If ff: AA → BB is an injective function and bb ∈ BB, then |ff

Fantom [35]

Answer:

a) False. A = {1}, B = {1,2} f: A ⇒ B, f(1) = 1

b) True

c) True

d) B = {1}, A = N, f: N ⇒ {1}, f(x) = 1

Step-by-step explanation:

a) lets use A = {1}, B = {1,2} f: A ⇒ B, f(1) = 1. Here f is injective but 2 is an element of b and |f−¹({b})| = 0., not 1. This statement is False.

b) This is True. If A were finite, then it can only be bijective with another finite set with equal cardinal, therefore, B should be finite (and with equal cardinal). If A were not finite but countable, then there should exist a bijection g: N ⇒ A, where N is the set of natural numbers. Note that f o g : N ⇒ B is a bijection because it is composition of bijections. This, B should be countable. This statement is True.

c) This is true, if f were surjective, then for every element of B there should exist an element a in A such that f(a) = b. This means that f−¹({b}) has positive cardinal for each element b from B. since f⁻¹(b) ∩ f⁻¹(b') = ∅ for different elements b and b' (because an element of A cant return two different values with f). Therefore, each element of B can be assigned to a subset of A (f⁻¹(b)), with cardinal at least 1, this means that |B| ≤ |A|, and as a consequence, B is finite.

b) This is false, B = {1} is finite, A = N is infinite, however if f: N ⇒ {1}, f(x) = 1 for any natural number x, then f is surjective despite A not being finite.

4 0

3 years ago

Evaluate the algebraic<br> expression:<br> Plz answer quick

Andrew [12]

Answer:

7,-5,-11

Step-by-step explanation:

-3(-4)-5=7

-3(0)-5=-5

-3(2)-5=-11

5 0

3 years ago

If n is a positive integer, how many 5-tuples of integers from 1 through n can be formed in which the elements of the 5-tuple ar

Oksana_A [137]

Answer:

$n + 4 {n \choose 2} + 6 {n \choose 3} + 4 {n \choose 4} + {n \choose 5}$

Step-by-step explanation:

Lets divide it in cases, then sum everything

Case (1): All 5 numbers are different

In this case, the problem is reduced to count the number of subsets of cardinality 5 from a set of cardinality n. The order doesnt matter because once we have two different sets, we can order them descendently, and we obtain two different 5-tuples in decreasing order.

The total cardinality of this case therefore is the Combinatorial number of n with 5, in other words, the total amount of possibilities to pick 5 elements from a set of n.

${n \choose 5 } = \frac{n!}{5!(n-5)!}$

Case (2): 4 numbers are different

We start this case similarly to the previous one, we count how many subsets of 4 elements we can form from a set of n elements. The answer is the combinatorial number of n with 4 ${n \choose 4} .$

We still have to localize the other element, that forcibly, is one of the four chosen. Therefore, the total amount of possibilities for this case is multiplied by those 4 options.

The total cardinality of this case is $4 * {n \choose 4} .$

Case (3): 3 numbers are different

As we did before, we pick 3 elements from a set of n. The amount of possibilities is ${n \choose 3} .$

Then, we need to define the other 2 numbers. They can be the same number, in which case we have 3 possibilities, or they can be 2 different ones, in which case we have ${3 \choose 2 } = 3$ possibilities. Therefore, we have a total of 6 possibilities to define the other 2 numbers. That multiplies by 6 the total of cases for this part, giving a total of $6 * {n \choose 3}$

Case (4): 2 numbers are different

We pick 2 numbers from a set of n, with a total of ${n \choose 2}$ possibilities. We have 4 options to define the other 3 numbers, they can all three of them be equal to the biggest number, there can be 2 equal to the biggest number and 1 to the smallest one, there can be 1 equal to the biggest number and 2 to the smallest one, and they can all three of them be equal to the smallest number.

The total amount of possibilities for this case is

$4 * {n \choose 2}$

Case (5): All numbers are the same

This is easy, he have as many possibilities as numbers the set has. In other words, n

Conclussion

By summing over all 5 cases, the total amount of possibilities to form 5-tuples of integers from 1 through n is

$n + 4 {n \choose 2} + 6 {n \choose 3} + 4 {n \choose 4} + {n \choose 5}$

I hope that works for you!

4 0

3 years ago