Classifying Functions via growth rates of repeated iterations

Abstract

In this paper we develop a classification of real functions based on growth rates of repeated iteration. We show how functions are naturally distinguishable when considering inverses of repeated iterations. For example, n+2 2n 2n 2··2 (n-times) etc. and their inverse functions x-2, x/2, x/ 2, etc. Based on this idea and some regularity conditions we define classes of functions, with x+2, 2x, 2x in the first three classes. We prove various properties of these classes which reveal their nature, including a `uniqueness' property. We exhibit examples of functions lying between consecutive classes and indicate how this implies these gaps are very `large'. Indeed, we suspect the existence of a continuum of such classes.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…