1 citations · 1 across the 3 of their papers we have counts for
3 papers
math.NT2011★ 1 cited
An Algorithm to Generate Square-Free Numbers and to Compute the Moebius Function
Fernando Auil
We introduce an algorithm that iteratively produces a sequence of natural numbers k_i and functions b_i. The number k_(i+1) arises as the first point of discontinuity of b_i above…
math.NT2004
A Sequence of Beurling Functions Related to the Natural Approximation B_{n} Defined by an Iterative Construction Generating Square-Free Numbers k and the Value of the Mobius Function at k
F. Auil
We construct iteratively a sequence of numbers k_{n} and Beurling functions A_{n} converging pointwise to -1 in [0,1]. We prove results which seems to suggest that each A_{n} is eq…
math.NT2004
Fourier Coefficients of Beurling Functions and a Class of Mellin Transform Formally Determined by its Values on the Even Integers
F. Auil
It is a well-known fact that Riemann Hypothesis will follows if the function identically equal to -1 can be arbitrarily approximated in the norm $\norma{.}$ of by…