Results 1 to 10 of about 39 (35)
Special Number or a Mere Numerical Array? Effect of Repdigits on Judgments and Choices [PDF]
Previous studies have shown that people find special meaning in numerical arrays. In this article, we have focused on the features of numerical arrays, repdigits (e.g., “777”), and examined the effect of repdigits on judgments and choices.
Hidehito Honda +2 more
doaj +4 more sources
Lucas Numbers Which Are Concatenations of Two Repdigits
In this paper, we find all Lucas numbers written in the form c⋯cd⋯d¯, where c⋯cd⋯d¯ is the concatenation of two repdigits in base 10 with c,d∈{0,1,⋯,9}, c≠d and c>0.
Yunyun Qu, Jiwen Zeng
doaj +3 more sources
Padovan numbers which are palindromic concatenations of two distinct repdigits [PDF]
Taboka Prince Chalebgwa +1 more
exaly +2 more sources
Lucas sequences and repdigits [PDF]
Let $(G_n)_{n \geq1}$ be a binary linear recurrence sequence that is represented by the Lucas sequences of the first and second kind, which are $\{U_n\}$ and $\{V_n\}$, respectively.
Hayder Raheem Hashim, Szabolcs Tengely
doaj +1 more source
Repdigits in the base $b$ as sums of four balancing numbers [PDF]
The sequence of balancing numbers $(B_n)$ is defined by the recurrence relation $B_n=6B_{n-1}-B_{n-2}$ for $n\geq2$ with initial conditions $B_0=0$ and $B_1=1.$ $B_n$ is called the $n$th balancing number. In this paper, we find all repdigits in the base $
Refik Keskin, Fatih Erduvan
doaj +1 more source
Almost Repdigit k-Fibonacci Numbers with an Application of k-Generalized Fibonacci Sequences
In this paper, we define the notion of almost repdigit as a positive integer whose digits are all equal except for at most one digit, and we search all terms of the k-generalized Fibonacci sequence which are almost repdigits. In particular, we find all k-
Alaa Altassan, Murat Alan
doaj +1 more source
Repdigits as difference of two Fibonacci or Lucas numbers
In the present study we investigate all repdigits which are expressed as a difference of two Fibonacci or Lucas numbers. We show that if $F_{n}-F_{m}$ is a repdigit, where $F_{n}$ denotes the $n$-th Fibonacci number, then $(n,m)\in \{(7,3),(9,1),(9,2 ...
P. Ray, K. Bhoi
doaj +1 more source
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.
Igoris Belovas
doaj +1 more source
Repdigits as Product of Terms of k-Bonacci Sequences
For any integer k≥2, the sequence of the k-generalized Fibonacci numbers (or k-bonacci numbers) is defined by the k initial values F−(k−2)(k)=⋯=F0(k)=0 and F1(k)=1 and such that each term afterwards is the sum of the k preceding ones.
Petr Coufal, Pavel Trojovský
doaj +1 more source
Curious Generalized Fibonacci Numbers
A generalization of the well-known Fibonacci sequence is the k−Fibonacci sequence whose first k terms are 0,…,0,1 and each term afterwards is the sum of the preceding k terms. In this paper, we find all k-Fibonacci numbers that are curious numbers (i.e.,
Jose L. Herrera +2 more
doaj +1 more source

