4. problem iv.7. let un be the nth fibonacci number (for the definition see definition 5.4.2) prove that if n 2 2 the euclidean algorithm takes precisely n -1 steps to prove that gcd(un+1,un) 1, here we mean that the euclidean algorithm, as written in class or in the book, takes n - 1 steps to complete

Solved

Show answers

Ответ:

lizzyhearts

18.03.2022

Mathematics

a.the slope of the line is 1.5

Step-by-step explanation:

Hello

if two points of a line are known(P1 and P2), it is possible to find the slope of the line, the slope of a line is given by:

$slope=\frac{y_{2}-y_{1}}{x_{2}-x_{1}} \\m=\frac{y_{2}-y_{1}}{x_{2}-x_{1}}\\$

$P1=(x_{1} ,y_{1}) \\P2=(x_{2} ,y_{2})$

Step 1

define

$P1=(84,80) , x_{1}=84 ,y_{1}=80\\P2=(74,65) , x_{2}=74 ,y_{2}=65$

Step 2

put the values into the equation

$m=\frac{y_{2}-y_{1}}{x_{2}-x_{1}}\\m=\frac{65-80 }{74-84}\\m=\frac{-15}{-10}\\ m=\frac{15}{10}=\frac{3}{2}=1.5$

the slope=1.5

I hope it helps, have a great day

0,0(0 оценок)

Ask your question to the AI advisor

Ai-bot is an expert in any field and is the perfect companion for reliable and useful answers and advice on a variety of topics, including science, history, technology, art, sports, health, culture and more.

Ask your question

More tips

Answers on questions: Mathematics

Ask an AI advisor a question

I want advice