Skip to Content

11 Results Found

  • Article
  • Open Access
3 Citations
3,758 Views
16 Pages

14 January 2023

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 a...

(This article belongs to the Special Issue Algebraic, Analytic, and Computational Number Theory and Its Applications)
  • Article
  • Open Access
2,385 Views
15 Pages

Repdigits as Sums of Four Tribonacci Numbers

  • Yuetong Zhou,
  • Peng Yang,
  • Shaonan Zhang and
  • Kaiqiang Zhang

16 September 2022

In this paper, we show that 66666 is the largest repdigit expressible as the sum of four tribonacci numbers. We used Binet’s formula, Baker’s theory, and a reduction method during the proving procedure. We also used the periodic propertie...

(This article belongs to the Topic Engineering Mathematics)
  • Article
  • Open Access
16 Citations
3,684 Views
8 Pages

13 August 2020

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.

(This article belongs to the Section E1: Mathematics and Computer Science)
  • Article
  • Open Access
5 Citations
2,966 Views
7 Pages

26 October 2020

In this paper, we use Baker’s theory for nonzero linear forms in logarithms of algebraic numbers and a Baker-Davenport reduction procedure to find all repdigits (i.e., numbers with only one distinct digit in its decimal expansion, thus they can...

(This article belongs to the Section B: Mathematics)
  • Article
  • Open Access
2,304 Views
10 Pages

24 September 2022

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...

(This article belongs to the Section B: Mathematics)
  • Article
  • Open Access
3 Citations
4,555 Views
12 Pages

Curious Generalized Fibonacci Numbers

  • Jose L. Herrera,
  • Jhon J. Bravo and
  • Carlos A. Gómez

15 October 2021

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...

  • Article
  • Open Access
12 Citations
3,353 Views
8 Pages

7 October 2020

In this paper, we study the problem of the explicit intersection of two sequences. More specifically, we find all repdigits (i.e., numbers with only one repeated digit in its decimal expansion) which can be written as the product of a Fibonacci by a...

(This article belongs to the Special Issue New Insights in Algebra, Discrete Mathematics, and Number Theory)
  • Article
  • Open Access
8 Citations
3,604 Views
10 Pages

22 March 2021

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. In this paper,...

(This article belongs to the Special Issue Mathematical Analysis and Analytic Number Theory 2020)
  • Article
  • Open Access
1 Citations
1,349 Views
16 Pages

27 February 2025

Let (Pk)k≥0 be a Padovan sequence and (Rk)k≥0 be a Perrin sequence. Let n, m, b, and k be non-negative integers, where 2≤b≤10. In this paper, we are devoted to delving into the equations Rn=bdPm+Rk and Rn=bdRm+Pk, where d is the number of...

(This article belongs to the Section B: Mathematics)
  • Article
  • Open Access
1 Citations
698 Views
14 Pages

Permutation-Invariant Niven Numbers

  • Huiling Wu and
  • Senyue Lou

19 January 2026

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...

(This article belongs to the Section B: Mathematics)
  • Article
  • Open Access
226 Views
19 Pages

16 October 2026

This paper investigates the explicit solvability of the congruence equation 10n≡1(mod9n). By exploiting properties of repdigit Niven numbers, we introduce several infinite families of primes with the square-free property and memory, thereby pro...

(This article belongs to the Topic Advances in Integrable Systems: Theory, Methods and Applications)