Square Root Of 3 In Fraction Form

Square Root of 3 in Fraction Form: Understanding Irrationality and Rational Approximations

The square root of 3 (written as √3) is one of the most familiar irrational numbers that appears in geometry, trigonometry, and engineering. Although it cannot be expressed exactly as a simple fraction ( \frac{p}{q} ) with integers (p) and (q), mathematicians have developed systematic ways to find fractions that approximate √3 to any desired accuracy. This article explores why √3 is irrational, how its infinite continued‑fraction expansion reveals the best rational approximations, and practical methods—such as the Babylonian (Heron) algorithm—for converting those approximations into usable fractions. By the end, you will have a clear toolkit for working with √3 in fractional form, whether you are solving a geometry problem or implementing a numerical algorithm.

Why √3 Cannot Be Written as an Exact Fraction

A number is rational if it can be written as ( \frac{p}{q} ) where (p) and (q) are integers and (q \neq 0). To prove that √3 is irrational, assume the opposite: suppose √3 = ( \frac{p}{q} ) with (p) and (q) coprime (no common factor). Squaring both sides gives

[ 3 = \frac{p^{2}}{q^{2}} \quad\Longrightarrow\quad p^{2}=3q^{2}. ]

The right‑hand side is divisible by 3, so (p^{2}) must also be divisible by 3, which implies (p) is divisible by 3 (since 3 is prime). Write (p=3k). Substituting back:

[ (3k)^{2}=3q^{2};\Longrightarrow;9k^{2}=3q^{2};\Longrightarrow;3k^{2}=q^{2}. ]

Now (q^{2}) is divisible by 3, so (q) is also divisible by 3. But this contradicts the assumption that (p) and (q) share no common factor. Therefore our initial assumption is false, and √3 cannot be expressed as an exact fraction. Key takeaway: √3 is irrational, meaning its decimal expansion never terminates or repeats, and no fraction ( \frac{p}{q} ) equals it exactly.

Continued‑Fraction Expansion of √3

Even though √3 is irrational, it possesses a simple, periodic continued‑fraction representation:

[ \sqrt{3}= [1; \overline{1,2}] ;=; 1+\cfrac{1}{1+\cfrac{1}{2+\cfrac{1}{1+\cfrac{1}{2+\ddots}}}}. ]

The overline indicates that the block (1,2) repeats indefinitely. This periodicity is a hallmark of quadratic irrationals (numbers that are solutions to quadratic equations with integer coefficients).

From this expansion we can generate convergents—finite truncations that give the best possible rational approximations for a given denominator size. The convergents are obtained by evaluating the continued fraction up to a certain depth.

First Few Convergents

| Term (n) | Continued‑fraction truncation | Fraction (p/q) | Decimal value | Error |
|----------|------------------------------|----------------|---------------|-------| | 0 | [1] | 1/1 | 1.0000 | –0.7320 |
| 1 | [1;1] | 2/1 | 2.0000 | +0.2679 |
| 2 | [1;1,2] | 5/3 ≈ 1.6667 | –0.0653 |
| 3 | [1;1,2,1] | 7/4 = 1.7500 | +0.0179 |
| 4 | [1;1,2,1,2] | 19/11 ≈ 1.7273 | –0.0047 |
| 5 | [1;1,2,1,2,1] | 26/15 ≈ 1.7333 | +0.0013 |
| 6 | [1;1,2,1,2,1,2] | 71/41 ≈ 1.7317 | –0.0003 |
| 7 | [1;1,2,1,2,1,2,1] | 97/56 ≈ 1.73214 | +0.00004 |

Each convergent alternates between being slightly below and slightly above √3, and the absolute error roughly halves with each step. Moreover, any fraction that approximates √3 better than a given convergent must have a denominator larger than that convergent’s denominator—a property known as best approximation.

Generating Fractions with the Babylonian (Heron) Method

The Babylonian method is an iterative algorithm for computing square roots. Starting with an initial guess (x_{0}), the update rule is

[ x_{n+1}= \frac{1}{2}\left(x_{n}+\frac{3}{x_{n}}\right). ]

If we begin with a rational guess, each iteration produces another rational number because the formula involves only addition, division by 2, and division by the current rational guess. Thus the method yields a sequence of fractions that converge rapidly to √3.

Example: Starting from (x_{0}=2)

Completing theFirst Few Babylonian Updates

Continuing from the fraction ( \dfrac{7}{4} ) obtained after the first iteration, the second refinement proceeds as follows:

[ x_{2}= \frac12!\left(\frac{7}{4}+\frac{3}{\frac{7}{4}}\right) =\frac12!\left(\frac{7}{4}+\frac{12}{7}\right) =\frac12!\left(\frac{49+48}{28}\right) =\frac12!\left(\frac{97}{28}\right) =\frac{97}{56}. ]

Thus the third approximation is ( \dfrac{97}{56}\approx1.73214 ), which already matches the seventh convergent listed in the continued‑fraction table.

A third step gives

[ \begin{aligned} x_{3} &=\frac12!\left(\frac{97}{56}+\frac{3}{\frac{97}{56}}\right) =\frac12!\left(\frac{97}{56}+\frac{168}{97}\right)\[2mm] &=\frac12!\left(\frac{97\cdot97+168\cdot56}{56\cdot97}\right) =\frac12!\left(\frac{9409+9408}{5432}\right) =\frac12!\left(\frac{18817}{5432}\right) =\frac{18817}{10864}. \end{aligned} ]

Dividing numerator and denominator by their greatest common divisor (which is 1) leaves the fraction ( \dfrac{18817}{10864} ). Its decimal expansion is (1.7320508\ldots), an error of only (4\times10^{-7}) from the true value of (\sqrt{3}).

Why the Two Procedures Align

The Babylonian iteration can be written in the compact form

[ x_{n+1}= \frac{x_{n}^{2}+3}{2x_{n}}. ]

If we substitute a convergent ( \dfrac{p_k}{q_k} ) of ( \sqrt{3} ) into this expression, the resulting numerator and denominator are precisely the next pair ( (p_{k+1},q_{k+1}) ) that appears in the continued‑fraction expansion. In other words, each Babylonian update “jumps” to the next convergent, but it does so in a way that skips the intermediate intermediate truncations.

Because the update rule squares the current approximation before averaging, the error shrinks roughly quadratically: if the relative error after the (n)‑th step is ( \varepsilon_n ), then [ \varepsilon_{n+1}\approx \frac{\varepsilon_n^{,2}}{2}. ]

Consequently, only a handful of iterations are needed to achieve many correct decimal places.

Practical Implications

• Best‑approximation property – The convergents generated by the continued‑fraction expansion are known to be the optimal rational approximations for a given denominator

Practical Implications (Continued)

• Best-approximation property – The convergents generated by the continued‑fraction expansion are known to be the optimal rational approximations for a given denominator. This means that for any convergent ( \frac{p_k}{q_k} ), no fraction with a smaller denominator can be closer to ( \sqrt{3} ). This property is crucial in applications requiring precise rational approximations, such as signal processing or numerical algorithms where minimizing denominator size reduces computational overhead.

• Computational efficiency – The Babylonian method’s quadratic convergence ensures rapid error reduction. Each iteration roughly doubles the number of correct decimal places, making it exceptionally efficient for high-precision calculations. For example, after just three iterations (as shown earlier), ( \sqrt{3} ) is accurate to six decimal places. This outperforms linear methods (e.g., bisection) and is comparable to modern Newton-Raphson variants, which are computationally intensive for large numbers.

• Historical and modern relevance – Ancient Babylonian scribes used this algorithm over 3,000 years ago for architectural and astronomical calculations, demonstrating its timeless utility. Today, it underpins modern computational libraries (e.g., in Python’s math.sqrt or MATLAB’s sqrt) due to its simplicity and speed. The synergy with continued fractions further enriches its applicability in cryptography and computer algebra systems, where rational approximations simplify exact arithmetic.

• Algorithmic robustness – Unlike Taylor series expansions, which suffer from slow convergence and radius-of-convergence limitations, the Babylonian method converges monotonically from any positive starting value. Its stability makes it ideal for embedded systems and real-time applications, where predictable error bounds are essential.

Conclusion

The convergence of the Babylonian method and continued fractions for approximating ( \sqrt{3} ) reveals a profound mathematical harmony: iterative refinement and systematic truncation of infinite expansions yield identical optimal rational approximations. This duality not only underscores the elegance of ancient mathematics but also provides a powerful framework for modern numerical analysis. The Babylonian method’s quadratic efficiency and the continued fraction’s best-approximation property collectively ensure unparalleled precision with minimal computational effort. As algorithms increasingly bridge historical wisdom and technological innovation, these techniques remain indispensable—proving that some insights, much like the square roots they approximate, transcend time with enduring relevance.