Search Results for ""

Let kappa_1 and kappa_2 be the principal curvatures, then their mean H=1/2(kappa_1+kappa_2) (1) is called the mean curvature. Let R_1 and R_2 be the radii corresponding to ...

The Meredith graph is a quartic nonhamiltonian graph on 70 nodes and 140 edges that is a counterexample to the conjecture that every 4-regular 4-connected graph is ...

The smallest value of a set, function, etc. The minimum value of a set of elements A={a_i}_(i=1)^N is denoted minA or min_(i)a_i, and is equal to the first element of a ...

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 Monty Hall problem is named for its similarity to the Let's Make a Deal television game show hosted by Monty Hall. The problem is stated as follows. Assume that a room is ...

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

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

A statement which appears self-contradictory or contrary to expectations, also known as an antinomy. Curry (1977, p. 5) uses the term pseudoparadox to describe an apparent ...

The Parts graphs are a set of unit-distance graphs with chromatic number five derived by Jaan Parts in 2019-2020 (Parts 2020a). They provide some of the smallest known ...

The Pell numbers are the numbers obtained by the U_ns in the Lucas sequence with P=2 and Q=-1. They correspond to the Pell polynomial P_n(x) and Fibonacci polynomial F_n(x) ...