Search Results for ""
2931 - 2940 of 13134 for complexity theorySearch Results
A number N=p_1p_2...p_n where the p_is are distinct primes and n>=3 such that p_i=Ap_(i-1)+B (1) for i=1, 2, ..., n, p_0 taken as 1, and with A and B some fixed integers. For ...
The singleton set {0}, with respect to the trivial group structure defined by the addition 0+0=0. The element 0 is the additive identity element of the group, and also the ...
The subset {0} of a ring. It trivially fulfils the definition of ideal since it is a group (specifically, the zero group), and it is closed under multiplication by any ...
The zero product property asserts that, for elements a and b, ab=0=>a=0 or b=0. This property is especially relevant when considering algebraic structures because, e.g., ...
A generic word for a very large number. The term has no well-defined mathematical meaning. Conway and Guy (1996) define the nth zillion as 10^(3n+3) in the American system ...
F_mF_(n+1)-F_nF_(m+1)=(-1)^nF_(m-n), where F_n is a Fibonacci number.
The de Grey-Haugstrup graphs are two 6-chromatic graphs on 47 and 48 vertices that are unit-distance in 3 dimensions (de Grey and Haugstrup 2020).
A k-colored graph is a labeled k-colorable graph together with its coloring function (Finch 2003).
A k-partite graph is a graph whose graph vertices can be partitioned into k disjoint sets so that no two vertices within the same set are adjacent.
n-minex is defined as 10^(-n).
...
View search results from all Wolfram sites (28442 matches)

