3 years ago

We want to find the zeros of this polynomial Graph the zeros

Mathematics

1 answer:

mote1985 [20]3 years ago

7 0

Answer:

intersection of the y axis

You might be interested in

Brian gave 1/4 of his stickers to Pete and 20 stickers to Lily. He then had 1/3 of his stickers left. How many stickers did he h

Oduvanchick [21]

Find a common denominator first.
P3/12. + 5/12
4/12 left

48 stickers

8 0

3 years ago

6 radians is the same as ____°. Round to the nearest hundredth of a degree.

sladkih [1.3K]

Answer:

343.77°

Step-by-step explanation:

1 radian = $\frac{180}{Pi}$ °

6 radians will be;

6 × $\frac{180}{Pi}$ ° =343.7746771 °

Or 343.77° (rounded up to nearest hundredth)

6 0

3 years ago

Read 2 more answers

Help me out ? ty I’ll give brainliest

DaniilM [7]

Answer:

it will

Step-by-step explanation:

33.46

hope it helps and your day will full of happiness

3 0

3 years ago

Which expression represents the greatest common factor (GCF) of 70 and 112? A. 2 x 2 x 2 x 7 B. 2 x 2 x 2 x 5 C. 2 x 7 D. 2 x 2

Mekhanik [1.2K]

Answer:

$\huge\boxed{C. \ \ GCF = 2 * 7}$

Step-by-step explanation:

Firstly, we'll do prime factorization of these numbers.

70 = 2 × 5 × 7

112 = 2 × 2 × 2 × 2 × 7

So, The Greatest Common Factor can be written as:

GCF = 2 × 7 [Since Only one 2 and one 7 is common]

Hope this helped!

<h2>~AnonymousHelper1807</h2>

3 0

3 years ago

The Fibonacci sequence is defined by $F_1 = F_2 = 1$ and $F_{n + 2} = F_{n + 1} + F_n$. Find the remainder when $F_{1999}$ is di

zavuch27 [327]

Answer:

The remainder is 1

Step-by-step explanation:

Given the Fibonacci sequence

F_1 = F_2 = 1, and

F_(n + 2) = F_(n + 1) + F_n

We want to find the remainder when F_(1999) is divided by 5.

Let us write the first 20 numbers of the sequence in (mod 5). They are

F_1 = 1,

F_2 = 1,

F_3 = 2,

F_4 = 3,

F_5 = 5 = 0 (mod 5),

F_6 = 3,

F_7 = 3,

F_8 = 1

F_(9) = 4

F_(10) = 0

F_(11) = 4

F_(12) = 4

F_(13) = 3

F_(14) = 2

F_(15) = 0

F_(16) = 2

F_(17) = 2

F_(18) = 4

F_(19) = 1

F_(20) = 0

We have: 1, 1, 2, 3, 0, 3, 3, 1, 4, 0, 4, 4, 3, 2, 0, 2, 2, 4, 1, 0

Now, 1999 = 19(mod 20)

The 19th number in the sequence is 1.

So, the remainder is 1.

6 0

3 years ago