AN ASYMPTOTIC UPPER BOUND FOR COUNTING FIVEN NUMBERS

被引：0
|
作者：
Hoit, Abigail [1 ]
机构：
[1] Elmhurst Univ, Dept Math, Elmhurst, NY 60126 USA
来源：
FIBONACCI QUARTERLY | 2022年 / 60卷 / 01期
关键词：
D O I：
暂无
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
In this paper, we derive an asymptotic upper bound for the number of Fiven (Factorial-Niven) numbers. A Niven number is a number that is a multiple of its digital sum. Dalenberg and Edgar recently defined a Fiven number as a number that is a multiple of its digital sum using the digits from its representation in factorial-base notation. To derive our upper bound, we closely follow the methods first used by Cooper and Kennedy and later by DeKoninck and Doyon and others for their derivations of asymptotic bounds for base-10 and other fixed-base Niven numbers.
引用
收藏
页码：52 / 56
页数：5
相关论文
共 50 条
  • [1] AN UPPER BOUND FOR RAMSEY NUMBERS
    GRAVER, JE
    YACKEL, J
    [J]. BULLETIN OF THE AMERICAN MATHEMATICAL SOCIETY, 1966, 72 (06) : 1076 - &
  • [2] An upper bound for Ramsey numbers
    Li, YS
    Rousseau, CC
    Zang, WN
    [J]. APPLIED MATHEMATICS LETTERS, 2004, 17 (06) : 663 - 665
  • [3] An asymptotic upper bound for graph embeddings
    Bartzos, Evangelos
    Emiris, Ioannis Z.
    Tzamos, Charalambos
    [J]. DISCRETE APPLIED MATHEMATICS, 2023, 327 : 157 - 177
  • [4] Asymptotic upper bound for multiplier design
    Pinch, RGE
    [J]. ELECTRONICS LETTERS, 1996, 32 (05) : 420 - 421
  • [5] AN UPPER BOUND FOR SOME RAMSEY NUMBERS
    THOMASON, A
    [J]. JOURNAL OF GRAPH THEORY, 1988, 12 (04) : 509 - 517
  • [6] Explicit upper bound for entropy numbers
    Hencl, S
    [J]. ZEITSCHRIFT FUR ANALYSIS UND IHRE ANWENDUNGEN, 2004, 23 (02): : 221 - 236
  • [7] A New Upper Bound for Sampling Numbers
    Nicolas Nagel
    Martin Schäfer
    Tino Ullrich
    [J]. Foundations of Computational Mathematics, 2022, 22 : 445 - 468
  • [8] A New Upper Bound for Sampling Numbers
    Nagel, Nicolas
    Schaefer, Martin
    Ullrich, Tino
    [J]. FOUNDATIONS OF COMPUTATIONAL MATHEMATICS, 2022, 22 (02) : 445 - 468
  • [9] An upper bound for the ramsey numbers of bistars
    Department of Mathematics, Tongji University, Shanghai
    200092, China
    [J]. Tongji Daxue Xuebao, 3 (469-470 and 490):
  • [10] An upper bound for constrained Ramsey numbers
    Wagner, Peter
    [J]. COMBINATORICS PROBABILITY & COMPUTING, 2006, 15 (04): : 619 - 626
12345