Lucas balancing numbers

Kálmán Liptai

Skip to main content (access key 's'), Skip to navigation (access key 'n'), Accessibility information (access key '0')

The search session has expired. Please query the service again.

Displaying similar documents to “Lucas balancing numbers”

Counting Keith numbers.

Klazar, Martin, Luca, Florian (2007)

Journal of Integer Sequences [electronic only]

Similarity:

Concatenations with binary recurrent sequences.

Banks, William D., Luca, Florian (2005)

Journal of Integer Sequences [electronic only]

Similarity:

On the Euler function of repdigits

Florian Luca (2008)

Czechoslovak Mathematical Journal

Similarity:

For a positive integer $n$ we write $φ (n)$ for the Euler function of $n$ . In this note, we show that if $b > 1$ is a fixed positive integer, then the equation $φ (x \frac{b^{n} - 1}{b - 1}) = y \frac{b^{m} - 1}{b - 1}, where x, y \in {1, ..., b - 1},$ has only finitely many positive integer solutions $(x, y, m, n)$ .

On positive integers with a certain nondivisibility property.

Baoulina, Ioulia, Luca, Florian (2008)

Annales Mathematicae et Informaticae

Similarity:

Euler indicators of binary recurrence sequences.

Florian Luca (2002)

Collectanea Mathematica

Similarity:

On the powerful part of $n^{2} + 1$

Jan-Christoph Puchta (2003)

Archivum Mathematicum

Similarity:

We show that $n^{2} + 1$ is powerfull for $O (x^{2 / 5 + ϵ})$ integers $n \leq x$ at most, thus answering a question of P. Ribenboim.

Displaying similar documents to “Lucas balancing numbers”

Counting Keith numbers.

Concatenations with binary recurrent sequences.

On the Euler function of repdigits

On positive integers with a certain nondivisibility property.

Euler indicators of binary recurrence sequences.

On the powerful part of n 2 + 1

On the powerful part of $n^{2} + 1$