All categories

3 years ago

How to do the discriminant and the quadratic formula?

Mathematics

1 answer:

aivan3 [116]3 years ago

8 0

Answer:

Quadratic formula (see image)

Step-by-step explanation:

Discriminant: $b^2-4ac$

You might be interested in

Help PLSSSSSSSSSSSSSSSSS extra points

arlik [135]

Answer:

85 messages

Step-by-step explanation:

The system of equations for this is

35 + .10x

18 + .3x

where x = the number of text messages

Usually, you would use substitution or elimination to solve this problem. However, because the answer choices were given, you can just plug in the values.

When you plug in 85, or x = 85, you get 43.5 for both equations because

35 + .10(85) = 43.5 18 + .3(85) = 43.5

Therefore, the answer would be 85 messages becuase both plans will cost the same when you send 85 text messages!

7 0

3 years ago

Given that the line is x/3 + y/2 =1 i ) make y the subject ii ) gradient of line

miss Akunina [59]

Answer:

see explanation

Step-by-step explanation:

(i)

$\frac{x}{3}$ + $\frac{y}{2}$ = 1 ( multiply through by 6 to clear the fractions )

2x + 3y = 6 ( subtract 2x from both sides )

3y = - 2x + 6 ( divide through by 3 )

y = - $\frac{2}{3}$ x + 2

(ii)

The equation of a line in slope- intercept form is

y = mx + c ( m is the slope ( gradient ) and c the y- intercept )

y = - $\frac{2}{3}$ x + 2 ← is in slope- intercept form ( that is part (i)

with gradient m = - $\frac{2}{3}$

7 0

2 years ago

Use the Euclidean Algorithm to demonstrate that 621 and 82 are relatively prime to each other. Explain.

8090 [49]

Answer:

621 and 82 are relatively prime.

Step-by-step explanation:

Two integers are relatively prime (or coprime) if there is no integer greater than one that divides them both (that is, their greatest common divisor is one).

The greatest common divisor of two integers a and b is the largest integer that divides them both.

The Euclidean algorithm is an efficient method for computing the greatest common divisor of two integers, without explicitly factoring the two integers.

The Euclidean algorithm solves the problem:

Given integers a, b find $d=gcd(a,b)$

The Euclidean algorithm provides a fast way to determine d without knowing the prime factors of a or b. Here is an outline of the steps:

Let $a=x$ , $b=y$
Given x, y, use the division algorithm to write $x=yq+r, \quad 0\leq r\leq |y|$ .
If r = 0, stop and output y; this is the gcd of a, b.
If $r \neq 0$ , replace (x, y) by (y, r). Go to step 2.

The division algorithm is an algorithm in which given 2 integers N and D, it computes their quotient Q and remainder R.

Let's say we have to divide N (dividend) by D (divisor). We will take the following steps:

Step 1: Subtract D from N repeatedly until we get a result that lies between 0 (inclusive) and D (exclusive) and is the smallest non-negative number obtained by repeated subtraction.

Step 2: The resulting number is known as the remainder R, and the number of times that D is subtracted is called the quotient Q.

Applying the above steps,

$621-82=539\\539-82=457\\457-82=375\\375-82=293\\293-82=211\\211-82=129\\129-82=47\\\\621=82\cdot7+47$