Buscar

Analysis Report

Faça como milhares de estudantes: teste grátis o Passei Direto

Esse e outros conteúdos desbloqueados

16 milhões de materiais de várias disciplinas

Impressão de materiais

Agora você pode testar o

Passei Direto grátis

Você também pode ser Premium ajudando estudantes

Prévia do material em texto

Analysis Report
SECTION 1.1a, page 2
In 1(b) there is more concise way to prove it? SECTION 1.1c, page 9
In 1(b) I do not properly understood the meaning of verifying that this decimal representation ”works”?I
initially thought take some arbitrary decimal number and use the algorithm, but it would be a particular
proof.How I am supposed to verify something more generically.
About the proof of the avoidness of the infinite string of 9’s, is my proof sufficient?I as that because my
proof was based in comparing the two algorithms to yield the decimal representation, is there any more
general proof?
In question 2(a), I was not able to think in approach. In question 2(c),I could not proof the relation,I
thought in prove that |a + b| ≥ |x|.
In question 5(c), my proof was based in the fact that I noticed that 1 could be a root, and factored the
polynomial.There is a more ”valid” way to do it?
In question 6 I think I do not properly understood the meaning od geometric interpretation.The relation
in the right triangle showed in p.16 was not a geometrical interpretation for n = 2?About the n = 3 I
though that it was related with de dot product of points in a x, y, z space,but could not develop any proof.
The proof of 8(a) was more about a guess, there is any more solid way to prove it?About the 8(b),by the
general form of triangular inequality,I thought in find the maximum value of |xn − a1 − a2 − · · · − an, but
could not solve it.
Again in questions 12,13 I was not able to give a geometric interpretation.
In question 13 I do not understood the hint, how changing an would lead to a changing in the rootn →
n + 1 of geometric mean.

Outros materiais