Search references for PRIME OMEGA-FUNCTION. Phrases containing PRIME OMEGA-FUNCTION
See searches and references containing PRIME OMEGA-FUNCTION!PRIME OMEGA-FUNCTION
Number of prime factors of a natural number
number theory, the prime omega functions ω(n) and Ω(n) count the number of prime factors of a natural number n. The number of distinct prime factors is assigned
Prime_omega_function
Topics referred to by the same term
f∈Ω(g), meaning that the function f dominates g in some limit The prime omega function Ω(n), giving the total number of prime factors of n, counting them
Omega_function
Last letter of the Greek alphabet
cube roots of 1 The Wright Omega function A generic differential form In number theory, ω(n) is the number of distinct prime divisors of n In number theory
Omega
Iterative algorithm on numbers
sequence. Repeat step 2. The sequence is called a Kaprekar sequence and the function Kb(n)=α−β is the Kaprekar mapping. Some numbers map to themselves; these
Kaprekar's_routine
Function that can be written as a sum over prime factors
function Ω(n), defined as the total number of prime factors of n, counting multiple factors multiple times, sometimes called the "Big Omega function"
Additive_function
Integer having a non-trivial divisor
factorization Sieve of Eratosthenes Table of prime factors Divisor function Prime omega function Möbius function Pettofrezzo & Byrkit 1970, pp. 23–24. Long
Composite_number
Function whose domain is the positive integers
above the prime omega functions ω and Ω are defined by ω(n) = k, Ω(n) = a1 + a2 + ... + ak. To avoid repetition, formulas for the functions listed in
Arithmetic_function
Number divisible only by 1 and itself
primes. The prime-counting function π(n) is defined as the number of primes not greater than n. For example, π(11)=5, since there are five primes
Prime_number
Möbius μ function: Sum of the nth primitive roots of unity, it depends on the prime factorization of n. Prime omega functions Chebyshev functions Liouville
List of mathematical functions
List_of_mathematical_functions
Mathematical function
In mathematics, the prime zeta function is an analogue of the Riemann zeta function, studied by Glaisher (1891). It is defined as the following infinite
Prime_zeta_function
Numbers with a certain property involving recursive summation
eventually reaches 1 when iterated over the perfect digital invariant function for p=2. The origin of happy numbers is not clear. Happy numbers were brought
Happy_number
Product of two prime numbers
π2(n)=∑k=1π(n)[π(npk)−k+1] where π(x) is the prime-counting function and pk denotes the kth prime. To see this, take pk to be the smaller prime factor. Then pk≤n, and the
Semiprime
Integer filtered out using a sieve similar to that of Eratosthenes
This sieve is similar to the sieve of Eratosthenes that generates the primes, but it eliminates numbers based on their position in the remaining set
Lucky_number
Infinite integer series where the next number is the sum of the two preceding it
digits. If Ln is prime then n is 0, prime, or a power of 2. L2m is prime for m = 1, 2, 3, and 4 and no other known values of m. Every prime number divides
Lucas_number
Arithmetic function
product of powers of primes: n=p1a1⋯pkak, where p1,…,pk are primes and the exponents a1,…,ak are positive integers. The prime omega function Ω(n) counts the
Liouville_function
Ten raised to an integer power
Superior highly composite Superperfect Prime omega functions Almost prime Semiprime Euler's totient function Highly cototient Highly totient Noncototient
Power_of_10
Numbers that contain only the digit 1
repunit prime is a repunit that is also a prime number. Primes that are repunits in base-2 are Mersenne primes. As of May 2025, the largest known prime number
Repunit
Topics referred to by the same term
and Ω± in big O notation Omega and agemo subgroup, in group theory Ω, an element in a subsumption lattice Prime omega function, in number theory The solid
Omega_(disambiguation)
Numbers with many divisors
counting function QL(x) of largely composite numbers satisfies (logx)c≤logQL(x)≤(logx)d for positive c and d with 0.2≤c≤d≤0.5. Because the prime factorization
Highly_composite_number
Numbers k where x - phi(x) = k has many solutions
than any other integer below k and above 1. Here, ϕ is Euler's totient function. There are infinitely many solutions to the equation for k = 1 so this
Highly_cototient_number
Type of number introduced by Mike Keith
Superior highly composite Superperfect Prime omega functions Almost prime Semiprime Euler's totient function Highly cototient Highly totient Noncototient
Keith_number
notations. 5. In number theory, may denote the prime omega function. That is, ω(n) is the number of distinct prime factors of the integer n. Many types of bracket
Glossary of mathematical symbols
Glossary_of_mathematical_symbols
Class of natural numbers with many divisors
all natural numbers k > 1 we have d(n)nε≥d(k)kε where d(n), the divisor function, denotes the number of divisors of n. The term was coined by Ramanujan
Superior highly composite number
Superior_highly_composite_number
Prime such that p^2 divides 2^(p-1)-1
In number theory, a Wieferich prime is a prime number p such that p2 divides 2p − 1 − 1, therefore connecting these primes with Fermat's little theorem
Wieferich_prime
Recursive integer sequence
or via generating functions. The only odd Catalan numbers Cn are those for which n = 2k − 1; all others are even. The only prime Catalan numbers are
Catalan_number
Number that represents a hexagon with a dot in the center
H(n+1)=H(n)+6n. From this we can calculate the generating function F(x)=∑n≥0H(n)xn. The generating function satisfies F(x)=x+xF(x)+∑n≥26nxn. The latter term is
Centered_hexagonal_number
Integers occurring in the coefficients of the Taylor series of 1/cosh t
expansion 1cosht=2et+e−t=∑n=0∞Entnn!, where cosh(t) is the hyperbolic cosine function. The Euler numbers are related to a special value of the Euler polynomials
Euler_number
Count of the possible partitions of a set
probability distribution as a function of the first n cumulants. The Bell numbers obey Touchard's congruence: If p is any prime number then B p + n ≡ B n
Bell_number
Centered figurate number
superstar prime is a star prime whose prime index is also a star number. The first two such numbers are 661 and 1750255921. A reverse superstar prime is a
Star_number
Multiplicative function in number theory
ω(n) and Ω(n) are the prime omega functions. ω(n) is the number of distinct prime divisors of n, and Ω(n) is the number of prime factors of n, counted
Möbius_function
Integer having only small prime factors
is an integer whose prime factors are all less than or equal to n. For example, a 7-smooth number is a number in which every prime factor is at most 7
Smooth_number
a prime which does not divide n may be called 0 or may be considered undefined. ω(n) and Ω(n), the prime omega functions, count the number of prime factors
Table_of_prime_factors
Prime number of the form 2^n – 1
In mathematics, a Mersenne prime is a prime number that is one less than a power of two. That is, it is a prime number of the form Mn = 2n − 1 for some
Mersenne_prime
Numbers obtained by adding the two previous ones
exists a prime p such that Fp−(p5)≡0(modp2). Such primes (if there are any) would be called Wall–Sun–Sun primes. Also, if p ≠ 5 is an odd prime number then:
Fibonacci_sequence
Result of multiplying four instances of a number together
Superior highly composite Superperfect Prime omega functions Almost prime Semiprime Euler's totient function Highly cototient Highly totient Noncototient
Fourth_power
Number of form 2^(2^p-1)-1 with prime exponent
"Martian prime". Cunningham chain Double exponential function Fermat number Perfect number Wieferich prime Chris Caldwell, Mersenne Primes: History,
Double_Mersenne_number
Type of composite number with an even number of digits
Superior highly composite Superperfect Prime omega functions Almost prime Semiprime Euler's totient function Highly cototient Highly totient Noncototient
Vampire_number
Number whose square ends in the same digits
{\displaystyle 2^{\omega (b)}} zeroes to g ( x ) = x 2 − x {\displaystyle g(x)=x^{2}-x} , where the prime omega function ω ( b ) {\displaystyle \omega (b)} is the
Automorphic_number
Composite number in number theory
property whenever n is prime. Carmichael numbers of order m=1 are just the ordinary Carmichael numbers. The nth-power-raising function pn is also defined
Carmichael_number
Type of Poulet number
get super-Poulet numbers with 3 distinct prime divisors. If you find three Poulet numbers with three common prime factors, you get a super-Poulet number
Super-Poulet_number
Figurate number
with the factorial function, a product whose factors are the integers from 1 to n, Donald Knuth proposed the name Termial function, with the notation
Triangular_number
Counts pieces of a disk cut by lines
Superior highly composite Superperfect Prime omega functions Almost prime Semiprime Euler's totient function Highly cototient Highly totient Noncototient
Lazy_caterer's_sequence
Type of composite integer
{\displaystyle n} with prime factorization n = ∏ p prime p ∣ n , p v p ( n ) {\displaystyle n=\prod _{\stackrel {p\mid n,}{p{\text{ prime}}}}p^{v_{p}(n)}}
Smith_number
Repeated sum of a number's digits
the digital root of a positive integer n may be defined by using floor function ⌊x⌋, as drb(n)=n−(b−1)⌊n−1b−1⌋. Let b≥2 and let drb(n) denote the digital
Digital_root
Number used for counting
Representation of a number as a product of primes Countable set – Mathematical set that can be enumerated Sequence – Function of the natural numbers in another
Natural_number
Size of a geometric arrangement of points
Superior highly composite Superperfect Prime omega functions Almost prime Semiprime Euler's totient function Highly cototient Highly totient Noncototient
Figurate_number
Product of an integer with itself
represented as a sum of two squares precisely if its prime factorization contains no odd powers of primes of the form 4k + 3. This is generalized by Waring's
Square_number
Positive integer of the form (2^(2^n))+1
constructible partially depends on Fermat primes. Double exponential function Lucas' theorem Mersenne prime Pierpont prime Primality test Proth's theorem Pseudoprime
Fermat_number
Natural number with a decimal representation made of repeated instances of the same digit
repunits. Other well-known repdigits include the repunit primes and in particular the Mersenne primes (which are repdigits when represented in binary). Any
Repdigit
Type of prime number conjectured to exist
Wall–Sun–Sun prime or Fibonacci–Wieferich prime is a certain kind of prime number which is conjectured to exist, although none are known. Let p be a prime number
Wall–Sun–Sun_prime
Number, product of consecutive integers
also squarefree. The number of distinct prime factors of a pronic number is the sum of the number of distinct prime factors of n and n + 1. If 25 is appended
Pronic_number
Positive integer that is an integer power of another positive integer
∑p1p=∑k=2∞μ(k)(1−ζ(k))≈0.874464368… where μ(k) is the Möbius function and ζ(k) is the Riemann zeta function. According to Euler, Goldbach showed (in a now-lost
Perfect_power
Result of multiplying eight instances of a number together
sum of the reciprocals of the nonzero eighth powers is the Riemann zeta function evaluated at 8, which can be expressed in terms of the eighth power of
Eighth_power
Concept in number theory
Let n {\displaystyle n} be a natural number. We define the narcissistic function for base b > 1 {\displaystyle b>1} F b : N → N {\displaystyle F_{b}:\mathbb
Narcissistic_number
Class of binary number
Superior highly composite Superperfect Prime omega functions Almost prime Semiprime Euler's totient function Highly cototient Highly totient Noncototient
Evil_number
Number of ways to pair up n objects
that, asymptotically, T(n)∼(ne)n/2en(4e)1/4. The exponential generating function of the telephone numbers is G(x)=∑n=0∞T(n)xnn!=exp(x+x22). In other words
Telephone number (mathematics)
Telephone_number_(mathematics)
Three raised to an integer power
Superior highly composite Superperfect Prime omega functions Almost prime Semiprime Euler's totient function Highly cototient Highly totient Noncototient
Power_of_three
Numbers parameterizing ways to partition a set
rational ordinary generating function ∑n=k∞{nk}xn−k=∏r=1k11−rx=1xk+1(1/x)k+1 and have an exponential generating function given by ∑n=k∞{nk}xnn!=(ex−1)kk
Stirling numbers of the second kind
Stirling_numbers_of_the_second_kind
Concatenation of the first n prime numbers
Smarandache–Wellin number is a prime with 5719 digits ending in 11927, discovered by Eric W. Weisstein as a probable prime in 1998 and then proven prime in 2022. In March
Smarandache–Wellin_number
Arithmetic operation
exponent. For example, if f is a function whose valued can be multiplied, f∘n denotes exponentiation with respect to function composition, whereas fn may denote
Exponentiation
Number that is the result of operation on its own digits
recreational mathematics enthusiast. A Friedman prime is a Friedman number that is also prime. The decimal Friedman primes are: 127, 347, 2503, 12101, 12107, 12109
Friedman_number
Type of prime number
In number theory, a Wilson prime is a prime number p such that p2 divides (p−1)!+1, where "!" denotes the factorial function; compare this with Wilson's
Wilson_prime
Integer that is both a perfect square and a triangular number
product of three squares, the right hand side is square. The generating function for the square triangular numbers is: 1+z(1−z)(z2−34z+1)=1+36z+1225z2+⋯
Square_triangular_number
Integer whose multiples are digit rotations
decimal), and p is a prime that does not divide b. (Primes p that give cyclic numbers in base b are called full reptend primes or long primes in base b). For
Cyclic_number
Result of multiplying six instances of a number
Superior highly composite Superperfect Prime omega functions Almost prime Semiprime Euler's totient function Highly cototient Highly totient Noncototient
Sixth_power
Sum of a number's digits
Encyclopedia of Integer Sequences. Borwein & Borwein (1992) use the generating function of this integer sequence (and of the analogous sequence for binary digit
Digit_sum
Function defined on integers in number theory
D(n)≤nlog2n2 and D(n)≥Ω(n)nΩ(n)−1Ω(n) where Ω(n), a prime omega function, is the number of prime factors in n. In both bounds above, equality always occurs
Arithmetic_derivative
Mathematical series
function and the prime omega function: ζ(s)ζ(2s)=∑n=1∞|μ(n)|ns≡∑n=1∞μ2(n)ns. ζ2(s)ζ(2s)=∑n=1∞2ω(n)ns. We have that the Dirichlet series for the prime
Dirichlet_series
Type of figurate number
gives a general formula for any number of sides, in terms of the digamma function. The On-Line Encyclopedia of Integer Sequences eschews terms using Greek
Polygonal_number
Product of prime numbers, plus one
prime numbers). They are named after the ancient Greek mathematician Euclid, in connection with Euclid's theorem that there are infinitely many prime
Euclid_number
Polyhedral number representing a tetrahedron
factorization n(n+1)(n+2), it is impossible for a tetrahedral number to be a prime number. The only case where 4 of the factors are 1 is at n=2 2∗3∗4/6=1∗1∗4
Tetrahedral_number
Integer whose representation contains every digit in its number base
pandigital numbers, its prime factorization consists exclusively of the smallest possible prime numbers (2, 3, 5 and 7) By comparison, the prime factorization of
Pandigital_number
Result of multiplying five instances of a number together
Superior highly composite Superperfect Prime omega functions Almost prime Semiprime Euler's totient function Highly cototient Highly totient Noncototient
Fifth_power_(algebra)
Figurate number
Superior highly composite Superperfect Prime omega functions Almost prime Semiprime Euler's totient function Highly cototient Highly totient Noncototient
Pentagonal_number
Multivalued function in mathematics
In mathematics, the Lambert W function, also called the omega function or product logarithm, is a multivalued function, namely the branches of the converse
Lambert_W_function
Number that remains the same when its digits are reversed
possess a certain property and are palindromic. For instance: The palindromic primes are 2, 3, 5, 7, 11, 101, 131, 151, ... (sequence A002385 in the OEIS). The
Palindromic_number
Natural number
Leyland prime using 2 & 21 (221 + 212) 2,118,107 = largest integer n≤1010 such that ∑k=022ω(n+k)≤57, where ω(n) is the prime omega function for distinct
1,000,000
Number used to approximate the square root of 2
indices are all themselves prime. As with the Fibonacci numbers, a Pell number Pn can only be prime if n itself is prime, because if d is a divisor of
Pell_number
Square of a triangular number
Superior highly composite Superperfect Prime omega functions Almost prime Semiprime Euler's totient function Highly cototient Highly totient Noncototient
Squared_triangular_number
Two raised to an integer power
32 × 15. A prime number that is one less than a power of two is called a Mersenne prime. For example, the prime number 31 is a Mersenne prime because it
Power_of_two
Number equal to the sum of its proper divisors
positive divisors; in symbols, σ1(n)=2n where σ1 is the sum-of-divisors function. This definition is ancient, appearing as early as Euclid's Elements (Book
Perfect_number
Type of figurate number
given by the formula Mp2p−1=MpMp+12=h(Mp+1)/2=h2p−1 where Mp is a Mersenne prime. No odd perfect numbers are known, hence all known perfect numbers are hexagonal
Hexagonal_number
Number of stacked spheres in a pyramid
Superior highly composite Superperfect Prime omega functions Almost prime Semiprime Euler's totient function Highly cototient Highly totient Noncototient
Square_pyramidal_number
Concept in combinatorics
Superior highly composite Superperfect Prime omega functions Almost prime Semiprime Euler's totient function Highly cototient Highly totient Noncototient
Cake_number
Integer divisible by sum of its digits
base b. For a prime number to also be a Harshad number it must be less than or equal to the base number, otherwise the digits of the prime will add up to
Harshad_number
Probable prime that is composite
pseudoprime is a probable prime (an integer that shares a property common to all prime numbers) that is not actually prime. Pseudoprimes are classified
Pseudoprime
Number of the form x^y + y^x
Leyland numbers (so we have 1 < y ≤ x). A Leyland prime is a Leyland number that is prime. The first such primes are: 17, 593, 32993, 2097593, 8589935681, 59604644783353249
Leyland_number
Mathematical concept in prime numbers
in only one way as x2 ± Dy2 (where x2 is relatively prime to Dy2) is a prime power or twice a prime power. In particular, a number that has two distinct
Idoneal_number
Count of permutations by cycles
delta function and (m)k is the Pochhammer symbol.) For fixed n≥0 these weighted harmonic number expansions are generated by the generating function 1n
Stirling numbers of the first kind
Stirling_numbers_of_the_first_kind
Number, non-palindrome after repeated sum with reverse
also a Lychrel number. Let n be a natural number. We define the Lychrel function for a number base b > 1, Fb:ℕ→ℕ, to be the following: Fb(n)=n+∑i=0k−1dibk−i−1
Lychrel_number
Numbers whose prime factors all divide the number more than once
9435964368…, where p runs over all primes, ζ(s) denotes the Riemann zeta function, and ζ(3) is Apéry's constant. (sequence A082695 in
Powerful_number
Positive integer that is the product of three distinct prime numbers
number checking function. Look up sphenic in Wiktionary, the free dictionary. Semiprimes, products of two prime numbers. Almost prime Shyam Sunder Gupta
Sphenic_number
Area of a right triangle with rational-numbered sides
N2=ed2+e2 where c=n2/e+ea=2nb=n2/e−e For example, it is known that for a prime number p, the following holds: if p ≡ 3 (mod 8), then p is not a congruent
Congruent_number
Sequence of integers
to 2 mod 3: 8 + 2 ; 2 + 8 ; 5 + 5 ; 2 + 2 + 2 + 2 + 2 The generating function of the Padovan sequence is G(P(n);x)=1+x1−x2−x3. This can be used to prove
Padovan_sequence
Polynomial sequence
The Eulerian polynomials An(t) are defined by the exponential generating function ∑n=0∞An(t)xnn!=t−1t−e(t−1)x=(1−e(t−1)x−1t−1)−1. The Eulerian numbers A(n
Eulerian_number
Sieve method in number theory
set of prime numbers and 1ℙ(n) the characteristic function of that set, Λ(n) is the von Mangoldt function, ω(n) is the small prime omega function (which
Goldston–Pintz–Yıldırım_sieve
Power of a prime number
reciprocals converges, although the primes are a large set. The totient function (φ) and sigma functions (σ0) and (σ1) of a prime power are calculated by the
Prime_power
Special type of prime number
In number theory, a Wolstenholme prime is a special type of prime number satisfying a stronger version of Wolstenholme's theorem. Wolstenholme's theorem
Wolstenholme_prime
Figurate number
Superior highly composite Superperfect Prime omega functions Almost prime Semiprime Euler's totient function Highly cototient Highly totient Noncototient
Pyramidal_number
f(n)=2ω(n)=∑d|nμ2(d) is the power of the prime omega function, then fp(x)=1+x1−x. Suppose that f is multiplicative and g is any arithmetic function satisfying f(pn+1)=f(p)f(pn)−g(p)f(pn−1)
Bell_series
travel, tourism, insurance
PRIME OMEGA-FUNCTION
PRIME OMEGA-FUNCTION
PRIME OMEGA-FUNCTION
PRIME OMEGA-FUNCTION
PRIME OMEGA-FUNCTION
PRIME OMEGA-FUNCTION
PRIME OMEGA-FUNCTION
PRIME OMEGA-FUNCTION
PRIME OMEGA-FUNCTION
travel, tourism, insurance