Search results
Results from the WOW.Com Content Network
In number theory, a narcissistic number [1] [2] (also known as a pluperfect digital invariant (PPDI), [3] an Armstrong number [4] (after Michael F. Armstrong) [5] or a plus perfect number) [6] 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.
Given a number base , a natural number with digits is an automorphic number if is a fixed point of the polynomial function = over /, the ring of integers modulo.As the inverse limit of / is , the ring of -adic integers, automorphic numbers are used to find the numerical representations of the fixed points of () = over .
Given a set of functional dependencies , an Armstrong relation is a relation which satisfies all the functional dependencies in the closure + and only those dependencies. Unfortunately, the minimum-size Armstrong relation for a given set of dependencies can have a size which is an exponential function of the number of attributes in the ...
The Digital Library of Mathematical Functions (DLMF) is an online project at the National Institute of Standards and Technology (NIST) to develop a database of mathematical reference data for special functions and their applications. It is intended as an update of Abramowitz's and Stegun's Handbook of Mathematical Functions (A&S). [1]
By this construction, the function that defines the harmonic number for complex values is the unique function that simultaneously satisfies (1) H 0 = 0, (2) H x = H x−1 + 1/x for all complex numbers x except the non-positive integers, and (3) lim m→+∞ (H m+x − H m) = 0 for all complex values x.
Main page; Contents; Current events; Random article; About Wikipedia; Contact us
Computing the Ackermann function can be restated in terms of an infinite table. First, place the natural numbers along the top row. To determine a number in the table, take the number immediately to the left. Then use that number to look up the required number in the column given by that number and one row up.
The series of fibonorials is asymptotic to a function of the golden ratio : ! (+) / /.Here the fibonorial constant (also called the fibonacci factorial constant [1]) is defined by = = (), where = and is the golden ratio.