Results 31 to 40 of about 109 (79)
On repdigits powers in base beta
Lietuvos matematikos rinkinys, 2022 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
Repdigits in Euler functions of associated pell numbers
Proceedings - Mathematical Sciences, 2020 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]
Mathematica Slovaca, 2020 Abstract Let ( P n ) n ≥0 be the sequence of Padovan numbers defined by P
openaire +5 more sources
Repdigits in Narayana's Cows Sequence and their Consequences
, 2020 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
Patterns obtained from digit and iterative digit sums of Palindromic, Repdigit and Repunit numbers, its variants and subsets [PDF]
, 2016 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 in k-generalized Pell sequence
, 2020 Let $k\geq 2$ and let $(P_{n}^{(k)})_{n\geq 2-k}$ be $k$-generalized Pell sequence defined by \begin{equation*}P_{n}^{(k)}=2P_{n-1}^{(k)}+P_{n-2}^{(k)}+...+P_{n-k}^{(k)}\end{equation*} for $n\geq 2$ with initial conditions \begin{equation*}P_{-(k-2)}^{(k)}=P_{-(k-3)}^{(k)}=\cdot \cdot \cdot =P_{-1}^{(k)}=P_{0}^{(k)}=0,P_{1}^{(k)}=1.
Şiar, Zafer, Keskin, Refik
openaire +2 more sources
, 2020 A Lucas sequence is a binary recurrence sequences that includes as special cases, the Pell, the associatedPell, the balancing, the Lucasbalancing, the balancinglike and the associated balancinglike sequences.
Sahukar, Manasi Kumari
core
Padovan numbers that are concatenations of two repdigits [PDF]
, 2020 Let $ (P_{n})_{n\ge 0} $ be the sequence of Padovan numbers defined by $ P_0=0 $, $ P_1 =1=P_2$, and $ P_{n+3}= P_{n+1} +P_n$ for all $ n\ge 0 $. In this paper, we find all Padovan numbers that are concatenations of two repdigits.
openaire +1 more source
On repdigits as product of consecutive Fibonacci numbers
, 2012 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
Special Number or a Mere Numerical Array? Effect of Repdigits on Judgments and Choices. [PDF]
Front Psychol, 2020 Honda H, Matsunaga S, Ueda K.
europepmc +1 more source