Search Results for ""

The set closure of the set of arguments of a function f for which f is not zero.

The Reidemeister move of type I.

A conjecture concerning primes.

The house graph is a simple graph on 5 nodes and 6 edges, illustrated above in two embeddings, whose name derives from its resemblance to a schematic illustration of a house ...

The Watkins snark is the snark on 50 vertices ad 75 nodes illustrated above. It is implemented in the Wolfram Language as GraphData["WatkinsSnark"].

The moth graph is the 6-vertex graph illustrated above. It is implemented in the Wolfram Language as GraphData["MothGraph"].

The singleton graph is the graph consisting of a single isolated node with no edges. It is therefore the empty graph on one node. It is commonly denoted K_1 (i.e., the ...

The silver ratio is the quantity defined by the continued fraction delta_S = [2,2,2,...] (1) = 2+1/(2+1/(2+1/(2+...))) (2) (Wall 1948, p. 24). It follows that ...

Find nontrivial solutions to sigma(x^2)=sigma(y^2) other than (x,y)=(4,5), where sigma(n) is the divisor function. Nontrivial solutions means that solutions which are ...

Barban's constant is defined as C_(Barban) = product_(p)[1+(3p^2-1)/(p(p+1)(p^2-1))] (1) = 2.596536... (2) (OEIS A175640), where the product is over the primes p.