Search Results for ""

If p and q are distinct odd primes, then the quadratic reciprocity theorem states that the congruences x^2=q (mod p) x^2=p (mod q) (1) are both solvable or both unsolvable ...

A finite simple connected graph G is quadratically embeddable if its quadratic embedding constant QEC(G) is nonpositive, i.e., QEC(G)<=0. A graph being quadratically ...

One of the four divisions of observations which have been grouped into four equal-sized sets based on their statistical rank. The quartile including the top statistically ...

The quasirhombicuboctahedron is the name given by Wenninger (1989, p. 132) to the uniform polyhedron with Maeder index 17 (Maeder 1997), Wenninger index 85 (Wenninger 1989), ...

A quintic nonhamiltonian graph is a quintic graph that is nonhamiltonian. A number of such graphs are illustrated above. Owens (1980) showed that there exists a ...

The limiting rabbit sequence written as a binary fraction 0.1011010110110..._2 (OEIS A005614), where b_2 denotes a binary number (a number in base-2). The decimal value is ...

Let G=(V,E) be a finite graph, let Omega be the set Omega={0,1}^E whose members are vectors omega=(omega(e):e in E), and let F be the sigma-algebra of all subsets of Omega. A ...

Consider the Fibonacci-like recurrence a_n=+/-a_(n-1)+/-a_(n-2), (1) where a_0=0, a_1=1, and each sign is chosen independently and at random with probability 1/2. ...

A rational amicable pair consists of two integers a and b for which the divisor functions are equal and are of the form sigma(a)=sigma(b)=(P(a,b))/(Q(a,b))=R(a,b), (1) where ...

Reciprocation is an incidence-preserving transformation in which points are transformed into their polars. A projective geometry-like duality principle holds for ...