Related papers: On 2-digit and 3-digit Kaprekar's Routine
This paper discusses about a sorting algorithm which uses the concept of buckets where each bucket represents a certain number of digits. A two dimensional data structure is used where one dimension represents buckets i. e; number of digits…
In a previous paper, an implementable algorithm was introduced to compute discrete solutions of sweeping processes (i.e. specific first order differential inclusions). The convergence of this numerical scheme was proved thanks to…
A graph is said to be $k$-{\em isoregular} if any two vertex subsets of cardinality at most $k$, that induce subgraphs of the same isomorphism type, have the same number of neighbors. It is shown that no $3$-isoregular bicirculant (and more…
Green and Sisask showed that the maximal number of $3$-term arithmetic progressions in $n$-element sets of integers is $\lceil n^2/2\rceil$; it is easy to see that the same holds if the set of integers is replaced by the real line or by any…
A general class of functionally-fitted explicit pseudo two-step Runge-Kutta-Nystr\"{o}m (FEPTRKN) methods for solving second-order initial value problems has been studied. These methods can be considered generalized explicit pseudo two-step…
The number of n-gram features grows exponentially in n, making it computationally demanding to compute the most frequent n-grams even for n as small as 3. Motivated by our production machine learning system built on n-gram features, we ask:…
This paper proposes an implicit family of sub-step integration algorithms grounded in the explicit singly diagonally implicit Runge-Kutta (ESDIRK) method. The proposed methods achieve third-order consistency per sub-step and thus the…
The Fast Reciprocal Square Root Algorithm is a well-established approximation technique consisting of two stages: first, a coarse approximation is obtained by manipulating the bit pattern of the floating point argument using integer…
The prime numbers have been a source of fascination for millenia and continue to surprise us. Motivated by the hyperuniformity concept, which has attracted recent attention in physics and materials science, we show that the prime numbers in…
The speed-robust scheduling problem is a two-stage problem where given $m$ machines, jobs must be grouped into at most $m$ bags while the processing speeds of the given $m$ machines are unknown. After the speeds are revealed, the grouped…
We investigate structural complexity measures on digraphs, in particular the cycle rank. This concept is intimately related to a classical topic in formal language theory, namely the star height of regular languages. We explore this…
This paper constructs a third-step second-order numerical approach for solving a mathematical model on the dynamic of corruption and poverty. The stability and error estimates of the proposed technique are analyzed using the $L^{2}$-norm.…
In this paper, we construct a derivative-free multi-step iterative scheme based on Steffensen's method. To avoid excessively increasing the number of functional evaluations and, at the same time, to increase the order of convergence, we…
The second-order extended stability Factorized Runge-Kutta-Chebyshev (FRKC2) class of explicit schemes for the integration of large systems of PDEs with diffusive terms is presented. FRKC2 schemes are straightforward to implement through…
The randomized Kaczmarz method and its accelerated variants are a powerful class of iterative methods for solving large-scale linear systems, offering guaranteed convergence with low per-iteration cost. However, their numerical stability…
We study discrete-time random dynamical systems where each fibre map is an orientation-preserving homeomorphism of the circle. We prove that the existence of a random periodic cycle with period at least two implies that the random rotation…
Let A be any set of positive integers and n a positive integer. A composition of n with parts in A is an ordered collection of one or more elements in A whose sum is n. We derive generating functions for the number of compositions of n with…
In this article some difficulties are deduced from the set of natural numbers. By using the method of transfinite recursion we define an iterative process which is designed to deduct all the non-greatest elements of the set of natural…
The problem of N-digit sets all permutations of which give primes is discussed. Such sets may include only digits 1, 3, 7 and 9, and none of 0, 2, 5, 4, 6, 8. Direct calculations show that such full-permutation digit sets occur at N = 1, 2,…
We present a simple yet powerful and applicable quadrature based scheme for constructing optimal iterative methods. According to the, still unproved, Kung-Traub conjecture an optimal iterative method based on $n+1$ evaluations could achieve…