论文信息 - When Close Enough Is Close Enough

When Close Enough Is Close Enough

2? + V526 = 3. Teacher: Please show me your solution to this problem. Student: Sure. At first I was confused, but then I had a great idea. I just used my calculator. Both sides of the equation evaluate to 1.732050808. So they're the same! Teacher: Hmm. That's a good idea, but it doesn't really answer the question. You see, your calculator can display only 10 digits. It's possible that these two numbers agree to 10 decimal places, but aren't equal. Student: Get out! I don't believe that two expressions that agree to that many digits could be different. Teacher: Actually, they could. Let me give you an example. Do you have your calculator with you? Student: Yes. Teacher: Excellent. Please calculate

Edward R. Scheinerman | E. Scheinerman

[1] Susan Landau. Simplification of Nested Radicals , 1992, SIAM J. Comput..

[2] Giuseppe Liotta,et al. Robust proximity queries: an illustration of degree-driven algorithm design , 1997, SCG '97.

[3] Maurice Mignotte,et al. Mathematics for computer algebra , 1991 .

[4] Kurt Mehlhorn,et al. A strong and easily computable separation bound for arithmetic expressions involving square roots , 1997, SODA '97.

[5] Susan Landau. A Note on "Zippel Denesting" , 1992, J. Symb. Comput..

[6] Kurt Mehlhorn,et al. Efficient exact geometric computation made easy , 1999, SCG '99.

[7] Henri Cohen,et al. A course in computational algebraic number theory , 1993, Graduate texts in mathematics.

[8] Chee-Keng Yap,et al. Fundamental problems of algorithmic algebra , 1999 .

[9] J. Neukirch. Algebraic Number Theory , 1999 .

[10] Karim Belabas,et al. User’s Guide to PARI / GP , 2000 .

[11] Charles R. Johnson,et al. Matrix analysis , 1985, Statistical Inference for Engineers and Data Scientists.

[12] Susan Landau. How to tangle with a nested radical , 1991 .