Related papers: How to approximate irrational numbers nicely?
In this paper we describe an algorithm for implicitizing rational hypersurfaces in case there exists at most a finite number of base points. It is based on a technique exposed in math.AG/0210096, where implicit equations are obtained as…
When implementing regular enough functions (e.g., elementary or special functions) on a computing system, we frequently use polynomial approximations. In most cases, the polynomial that best approximates (for a given distance and in a given…
In this paper we find an identity that gives a representation for the logarithm of any two irrational numbers $a, b >1$ in terms of a series whose terms are ratios of elements from the Beatty Sequences generated by these two numbers. We…
This paper offers a solution method that allows one to find exact values for a large class of convergent series of rational terms. Sums of this form arise often in problems dealing with Quantum Field Theory.
Rational and neural network based approximations are efficient tools in modern approximation. These approaches are able to produce accurate approximations to nonsmooth and non-Lipschitz functions, including multivariate domain functions. In…
In this paper we propose a method for proving some exponential inequalities based on power series expansion and analysis of derivations of the corresponding functions. Our approach provides a simple proof and generates a new class of…
Real number calculations on elementary functions are remarkably difficult to handle in mechanical proofs. In this paper, we show how these calculations can be performed within a theorem prover or proof assistant in a convenient and highly…
Weird numbers are abundant numbers that are not pseudoperfect. Since their introduction, the existence of odd weird numbers has been an open problem. In this work, we describe our computational effort to search for odd weird numbers, which…
In this paper we suggest NICE: a new algorithm to generate counterfactual explanations for heterogeneous tabular data. The design of our algorithm specifically takes into account algorithmic requirements that often emerge in real-life…
We attach a ring of sequences to each number from a certain class of extremal real numbers, and we study the properties of this ring both from an analytic point of view by exhibiting elements with specific behaviors, and also from an…
If the cosine of a rational multiple of $\pi$ is a rational number then it is an integral multiple of $\frac12$. For this fact, we give a proof accessible to an interested school student. We then discuss which quadratic and cubic…
Anthropic reasoning is a critical tool to understand probabilities, especially in a large universe or multiverse. According to anthropic reasoning, we should consider ourselves typical among members of a reference class that must include…
We consider simple rational functions $R_{mn}(x)=P_m(x)/Q_n(x)$, with $P_m$ and $Q_n$ polynomials of degree $m$ and $n$ respectively. We look for "nice" functions, which we define to be ones where as many as possible of the roots, poles,…
We study the ``approximate squaring'' map f(x) := x ceiling(x) and its behavior when iterated. We conjecture that if f is repeatedly applied to a rational number r = l/d > 1 then eventually an integer will be reached. We prove this when…
We shall present effective approximations measures for certain infinite products related to $q$-exponential function. There are two main targets. First we shall prove an explicit irrationality measure result for the values of…
Based on continued fractions with subtractions, we identify the set of real numbers with the set of infinite integer sequences with all terms but the first one greater or equal to two. Each such sequence produces in a canonical way a unique…
If an irreducible fraction $\frac mn>0$ can be decomposed into the sum of several irreducible proper fractions with different denominators, and the positive number smaller than $\frac mn$ in fractional ideal $\frac 1n\mathbb Z$ can not be…
Inspired by computer assisted proofs in analysis, we present an interval approach to real-number computations.
We give a procedure for counting the number of different proofs of a formula in various sorts of propositional logic. This number is either an integer (that may be 0 if the formula is not provable) or infinite.
We propose a relatively simple computational neural-network model of number comparison. Training on comparisons of the integers 1-9 enable the model to efficiently and accurately simulate a wide range of phenomena, including distance and…