Search Results for ""

A quasiperfect number, called a "slightly excessive number" by Singh (1997), is a "least" abundant number, i.e., one such that sigma(n)=2n+1. Quasiperfect numbers are ...

A graph G that becomes disconnected when removing a suitable complete subgraph K, called a vertex cut, is said to be quasiseparable. The two simplest cases are those where K ...

The base-4 method of counting in which only the digits 0, 1, 2, and 3 are used. The illustration above shows the numbers 0 to 63 represented in quaternary, and the following ...

The quaternion group is one of the two non-Abelian groups of the five total finite groups of order 8. It is formed by the quaternions +/-1, +/-i, +/-j, and +/-k , denoted Q_8 ...

Qubic is a generalization of tic-tac-toe in which players alternately place pieces to get four in a row (rows, columns, pillars, face diagonals, or space diagonals) on a ...

A qubit (or quantum bit) is the analog of a bit for quantum computation. Unlike an ordinary bit, which may only assume two possible values (usually called 0 and 1), a qubit ...

A technical conjecture which connects algebraic K-theory to étale cohomology. The conjecture was made more precise by Dwyer and Friedlander (1982). Thomason (1985) ...

A quintic symmetric graph is a quintic graph (i.e., regular of degree 5) that is also symmetric. Since quintic graphs exist only on an even number of nodes, so do symmetric ...

A positive integer n>1 is quiteprime iff all primes p<=sqrt(n) satisfy |2[n (mod p)]-p|<=p+1-sqrt(p). Also define 2 and 3 to be quiteprimes. Then the first few quiteprimes ...

A generalization of simple majority voting in which a list of quotas {q_0,...,q_n} specifies, according to the number of votes, how many votes an alternative needs to win ...