About this document

Problem Solving in Math Competitions by Nikos Zarifis is a document available to read on EtoBox.

The document proves that the square root of n^2 + 1 can be approximated as n for large values of n. It shows that n is between the square root of n^2 + 1 and n + 1, and as n approaches infinity, the difference between the square root of n^2 + 1 and n approaches 0. This allows the square root of n^2 + 1 to be expressed as n for large n.

Author

Nikos Zarifis

Language

EN