Related papers: Calculating the day of the week: null-days algorit…
In this work, we consider the properties of the two-term Machin-like formula and develop an algorithm for computing digits of $\pi$ by using its rational approximation. In this approximation, both terms are constructed by using a…
The weekly maintenance schedule specifies when maintenance activities should be performed on the equipment, taking into account the availability of workers and maintenance bays, and other operational constraints. The current approach to…
We first describe three algorithms for computing the Lyndon array that have been suggested in the literature, but for which no structured exposition has been given. Two of these algorithms execute in quadratic time in the worst case, the…
I explain a direct approach to differentiation and integration. Instead of relying on the general notions of real numbers, limits and continuity, we treat functions as the primary objects of our theory, and view differentiation as division…
This survey article is the outgrowth of two talks given at the Journ\'ees X-UPS "P\'eriodes et transcendance" at \'Ecole polytechnique. Periods are complex numbers whose real and imaginary parts can be written as integrals of rational…
Decimal-to-binary conversion is important to modern binary computers. The classical method to solve this problem is based on division operation. In this paper, we investigate a decimal-to-binary conversion method based on addition…
Let $f$ be a fixed (holomorphic or Maass) modular cusp form. Let $\cq$ be a Dirichlet character mod $q$. We describe a fast algorithm that computes the value $L(1/2,f\times\chi_q)$ up to any specified precision. In the case when $q$ is…
This paper introduces a simple index that helps to assess the degree of aging or rejuvenation of a (non)repairable system. The index ranges from -1 to 1 and is negative for the class of decreasing failure rate distributions (or…
Given a non-negative integer $n$, we establish a formula for the number of finite magmas on a set with cardinality $n$ up to isomorphism. We then generalize the method to operations with arbitrary finite arity, which yields a corrected…
The Moore-Hodgson Algorithm minimizes the number of late jobs on a single machine. That is, it finds an optimal schedule for the classical problem $1~|\;|~\sum{U_j}$. Several proofs of the correctness of this algorithm have been published.…
This paper presents an integer decomposition method. The method first writes an integer as a polynomial with 2 as variable that its coefficients are zero or one. Then, suppose that an integer is decomposed into product of such two…
We give a simple recursive formula to obtain the general sum of the first $N$ natural numbers to the $r$th power. Our method allows one to obtain the general formula for the $(r+1)$th power once one knows the general formula for the $r$th…
The Douglas-Rachford algorithm is a classical and powerful splitting method for minimizing the sum of two convex functions and, more generally, finding a zero of the sum of two maximally monotone operators. Although this algorithm is well…
We present a new GCD algorithm of two integers or polynomials. The algorithm is iterative and its time complexity is still $O(n \\log^2 n ~ log \\log n)$ for $n$-bit inputs.
We give an effective procedure to explicitly find the decomposition of a polarized abelian variety into its simple factors if a period matrix is known. Since finding this datum is not easy, we also provide two methods to compute the period…
A new algorithm to generate all Dyck words is presented, which is used in ranking and unranking Dyck words. We emphasize the importance of using Dyck words in encoding objects related to Catalan numbers. As a consequence of formulas used in…
We describe an algorithm to count the number of distinct real zeros of a polynomial (square) system f. The algorithm performs O(n D kappa(f)) iterations where n is the number of polynomials (as well as the dimension of the ambient space), D…
The representation of any integer as the sum of two cubes to a fixed modulus is always possible if and only if the modulus is not divisible by seven or nine. For a positive non-prime integer N there is given an inductive way to find its…
A positive integer is expressed as a sum of squares of positive integers in a unique way applying a special technique. The expression, thus obtained is resolved into two factors using the concept of the Clifford algebra. This technique is…
Date and Darwen have proposed a theory of types, the latter forms the basis of a detailed presentation of a panoply of simple and complex types. However, this proposal has not been structured in a formal system. Specifically, Date and…