The n-th smallest term for any finite sequence of real numbers

2013/07/17 by Josimar da Silva Rocha, Rocha, Josimar da Silva
Computer Science · Mathematics · #00A05 #06A75 #Advanced Graph Theory Research #Classical Analysis and ODEs (math.CA) #FOS: Mathematics #History and Overview (math.HO) #Limits and Structures in Graph Theory #math.CA #math.HO #msc:00A05 #msc:06A75 #semigroups and automata theory

paper · pdf · doi:10.48550/arxiv.1307.4931

five pages

arxiv created 2013/07/17 · openalex publication_date 2013/07/17 · arxiv updated 2013/07/19 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

In this paper we find the formula that gives the n-th smallest term in a given finite sequence of real numbers.

Related

• Lowest Terms Revisited
• Integers represented by Lucas sequences
• A note on recurrence sequences
• On the length over which k-Göbel sequences remain integers
• An Algorithm for Calculating Terms of a Number Sequence using an Auxiliary Sequence