Related papers: A Tripos Surd
We refine a result of the last two Authors of [8] on a Diophantine approximation problem with two primes and a $k$-th power of a prime which was only proved to hold for $1<k<4/3$. We improve the $k$-range to $1<k\le 3$ by combining Harman's…
In the reduced basis method, the evaluation of the a posteriori estimator can become very sensitive to round-off errors. In this note, the origin of the loss of accuracy is revealed, and a solution to this problem is proposed and…
This short article presents explicit expressions for roots of a quartic equation that has all four real roots. Although a general expression for quartic roots is available on Wikipedia, an optimized and slightly shorter expression for only…
We evaluate in closed form several classes of finite trigonometric sums. Two general methods are used. The first is new and involves sums of roots of unity. The second uses contour integration and extends a previous method used by two of…
A curious number is a palindromic number whose base ten representation has the form $a \ldots a b \ldots b a \ldots a$. In this paper, we determine all curious numbers that are perfect squares. Our proof involves reducing the search for…
We analyse the solution to the Thomas-Fermi equation discovered by Majorana. We show that the series for the slope at origin enables one to obtain results of accuracy far beyond those provided by available methods. We also estimate the…
In the mid-eighties Tardos proposed a strongly polynomial algorithm for solving linear programming problems for which the size of the coefficient matrix is polynomially bounded by the dimension. Combining Orlin's primal-based modification…
An iterative square root of a function $f$ is a function $g$ such that $g(g(\cdot))=f(\cdot)$. We obtain new characterizations for detecting the non-existence of such square roots for self-maps on arbitrary sets. This is used to prove that…
The classical quadratic formula and some of its lesser known variants for solving the quadratic equation are reviewed. Then, a new formula for the roots of a quadratic polynomial is presented.
We study the inference of network archaeology in growing random geometric graphs. We consider the root finding problem for a random nearest neighbor tree in dimension $d \in \mathbb{N}$, generated by sequentially embedding vertices…
It is well-known that when searching one out of four, the original Grover's search algorithm is exact; that is, it succeeds with certainty. It is natural to ask the inverse question: If we are not searching one out of four, is Grover's…
In this paper we study the properties of an algorithm for generating continued fractions in the field of p-adic numbers $\mathbb{Q}_p$. First of all, we obtain an analogue of the Galois' Theorem for classical continued fractions. Then, we…
This is an expanded version of a write-up of a talk given in the fall of 2000 in Oberwolfach. A large part of it is intended to be understandable by non-number theorists with a mathematical background. The talk covered some of the history,…
We study quadratic forms that can occur as trace forms of Galois field extensions L/K, under the assumption that K contains a primitive 4th root of unity. M. Epkenhans conjectured that any such form is a scaled Pfister form. We prove this…
The solution of the cubic equation has a century-long history; however, the usual presentation is geared towards applications in algebra and is somewhat inconvenient to use in optimization where frequently the main interest lies in real…
To support exactly tracking a neutron moving along a given line segment through a CAD model with quadric surfaces, this paper considers the arithmetic precision required to compute the order of intersection points of two quadrics along the…
This paper is an enhanced version of a more than decade-older paper with a similar title. Many formulae involving both finite and infinite sums of digamma and polygamma functions up to quadratic order, few of which appear in standard…
From the Rhind Papyrus and other extant sources, we know that the ancient Egyptians were very iterested in expressing a given fraction into a sum of unit fractions, that is fractions whose numerators are equal to 1. One of the problems that…
An technically interesting proof of a known theorem.
We discuss a possible generalisation of a conjecture of Bley, Burns and Hahn concerning the relation between the second Adams-operator twisted Galois-Gauss sums of weakly ramified Artin characters and the square root of the inverse…