ScholarLens Back to search
1970•Communications of the ACMOpen access

Algorithm 386: Greatest common divisor of n integers and multipliers

Gordon H. Bradley

Open full text 4 citations

Abstract

The classical exponential integral is defined bywhere the integral is to be interpreted as the Cauchy principal value.Except for the sign, it represents the natural extension of the function El(z) ~ f~ e-$ --at=-E,(-z), largzl< 3. z t to the negative real axis.The rational approximations and corresponding intervals used in this routine are: Eu,(x) --e~ I1

Open-access reader

About this research paper

What this paper is about

The classical exponential integral is defined bywhere the integral is to be interpreted as the Cauchy principal value.Except for the sign, it represents the natural extension of the function El(z) ~ f~ e-$ --at=-E,(-z), largzl< 3. z t to the negative real axis.The rational approximations and corresponding intervals used in this routine are: Eu,(x) --e~ I1

Why it matters

OpenAlex reports 4 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

The classical exponential integral is defined bywhere the integral is to be interpreted as the Cauchy principal value.Except for the sign, it represents the natural extension of the function El(z) ~ f~ e-$ --at=-E,(-z), largzl< 3. z t to the negative real axis.The rational approximations and corresponding intervals used in this routine are: Eu,(x) --e~ I1

Key concepts: Greatest common divisor, Citation, Haven, Computer science, Divisor (algebraic geometry), Arithmetic, Combinatorics, Mathematics

Related papers

Related paper 1Related paper 2Related paper 3
Back to paper searchBrowse research topicsOriginal source
Algorithm 386: Greatest common divisor of n integers and multipliers — Research Paper | ScholarLens