The composition of the gcd and certain arithmetic functions.

Bordellès, Olivier

Displaying similar documents to “The composition of the gcd and certain arithmetic functions.”

Some remarks on a paper of L. Tóth.

De Koninck, Jean-Marie, Kátai, Imre (2010)

Journal of Integer Sequences [electronic only]

Similarity:

Hyperlogarithmic expansion and the volume of a hyperbolic simplex

K. Aomoto (1992)

Banach Center Publications

Similarity:

Rate of growth of a transient cookie random walk.

Basdevant, Anne-Laure, Singh, Arvind (2008)

Electronic Journal of Probability [electronic only]

Similarity:

Almost powers in the Lucas sequence

Yann Bugeaud, Florian Luca, Maurice Mignotte, Samir Siksek (2008)

Journal de Théorie des Nombres de Bordeaux

Similarity:

The famous problem of determining all perfect powers in the Fibonacci sequence ${(F_{n})}_{n \geq 0}$ and in the Lucas sequence ${(L_{n})}_{n \geq 0}$ has recently been resolved []. The proofs of those results combine modular techniques from Wiles’ proof of Fermat’s Last Theorem with classical techniques from Baker’s theory and Diophantine approximation. In this paper, we solve the Diophantine equations $L_{n} = q^{a} y^{p}$ , with $a > 0$ and $p \geq 2$ , for all primes $q < 1087$ and indeed for all but $13$ primes $q < 10^{6}$ . Here the strategy of [] is not sufficient due to the sizes...

Omega result for the error term in the mean square formula for Dirichlet $L$ -functions.

Lau, Yuk-Kam, Tsang, Kai-Man (2008)

Annales Academiae Scientiarum Fennicae. Mathematica

Similarity:

The divisor problem for binary cubic forms

Tim Browning (2011)

Journal de Théorie des Nombres de Bordeaux

Similarity:

We investigate the average order of the divisor function at values of binary cubic forms that are reducible over $ℚ$ and discuss some applications.

Asymptotically normal explicit estimation of parameters in the Michaelis--Menten equation.

Linke, Yu.Yu., Sakhanenko, A.I. (2001)

Sibirskij Matematicheskij Zhurnal

Similarity:

Weighted uniform consistency of kernel density estimators with general bandwidth sequences.

Dony, Julia, Einmahl, Uwe (2006)

Electronic Journal of Probability [electronic only]

Similarity:

Landau’s function for one million billions

Marc Deléglise, Jean-Louis Nicolas, Paul Zimmermann (2008)

Journal de Théorie des Nombres de Bordeaux

Similarity:

Let $𝔖_{n}$ denote the symmetric group with $n$ letters, and $g (n)$ the maximal order of an element of $𝔖_{n}$ . If the standard factorization of $M$ into primes is $M = q_{1}^{α_{1}} q_{2}^{α_{2}} ... q_{k}^{α_{k}}$ , we define $ℓ (M)$ to be $q_{1}^{α_{1}} + q_{2}^{α_{2}} + ... + q_{k}^{α_{k}}$ ; one century ago, E. Landau proved that $g (n) = {max}_{ℓ (M) \leq n} M$ and that, when $n$ goes to infinity, $log g (n) \sim \sqrt{n log (n)}$ . There exists a basic algorithm to compute $g (n)$ for $1 \leq n \leq N$ ; its running time is $𝒪 (N^{3 / 2} / \sqrt{log N})$ and the needed memory is $𝒪 (N)$ ; it allows computing $g (n)$ up to, say, one million. We describe an algorithm to calculate $g (n)$ for $n$ up to $10^{15}$ . The main idea is to use the...