Results 31 to 40 of about 133 (87)
A repdigit számok néhány tulajdonsága
A dolgozatban az úgynevezett repdigit számok néhány tulajdonságát vizsgáltuk meg. B-repdigit számoknak nevezzük azokat az egész számokat, amelyeknek minden számjegye megegyezik a B számrendszerben.
Csillag, Balázs
core
Repdigits in Euler functions of associated pell numbers
Let \(\{Q_n\}\) denotes the sequence of numbers defined by \[ Q_0=1;~Q_1=1;~Q_{n+1}=2Q_n+Q_{n-1},~n\geq 1. \] Using elementary number theoretic notions, the following main result is proved: Theorem. Let \(d\in \{1,\ldots,9\}\) and \(m\in \mathbb{N}\).
Panda, G. K., Sahukar, M. K.
openaire +1 more source
Padovan numbers that are concatenations of two distinct repdigits [PDF]
Abstract Let ( P n ) n ≥0 be the sequence of Padovan numbers defined by P
openaire +5 more sources
On Diophantine Equations Related to Narayana’s Cows Sequence and Double Factorials or Repdigits
In this paper, we determine all the Narayana’s cows numbers that are factorials or double factorials. We also show that 88 is the only repdigit (i.e., a class of numbers that has reflectional symmetry across a vertical axis) that can be written as ...
Peng Yang, Tianxin Cai, Yanjiao Ji
core +1 more source
Repdigits in Narayana's Cows Sequence and their Consequences
Narayana's cows sequence satisfies the third-order linear recurrence relation $N_n=N_{n-1}+N_{n-3}$ for $n \geq 3$ with initial conditions $N_0=0$ and $N_1=N_2=1$. In this paper, we study $b$-repdigits which are sums of two Narayana numbers. We explicitly determine these numbers for the bases $2\le b\leq100$ as an illustration.
Bravo, Jhon J. +2 more
openaire +3 more sources
On repdigits powers in base beta
The article presents formulas for powers of repdigits in the different numeral systems. This task can be used as an exercise for computer science students to help them master the corresponding mathematical apparatus.
openaire +2 more sources
Narayana numbers as products of three repdigits in base g
In this paper, we show that there are only finitely many Narayana's numbers which can be written as a product of three repdigits in base g with g >= 2. Moreover, for 2 <= g <= 10, we determine all these numbers.
Pagdame Tiebekabe +2 more
openaire +2 more sources
Patterns obtained from digit and iterative digit sums of Palindromic, Repdigit and Repunit numbers, its variants and subsets [PDF]
The digit and iterative digit sums of Palindromic numbers, their primes and squares, repdigit, repunit, their squares and cubes produced different patterns and sequences.
Opanuga, Abiodun A. +3 more
core
Repdigits As Sums Of Two Lucas Numbers
Bu yayının lisans anlaşması koşulları tam metin açık erişimine izin vermemektedir.Let (L-n) be the Lucas sequence defined by L-n = Ln-1 + Ln-2 for n >= 2 with initial conditions L-0 = 2 and L-1 = 1.
Keskin, Refik, Siar, Zafer
core +1 more source
On repdigits as product of consecutive Fibonacci numbers [PDF]
Let (F$_{n}$)$_{n\geq0}$ be the Fibonacci sequence. In 2000, F. Luca proved that F10 = 55 is the largest repdigit (i.e. a number with only one distinct digit in its decimal expansion) in the Fibonacci sequence. In this note, we show that if Fn · · · F$
Marques, Diego, Togbé, Alain
core

