TOPICS
Search

Search Results for ""


4551 - 4560 of 13134 for Extremal graph theorySearch Results
A non-Abelian group, also sometimes known as a noncommutative group, is a group some of whose elements do not commute. The simplest non-Abelian group is the dihedral group ...
A number which is simultaneously a nonagonal number N_m and heptagonal number Hep_n and therefore satisfies the Diophantine equation 1/2m(7m-5)=1/2n(5n-4). (1) Completing the ...
A number which is simultaneously a nonagonal number N_m and hexagonal number Hex_n and therefore satisfies the Diophantine equation 1/2m(7m-5)=n(2n-1). (1) Completing the ...
A polygonal number of the form N_n=n(7n-5)/2, also called an enneagonal number. The first few are 1, 9, 24, 46, 75, 111, 154, 204, ... (OEIS A001106). The generating function ...
A number which is simultaneously a nonagonal number N_m and octagonal number O_n and therefore satisfies the Diophantine equation 1/2m(7m-5)=n(3n-2). (1) Completing the ...
A number which is simultaneously a nonagonal number N_m and pentagonal number P_n and therefore satisfies the Diophantine equation 1/2m(7m-5)=1/2n(3n-1). (1) Completing the ...
A number which is simultaneously a nonagonal number N_m and a square number S_n and therefore satisfies the Diophantine equation 1/2m(7m-5)=n^2. (1) Completing the square and ...
A number which is simultaneously a nonagonal number N_m and a triangular number T_n and therefore satisfies the Diophantine equation. 1/2m(7m-5)=1/2n(1+n). (1) Completing the ...
A knot which is not alternating. Unlike alternating knots, flype moves are not sufficient to pass between all minimal diagrams of a given nonalternating knot (Hoste et al. ...
A nondeterministic Turing machine is a "parallel" Turing machine that can take many computational paths simultaneously, with the restriction that the parallel Turing machines ...
1 ... 453|454|455|456|457|458|459 ... 1314 Previous Next

...