Search Results for ""

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

The algorithm of constructing and interpreting a quotient-difference table which allows interconversion of continued fractions, power series, and rational functions ...

For a group G and a normal subgroup N of G, the quotient group of N in G, written G/N and read "G modulo N", is the set of cosets of N in G. Quotient groups are also called ...

A quotient ring (also called a residue-class ring) is a ring that is the quotient of a ring A and one of its ideals a, denoted A/a. For example, when the ring A is Z (the ...

The quotient space X/∼ of a topological space X and an equivalence relation ∼ on X is the set of equivalence classes of points in X (under the equivalence relation ∼) ...

Suppose that V={(x_1,x_2,x_3)} and W={(x_1,0,0)}. Then the quotient space V/W (read as "V mod W") is isomorphic to {(x_2,x_3)}=R^2. In general, when W is a subspace of a ...

A RAT-free ("right angle triangle-free") set is a set of points, no three of which determine a right triangle. Let f(n) be the largest integer such that a RAT-free subset of ...

Given a series of positive terms u_i and a sequence of positive constants {a_i}, use Kummer's test rho^'=lim_(n->infty)(a_n(u_n)/(u_(n+1))-a_(n+1)) (1) with a_n=n, giving ...

For any constructible function f, there exists a function P_f such that for all functions t, the following two statements are equivalent: 1. There exists an algorithm A such ...