Search Results for ""
6141 - 6150 of 6485 for Finite Group D 4Search Results
De Grey (2018) found the first examples of unit-distance graphs with chromatic number 5, thus demonstrating that the solution to the Hadwiger-Nelson problem (i.e., the ...
The modified bessel function of the second kind is the function K_n(x) which is one of the solutions to the modified Bessel differential equation. The modified Bessel ...
A Diophantine problem (i.e., one whose solution must be given in terms of integers) which seeks a solution to the following problem. Given n men and a pile of coconuts, each ...
An NSW number (named after Newman, Shanks, and Williams) is an integer m that solves the Diophantine equation 2n^2=m^2+1. (1) In other words, the NSW numbers m index the ...
Let T_1 be the point at which the J_1-excircle meets the side A_2A_3 of a triangle DeltaA_1A_2A_3, and define T_2 and T_3 similarly. Then the lines A_1T_1, A_2T_2, and A_3T_3 ...
Napier's bones, also called Napier's rods, are numbered rods which can be used to perform multiplication of any number by a number 2-9. By placing "bones" corresponding to ...
The 2-cusped epicycloid is called a nephroid. The name nephroid means "kidney shaped" and was first used for the two-cusped epicycloid by Proctor in 1878 (MacTutor Archive). ...
The Neuberg A_1-circle is the locus of the polygon vertex A_1 of a triangle on a given base A_2A_3 and with a given Brocard angle omega. From the center N_1, the base A_2A_3 ...
A nonhamiltonian graph is a graph that is not Hamiltonian. All disconnected graphs are therefore nonhamiltoinian, as are acylic graphs. Classes of connected graphs that are ...
A nonplanar graph is a graph that is not planar. The numbers of simple nonplanar graphs on n=1, 2, ... nodes are 0, 0, 0, 0, 1, 14, 222, 5380, 194815, ... (OEIS A145269), ...
...
View search results from all Wolfram sites (352745 matches)

