Search Results for ""

The nine-point center N (sometimes instead denoted F) is the center of the nine-point circle. It has equivalent triangle center functions alpha_5 = cos(B-C) (1) alpha_5 = ...

Given a positive integer m>1, let its prime factorization be written m=p_1^(a_1)p_2^(a_2)p_3^(a_3)...p_k^(a_k). (1) Define the functions h(n) and H(n) by h(1)=1, H(1)=1, and ...

For 2<=n<=32, it is possible to select 2n lattice points with x,y in [1,n] such that no three are in a straight line (where "straight line" means any line in the plane--not ...

Given two starting numbers (a_1,a_2), the following table gives the unique sequences {a_i} that contain no three-term arithmetic progressions. Sloane sequence A003278 1, 2, ...

A noncayley graph is a graph which is not a Cayley graph. All graphs that are not vertex-transitive are noncayley graphs. However, some vertex-transitive graph are noncayley. ...

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 ...

Given a function f(x) of a variable x tabulated at m values y_1=f(x_1), ..., y_m=f(x_m), assume the function is of known analytic form depending on n parameters ...

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), ...

A normalized form of the cumulative normal distribution function giving the probability that a variate assumes a value in the range [0,x], ...

An extremely fast factorization method developed by Pollard which was used to factor the RSA-130 number. This method is the most powerful known for factoring general numbers, ...