Frugal number

Last updated February 09, 2023

In number theory, a frugal number is a natural number in a given number base that has more digits than the number of digits in its prime factorization in the given number base (including exponents).^[1] For example, in base 10, 125 = 5³, 128 = 2⁷, 243 = 3⁵, and 256 = 2⁸ are frugal numbers (sequence A046759 in the OEIS ). The first frugal number which is not a prime power is 1029 = 3 × 7³. In base 2, thirty-two is a frugal number, since 32 = 2⁵ is written in base 2 as 100000 = 10¹⁰¹.

Mathematical definition

Let $b>1$ be a number base, and let $K_{b}(n)=\lfloor \log _{b}{n}\rfloor +1$ be the number of digits in a natural number $n$ for base $b$ . A natural number $n$ has the prime factorisation

n=\prod _{\stackrel {p\,\mid \,n}{p{\text{ prime}}}}p^{v_{p}(n)}

where $v_{p}(n)$ is the p-adic valuation of $n$ , and $n$ is an frugal number in base $b$ if

K_{b}(n)>\sum _{\stackrel {p\,\mid \,n}{p{\text{ prime}}}}K_{b}(p)+\sum _{\stackrel {p^{2}\,\mid \,n}{p{\text{ prime}}}}K_{b}(v_{p}(n)).

Notes

↑ Darling, David J. (2004). The universal book of mathematics: from Abracadabra to Zeno's paradoxes. John Wiley & Sons. p. 102. ISBN 978-0-471-27047-8.

Related Research Articles

In number theory, an arithmetic, arithmetical, or number-theoretic function is for most authors any function f(n) whose domain is the positive integers and whose range is a subset of the complex numbers. Hardy & Wright include in their definition the requirement that an arithmetical function "expresses some arithmetical property of n".

The number $e$ , also known as Euler's number, is a mathematical constant approximately equal to 2.71828 that can be characterized in many ways. It is the base of the natural logarithms. It is the limit of $(1 + 1/ n) n$ as $n$ approaches infinity, an expression that arises in the study of compound interest. It can also be calculated as the sum of the infinite series

The Möbius function $μ (n)$ is a multiplicative function in number theory introduced by the German mathematician August Ferdinand Möbius (also transliterated Moebius) in 1832. It is ubiquitous in elementary and analytic number theory and most often appears as part of its namesake the Möbius inversion formula. Following work of Gian-Carlo Rota in the 1960s, generalizations of the Möbius function were introduced into combinatorics, and are similarly denoted $μ (x)$ .

<span class="mw-page-title-main">Prime number</span> Evenly divided only by 1 or itself

A prime number is a natural number greater than 1 that is not a product of two smaller natural numbers. A natural number greater than 1 that is not prime is called a composite number. For example, 5 is prime because the only ways of writing it as a product, 1 × 5 or 5 × 1, involve 5 itself. However, 4 is composite because it is a product (2 × 2) in which both numbers are smaller than 4. Primes are central in number theory because of the fundamental theorem of arithmetic: every natural number greater than 1 is either a prime itself or can be factorized as a product of primes that is unique up to their order.

In mathematics, the prime number theorem (PNT) describes the asymptotic distribution of the prime numbers among the positive integers. It formalizes the intuitive idea that primes become less common as they become larger by precisely quantifying the rate at which this occurs. The theorem was proved independently by Jacques Hadamard and Charles Jean de la Vallée Poussin in 1896 using ideas introduced by Bernhard Riemann.

<span class="mw-page-title-main">Euler's totient function</span> Number of integers coprime to and not exceeding n

In number theory, Euler's totient function counts the positive integers up to a given integer $n$ that are relatively prime to $n$ . It is written using the Greek letter phi as $or, and may also be called Euler's phi function . In other words, it is the number of integers k in the range 1 \leq k \leq n for which the greatest common divisor gcd(n, k) is equal to 1. The integers k of this form are sometimes referred to as totatives of n .$

The tables contain the prime factorization of the natural numbers from 1 to 1000.

In number theory, a Smith number is a composite number for which, in a given number base, the sum of its digits is equal to the sum of the digits in its prime factorization in the given number base. In the case of numbers that are not square-free, the factorization is written without exponents, writing the repeated factor as many times as needed.

In mathematics, a harshad number in a given number base is an integer that is divisible by the sum of its digits when written in that base. Harshad numbers in base $n$ are also known as $n$ -harshad numbers. Harshad numbers were defined by D. R. Kaprekar, a mathematician from India. The word "harshad" comes from the Sanskrit harṣa (joy) + da (give), meaning joy-giver. The term "Niven number" arose from a paper delivered by Ivan M. Niven at a conference on number theory in 1977.

In number theory, a self number or Devlali number in a given number base $is a natural number that cannot be written as the sum of any other natural number and the individual digits of . 20 is a self number, because no such combination can be found. 21 is not, because it can be written as 15 + 1 + 5 using n = 15. These numbers were first described in 1949 by the Indian mathematician D. R. Kaprekar.$

In mathematics, the digit sum of a natural number in a given number base is the sum of all its digits. For example, the digit sum of the decimal number $would be$

In number theory, a Dudeney number in a given number base $is a natural number equal to the perfect cube of another natural number such that the digit sum of the first natural number is equal to the second. The name derives from Henry Dudeney, who noted the existence of these numbers in one of his puzzles, Root Extraction, where a professor in retirement at Colney Hatch postulates this as a general method for root extraction.$

In number theory, a narcissistic number in a given number base $is a number that is the sum of its own digits each raised to the power of the number of digits.$

The Copeland–Erdős constant is the concatenation of "0." with the base 10 representations of the prime numbers in order. Its value, using the modern definition of prime, is approximately

A sum-product number in a given number base $is a natural number that is equal to the product of the sum of its digits and the product of its digits.$

In number theory, an extravagant number (also known as a wasteful number) is a natural number in a given number base that has fewer digits than the number of digits in its prime factorization in the given number base (including exponents). For example, in base 10, 4 = 2², 6 = 2×3, 8 = 2³, and 9 = 3² are extravagant numbers (sequence A046760 in the OEIS).

In number theory, an equidigital number is a natural number in a given number base that has the same number of digits as the number of digits in its prime factorization in the given number base, including exponents but excluding exponents equal to 1. For example, in base 10, 1, 2, 3, 5, 7, and 10 are equidigital numbers. All prime numbers are equidigital numbers in any base.

In number theory and mathematical logic, a Meertens number in a given number base $is a natural number that is its own Gödel number. It was named after Lambert Meertens by Richard S. Bird as a present during the celebration of his 25 years at the CWI, Amsterdam.$

In number theory, the prime omega functions $and count the number of prime factors of a natural number Thereby counts each distinct prime factor, whereas the related function counts the total number of prime factors of honoring their multiplicity. That is, if we have a prime factorization of of the form for distinct primes, then the respective prime omega functions are given by and . These prime factor counting functions have many important number theoretic relations.$

The purpose of this page is to catalog new, interesting, and useful identities related to number-theoretic divisor sums, i.e., sums of an arithmetic function over the divisors of a natural number $, or equivalently the Dirichlet convolution of an arithmetic function with one:$

References

R.G.E. Pinch (1998), Economical Numbers

This page is based on this Wikipedia article
Text is available under the CC BY-SA 4.0 license; additional terms may apply.
Images, videos and audio are available under their respective licenses.

[Darling102-1] Darling, David J. (2004). The universal book of mathematics: from Abracadabra to Zeno's paradoxes. John Wiley & Sons. p. 102. ISBN 978-0-471-27047-8.

[1]

v t e Divisibility-based sets of integers
Overview	Integer factorization Divisor Unitary divisor Divisor function Prime factor Fundamental theorem of arithmetic
Factorization forms	Prime Composite Semiprime Pronic Sphenic Square-free Powerful Perfect power Achilles Smooth Regular Rough Unusual
Constrained divisor sums	Perfect Almost perfect Quasiperfect Multiply perfect Hemiperfect Hyperperfect Superperfect Unitary perfect Semiperfect Practical Erdős–Nicolas
With many divisors	Abundant Primitive abundant Highly abundant Superabundant Colossally abundant Highly composite Superior highly composite Weird
Aliquot sequence-related	Untouchable Amicable (Triple) Sociable Betrothed
Base-dependent	Equidigital Extravagant Frugal Harshad Polydivisible Smith
Other sets	Arithmetic Deficient Friendly Solitary Sublime Harmonic divisor Descartes Refactorable Superperfect

Frugal number

Contents

Mathematical definition

See also

Notes

Related Research Articles

References