Search Results for ""
481 - 490 of 13135 for Multiplicative Number TheorySearch Results
A set of numbers obeying a pattern like the following: 91·37 = 3367 (1) 9901·3367 = 33336667 (2) 999001·333667 = 333333666667 (3) 99990001·33336667 = 3333333366666667 (4) 4^2 ...
By way of analogy with the eban numbers, aban numbers are defined as numbers whose English names do not contain the letter "a" (i.e., "a" is banned). Note that this ...
It is possible to construct simple functions which produce growing patterns. For example, the Baxter-Hickerson function f(n)=1/3(2·10^(5n)-10^(4n)+2·10^(3n)+10^(2n)+10^n+1) ...
A member of the smallest algebraically closed subfield L of C which is closed under the exponentiation and logarithm operations.
The pentanacci numbers are a generalization of the Fibonacci numbers defined by P_0=0, P_1=1, P_2=1, P_3=2, P_4=4, and the recurrence relation ...
By way of analogy with the eban numbers, uban numbers are defined as numbers whose English names do not contain the letter "u" (i.e., "u" is banned). Note that this ...
The first few numbers not known to produce palindromes when applying the 196-algorithm (i.e., a reverse-then-add sequence) are sometimes known as Lychrel numbers. This term ...
The tetranacci numbers are a generalization of the Fibonacci numbers defined by T_0=0, T_1=1, T_2=1, T_3=2, and the recurrence relation T_n=T_(n-1)+T_(n-2)+T_(n-3)+T_(n-4) ...
Let I(x,y) denote the set of all vertices lying on an (x,y)-graph geodesic in G, then a set S with I(S)=V(G) is called a geodetic set in G and is denoted g(G).
The eban numbers are the sequence of numbers whose names (in English) do not contain the letter "e" (i.e., "e" is "banned"). The name was coined by N. J. A. Sloane around ...
...
View search results from all Wolfram sites (56265 matches)

