Search Results for ""
321 - 330 of 730 for Rising Factorial PowerSearch Results
Calculus II
The (connected) caveman graph is a graph arising in social network theory formed by modifying a set of isolated k-cliques (or "caves") by removing one edge from each clique ...
Brocard's problem asks to find the values of n for which n!+1 is a square number m^2, where n! is the factorial (Brocard 1876, 1885). The only known solutions are n=4, 5, and ...
A q-analog, also called a q-extension or q-generalization, is a mathematical expression parameterized by a quantity q that generalizes a known expression and reduces to the ...
The number 24 is equal to 4! (four factorial). A number puzzle asks to construct 24 in as many ways possible using elementary mathematical operations on three copies of the ...
|_n]={n for n!=0; 1 for n=0. (1)
A set of n cells in an n×n square such that no two come from the same row and no two come from the same column. The number of transversals of an n×n square is n! (n ...
The function defined by U(p)=(p#)^(p#), where p is a prime number and p# is a primorial. The values for p=2, 3, ..., are 4, 46656, ...
In set theory, a unary operation on set A is a function A->A. More generally, a unary operation is a function with exactly one operand, such as the factorial, square root, or ...
A "visual representation" number which is a sum of some simple function of its digits. For example, 1233 = 12^2+33^2 (1) 2661653 = 1653^2-266^2 (2) 221859 = 22^3+18^3+59^3 ...
...