Search Results for ""
101 - 110 of 13135 for Babylonian Number SystemSearch Results
A number which can be computed to any number of digits desired by a Turing machine. Surprisingly, most irrationals are not computable numbers!
An even number is an integer of the form n=2k, where k is an integer. The even numbers are therefore ..., -4, -2, 0, 2, 4, 6, 8, 10, ... (OEIS A005843). Since the even ...
The ordered pair (s,t), where s is the number of real embeddings of the number field and t is the number of complex-conjugate pairs of embeddings. The degree of the number ...
Given a Lyapunov characteristic exponent sigma_i, the corresponding Lyapunov characteristic number lambda_i is defined as lambda_i=e^(sigma_i). (1) For an n-dimensional ...
The Ramsey number R(m,n) gives the solution to the party problem, which asks the minimum number of guests R(m,n) that must be invited so that at least m will know each other ...
A Ramsey number of the form R(k,k;2).
A 10-digit number satisfying the following property. Number the digits 0 to 9, and let digit n be the number of ns in the number. There is exactly one such number: 6210001000.
A slightly archaic term for a computer-generated random number. The prefix pseudo- is used to distinguish this type of number from a "truly" random number generated by a ...
A number which can be specified implicitly or explicitly by exponential, logarithmic, and algebraic operations.
An unhappy number is a number that is not happy, i.e., a number n such that iterating this sum-of-squared-digits map starting with n never reaches the number 1. The first few ...
...
View search results from all Wolfram sites (185317 matches)

