Results 51 to 60 of about 133 (87)

Permutation-Invariant Niven Numbers

This paper introduces permutation-invariant Niven numbers (PINNs), a novel class of Niven numbers where all digit permutations (with leading zeros automatically ignored) must retain the Niven property. We demonstrate that there exist infinitely many such
Senyue Lou, Huiling Wu
core   +1 more source

Fibonacci and Lucas numbers as products of three repdigits in base $g$

, 2022
Recall that repdigit in base $g$ is a positive integer that has only one digit in its base $g$ expansion, i.e. a number of the form $a(g^m-1)/(g-1)$, for some positive integers $m\geq 1$, $g\geq 2$ and $1\leq a\leq g-1$.
Adedji, Kouessi Norbert, Togbe, Alain, Filipin, Alan   +2 more
core  

Covering Subsets of the Integers and a Result on Digits of Fibonacci Numbers [PDF]

, 2017
A covering system of the integers is a finite system of congruences where each integer satisfies at least one of the congruences. Two questions in covering systems have been of particular interest in the mathematical literature.
Harvey, Wilson Andrew
core   +1 more source

Szeparábilis változójú diofantikus egyenletek

, 2017
Disszertációnkban néhány speciális típusú szeparábilis diofantikus egyenletet vizsgáltunk. Az első részben repdigit számok és l-ed rendű k dimenziójú figurális számok egyenlő értékeinek vizsgálatával foglalkoztunk.
Péter, Gyöngyvér
core  

The KHOKHAR Square Digital Root Transformation: 7443 A Fixed-Point Analysis of a 4-Digit Graph-Based Iterative Map

We introduce a deterministic iterative transformation T on four-digit strings. The transforma- tion places the four digits on the vertices of a square, replaces each edge by the digital root of the sum of its two endpoint digits, and subtracts the ...
Zakria null, Misbah Ayoub, Muhammad Saddam Khokhar   +2 more
core   +1 more source

Repdigits as sums of three Fibonacci numbers

Mathematical Communications, 2012
In this paper, we find all base 10 repdigits which are sums of three Fibonacci numbers.
openaire   +2 more sources

The Periodic Block Theorem for Repdigit Division

This paper studies the divisibility structure of repdigits R(n,d) = d·(10ⁿ−1)/9 (the n-digit integer formed by repeating digit d ∈ {1,...,9}, referred to here as a "repdigit") by an integer m coprime to 10. It is shown that for every such m, there exists a unique minimal positive integer p*(m), called the repunit period of m, such ...
openaire   +1 more source

Products of three Fibonacci numbers that are repdigit

, 2023
Alan, Murat, Şimşek Alan, Kadiriye
core  

Some of the next articles are maybe not open access.

Related searches:

Repdigit Keith numbers

Lithuanian Mathematical Journal, 2013
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Jhon Jairo Bravo Grijalba, Florian Luca
exaly   +2 more sources

Lucas numbers which are concatenations of two repdigits

Boletin De La Sociedad Matematica Mexicana, 2021
Let \(\{L_n\}_{n\ge 0}\) be the Lucas-companion of the Fibonacci sequence given by \(L_0=2,~L_1=1\) and \(L_{n+2}=L_{n+1}+L_n\) for all \(n\ge 0\). In the paper under review, the authors show that the only Lucas numbers \(L_n\) which are concatenations of two rep-digits; that is, their base \(10\)-representation is of the form \(a\cdots ab\cdots b ...
Fatih Erduvan, Refik Keskin
exaly   +4 more sources