Related papers: A general method for investigating the roots of al…
The method of exhaustion is generalized to a simple formula that can be used to integrate functions under very general conditions, provided that the integral exists. Both a geometric proof (following the usual procedure for the method of…
By using the elementary symmetric polynomials and some results of number theory, we solve the well known problem of Lehmer on Euler's totient function. As application, we obtain a new characterization of prime numbers.
This is an annotated translation of E126 'De novo genere oscillationum', in which Euler derived for the first time, the differential equation of the (undamped) simple harmonic oscillator under harmonic excitation, namely, the motion of an…
In this article, we present an iterative method to find simple roots of nonlinear equations, that is, to solving an equation of the form $f(x) = 0$. Different from Newton's method, the method we purpose do not require evaluation of…
We give a short proof, using generating functions, for a polynomial congruence for Eulerian polynomials first proved, using arrangements of hyperplanes, by Yoshinaga and later proved, using roots of unity, by Iijima, Sasaki, Takahashi, and…
We introduce a series of numbers which serve as a generalization of Bernoulli, Euler numbers and binomial coefficients. Their properties are applied to solve a probability problem and suggest a statistical test for independence and…
We give an anecdotal discussion of the problem of searching for polynomials with all roots on the unit circle, whose coefficients are rational numbers subject to certain congruence conditions. We illustrate with an example from a…
In this paper we introduce the generalization of Multi Poly-Euler polynomials and we investigate some relationship involving Multi Poly-Euler polynomials. Obtaining a closed formula for generalization of Multi Poly-Euler numbers therefore…
We study the rational approximation properties of special manifolds defined by a set of polynomials with rational coefficients. Mostly we will assume the case of all polynomials to depend on only one variable. In this case the manifold can…
Translated from the Latin original, "Theorema arithmeticum eiusque demonstratio", Commentationes arithmeticae collectae 2 (1849), 588-592. E794 in the Enestroem index. For m distinct numbers a,b,c,d,...,\upsilon,x this paper evaluates \[…
In this paper we introduce a new concept of atoms on discrete sets to develop an advanced method to find a particular solution for higher-order non-homogeneous Cauchy-Euler equations. The proposed method provides also an approximate…
We study how well a real number can be approximated by sums of two or more rational numbers with denominators up to a certain size.
We derive a generalized matrix version of Pellet's theorem, itself based on a generalized Rouch\'{e} theorem for matrix-valued functions, to generate upper, lower, and internal bounds on the eigenvalues of matrix polynomials. Variations of…
The Euclidean algorithm in algebra is applied to a class of gravitational lenses for which the lens equation consists of any set of coupled polynomial equations in the image position. In general, this algorithm allows us to reduce an…
Back in 1755, Euler explored an interesting array of numbers that now frequently appears in polynomial identities, combinatorial problems, and finite calculus, among other places. These numbers share a strong connection with well-known…
The polynomial eigenvalue problem arises in many applications and has received a great deal of attention over the last decade. The use of root-finding methods to solve the polynomial eigenvalue problem dates back to the work of…
E727 in the Enestrom index. This is a translation from the Latin original "Accuratior evolutio problematis de linea brevissima in superficie quacunque ducenda" (1779). Given a surface $pdx+qdy+rdz=0$, Euler wants to develop equations that…
We give an algorithm for computing all roots of polynomials over a univariate power series ring over an exact field $\mathbb{K}$. More precisely, given a precision $d$, and a polynomial $Q$ whose coefficients are power series in $x$, the…
In his seminal Inventiones paper from 1972 Grauert proved the existence of a semiuniversal deformation of an arbitrary complex analytic isolated singularity. For the proof he invented an approximation theorem for solving a system of…
This paper presents an alternative proof of the Fundamental Theorem of Algebra that has several distinct advantages. The proof is based on simple ideas involving continuity and differentiation. Visual software demonstrations can be used to…