SearcharxivSearch

arXiv · 1509.05690

The exact (up to infinitesimals) infinite perimeter of the Koch snowflake and its finite area

Abstract

The Koch snowflake is one of the first fractals that were mathematically described. It is interesting because it has an infinite perimeter in the limit but its limit area is finite. In this paper, a recently proposed computational methodology allowing one to execute numerical computations with infinities and infinitesimals is applied to study the Koch snowflake at infinity. Numerical computations with actual infinite and infinitesimal numbers can be executed on the Infinity Computer being a new supercomputer patented in USA and EU. It is revealed in the paper that at infinity the snowflake is not unique, i.e., different snowflakes can be distinguished for different infinite numbers of steps executed during the process of their generation. It is then shown that for any given infinite number~$n$ of steps it becomes possible to calculate the exact infinite number, $N_n$, of sides of the snowflake, the exact infinitesimal length, $L_n$, of each side and the exact infinite perimeter, $P_n$, of the Koch snowflake as the result of multiplication of the infinite $N_n$ by the infinitesimal $L_n$. It is established that for different infinite $n$ and $k$ the infinite perimeters $P_n$ and $P_k$ are also different and the difference can be infinite. It is shown that the finite areas $A_n$ and $A_k$ of the snowflakes can be also calculated exactly (up to infinitesimals) for different infinite $n$ and $k$ and the difference $A_n - A_k$ results to be infinitesimal. Finally, snowflakes constructed starting from different initial conditions are also studied and their quantitative characteristics at infinity are computed.

Explore related subjects

Keep this discovery

BibTeXRIS

Yaroslav D. Sergeyev. 2015-09-11. The exact (up to infinitesimals) infinite perimeter of the Koch snowflake and its finite area. https://doi.org/10.1016/j.cnsns.2015.07.004

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Average Chord Lengths in a Triangle

Let $P$ be a point inside a triangle $T$. We consider the average length of the chords of $T$ through $P$, where the direction of the chord is chosen uniformly. An elementary formula is obtained in terms of the distances from $P$ to the sides and vertices of the triangle. Several classical triangle centers give especially simple specializations. For example, if $I$ is the incenter, then \[ M_T(I)=\frac{2r}{\pi} \log\left(\cot\frac A4\cot\frac B4\cot\frac C4\right). \] Our main result is the sharp inequality \[ M_T(P)\le \frac{p}{\pi\sqrt3}\log(2+\sqrt3), \] valid simultaneously for every triangle of perimeter $p$ and every interior point $P$. Thus, among all such pairs $(T,P)$, the largest possible average chord length occurs only when $T$ is equilateral and $P$ is its center. The proof is an elementary symmetrization argument. We close with brief remarks relating the problem to the radial center of a convex body, the electrostatic potential center of a triangle, and dual quermassintegrals.

math.GM

A Proof of Liu's Conjecture on the Fundamental Triangle Inequality

Let $a,b,c$ be the side lengths of a triangle, and let $R$ and $r$ denote its circumradius and inradius, respectively. We prove a conjecture of Liu stating that \[\sum_{\mathrm{cyc}} \left(\frac{a(b+c-a)}{bc}\right)^k \geq 2+\left(\frac{2r}{R}\right)^k,~~k>1, \] with the reverse inequality for $0<k<1$. The proof reduces the problem to three positive variables with fixed sum and product. We also determine the equality cases.

math.GM