All categories

2 years ago

Please help me fast I will give brainliest

Mathematics

1 answer:

ohaa [14]2 years ago

7 0

Answer:

absolute values

greatest loss

furthest to the right

You might be interested in

Given f(x) = -4x - 2, solve for x when f(x) = 6.

Andrej [43]

Answer:

use

Step-by-step explanation:

calculator

6 0

3 years ago

en una casa construida con madera el tejado se sostiene con una estructura triangular en el que se utilizan ángulos complementar

professor190 [17]

Answer:

Si me dieras una imagen con esto, podría responderla fácilmente, pero no hay una imagen o modelo para ayudar a disculparme.

Step-by-step explanation:

lo siento, tal vez vuelva a publicarlo con un modelo o una imagen para que pueda ayudar

6 0

2 years ago

A tent forms an equilateral triangular prism, with both triangular faces exposed. each side of the triangular face has a length

Soloha48 [4]

Given:
Equilateral Triangular Prism
Each side of the triangular face has a length of 196cm
The tent is 250cm long

I have attached an image of the tent. Since the height of the tent is also the height of the triangle, I will solve for the height of the triangle using Pythagorean theorem.

I divided the equilateral triangle into 2 right triangle. The height then becomes the long leg of the triangle. The hypotenuse is 196cm and the short leg is 98cm, half of one side of the triangle.

a² + b² = c²
a² = c² - b²
a² = (196cm)² - (98cm)²
a² = 38,416cm² - 9,604cm²
a² = 28,812cm²
a = √28,812cm²
a = 169.74cm

The height of the tent is 169.74 centimeters.

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.