Related papers: Jost B\"urgi's Method for Calculating Sines
A set of algorithms is presented for efficient numerical calculation of the time evolution of classical dynamical systems. Starting with a first approximation for solving the differential equations that has a "reversible" character, we show…
Cyclic codes are among the most important families of codes in coding theory for both theoretical and practical reasons. Despite their prominence and intensive research on cyclic codes for over a half century, there are still open problems…
We describe an algorithm for computing Bernoulli numbers. Using a parallel implementation, we have computed B(k) for k = 10^8, a new record. Our method is to compute B(k) modulo p for many small primes p, and then reconstruct B(k) via the…
In this paper, a novel approach is introduced for classifying curves into proper families, according to their similarity. First, a mathematical quantity we call plane curvature is introduced and a number of propositions are stated and…
The early Renaissance artist Albrecht Durer published a book on geometry a few years before he died. This was intended to be a guide for young craftsmen and artists giving them both practical and mathematical tools for their trade. In the…
Efficient methods are proposed, for computing integrals appeaing in electronic structure calculations. The methods consist of two parts: the first part is to represent the integrals as contour integrals and the second one is to evaluate the…
In this paper, the numerical differentiation by integration method based on Jacobi polynomials originally introduced by Mboup, Fliess and Join is revisited in the central case where the used integration window is centered. Such method based…
We study generalized log-sine integrals at special values. At $\pi$ and multiples thereof explicit evaluations are obtained in terms of Nielsen polylogarithms at $\pm1$. For general arguments we present algorithmic evaluations involving…
We solve multiple conjectures by Byszewski and Ulas about the sum of base $b$ digits function. In order to do this, we develop general results about summations over the sum of digits function. As a corollary, we describe an unexpected new…
In this paper we present a modification of DJ Method [J. Math. Anal. Appl. 316 (2006), 753-763] to solve the nonlinear equations more efficiently. It is observed that the modified DJ method is faster and hence it has accelerated convergence…
Brent and McMillan introduced in 1980 a new algorithm for the computation of Euler's constant $\gamma$, based on the use of the Bessel functions I\_0(x) and K\_0(x). It is the fastest known algorithm for the computation of $\gamma$. The…
To many people, music is a mystery. It is uniquely human, because no other species produces elaborate, well organized sound for no particular reason. It has been part of every known civilization on earth. It has become a very part of man's…
Translation from the Latin original, "Inventio summae cuiusque seriei ex dato termino generali" (1735). E47 in the Enestrom index. In this paper Euler derives the Euler-Maclaurin summation formula, by expressing y(x-1) with the Taylor…
In 1987 Jonathan and Peter Borwein, inspired by the works of Ramanujan, derived many efficient algorithms for computing $\pi$. We will see that by using only a formula of Gauss's and elementary algebra we are able to prove the correctness…
In 1999 Allan Swett checked (in 150 hours) the Erd\H{o}s-Straus conjecture up to $N=10^{14}$ with a sieve based on a single modular equation. After having proved the existence of a "complete" set of seven modular equations (including three…
We give a complete and elementary proofs of "Jordan's sums" and study Euler's types sums. In particular we give a formula for the sum of series with same weight, which is similar to this one of classical 2-Euler's sums.
We describe an algorithm, meant to be very general, to compute a presentation of the group of units of an order in a (semi)simple algebra over Q. Our method is based on a generalisation of Vorono\"i's algorithm for computing perfect forms,…
In this paper, we proposed a new efficient sorting algorithm based on insertion sort concept. The proposed algorithm called Bidirectional Conditional Insertion Sort (BCIS). It is in-place sorting algorithm and it has remarkably efficient…
Since the early twentieth century, intervals and tuning systems have been subjects of discussion among Iranian musicians and scholars. The process of Westernization and then a cultural back to roots movement are among the reasons that…
A covering system is a finite collection of arithmetic progressions whose union is the set of integers. The study of these objects was initiated by Erd\H{o}s in 1950, and over the following decades he asked many questions about them. Most…