3 years ago

7x² + 6x - 1 Algebra 3|factoring

Mathematics

1 answer:

GaryK [48]3 years ago

5 0

Answer:

(7 x - 1) (x + 1)

Step-by-step explanation:

Factor the following:

7 x^2 + 6 x - 1

Factor the quadratic 7 x^2 + 6 x - 1. The coefficient of x^2 is 7 and the constant term is -1. The product of 7 and -1 is -7. The factors of -7 which sum to 6 are -1 and 7. So 7 x^2 + 6 x - 1 = 7 x^2 + 7 x - x - 1 = (7 x - 1) + x (7 x - 1):

(7 x - 1) + x (7 x - 1)

Factor 7 x - 1 from (7 x - 1) + x (7 x - 1):

Answer: (7 x - 1) (x + 1)

You might be interested in

Luis makes 3 free throw out of 7 shots. How many free throws will he make if he shoots 21 times

alina1380 [7]

The answer is 9 free throws

4 0

3 years ago

Read 2 more answers

Darnell is underwater 20 feet below sea level. His friend is on a hill 32 feet above sea level. How far apart are the two friend

NemiM [27]

Answer:

52 feet apart

Step-by-step explanation:

20 + 32 = 52

8 0

3 years ago

Read 2 more answers

Five friends plan to split a restaurant bill evenly. The total cost of the meal is $89.75, and they want to leave a 20% tip. Wha

nlexa [21]

The amount each friend should leave is $3.59 each

4 0

3 years ago

Carl Brownstein is a golf course groundkeeper whose annual gross pay is $45,500. He has exemptions of $3,000. The tax state on t

zhenek [66]

Answer:

Step-by-step explanation:

7 0

3 years ago

A cryptographic hash takes a message as input and produces a fixed-length string as output, called the digital fingerprint. A br

Allushta [10]

Answer:

$1.85x10^{19}$ attempts are required to find a matching pair if the digital fingerprint is 64 bits long.

$3.40*10^{38}$ attempts are required to find a matching pair if the digital fingerprint is 128 bits long.

Step-by-step explanation:

Each bit has two options. So

How many attempts are required to find a matching pair if the digital fingerprint is 64 bits long?

So for each of the 64 bits, we have the following number of options.

2 - 2 - 2 - 2 -... - 2

So, in all, there are

$T = 2^{64} = 1.85x10^{19}$

options.

So, $1.85x10^{19}$ attempts are required to find a matching pair if the digital fingerprint is 64 bits long.

128 bits long?

Using the same logic as the first question.

$T = 2^{128} = 3.40*10^{38}$

So, $3.40*10^{38}$ attempts are required to find a matching pair if the digital fingerprint is 128 bits long.

5 0

3 years ago