Search Results for ""

The quotient of two polynomials p(x) and q(x), discarding any polynomial remainder. Polynomial quotients are implemented in the Wolfram Language as PolynomialQuotient[p, q, ...

The remainder R(x) obtained when dividing a polynomial p(x) by another polynomial q(x). The polynomial remainder is implemented in the Wolfram Language as ...

Find two numbers such that x^2=y^2 (mod n). If you know the greatest common divisor of n and x-y, there exists a high probability of determining a prime factor. Taking small ...

A partial solution to the Erdős squarefree conjecture which states that the binomial coefficient (2n; n) is never squarefree for all sufficiently large n>=n_0. Sárkőzy (1985) ...

cos(pi/(10)) = 1/4sqrt(10+2sqrt(5)) (1) cos((3pi)/(10)) = 1/4sqrt(10-2sqrt(5)) (2) cot(pi/(10)) = sqrt(5+2sqrt(5)) (3) cot((3pi)/(10)) = sqrt(5-2sqrt(5)) (4) csc(pi/(10)) = ...

cos(pi/(15)) = 1/8(sqrt(30+6sqrt(5))+sqrt(5)-1) (1) cos((2pi)/(15)) = 1/8(sqrt(30-6sqrt(5))+sqrt(5)+1) (2) cos((4pi)/(15)) = 1/8(sqrt(30+6sqrt(5))-sqrt(5)+1) (3) ...

Algorithmic graph theory is the study of graph traversal and generation and the complexity of these operations. Topics in algorithmic graph theory include Eulerian and ...

The symbol O(x), pronounced "big-O of x," is one of the Landau symbols and is used to symbolically express the asymptotic behavior of a given function. In particular, if n is ...

A bundle map is a map between bundles along with a compatible map between the base manifolds. Suppose p:X->M and q:Y->N are two bundles, then F:X->Y is a bundle map if there ...

A Turing machine is called deterministic if there is always at most one instruction associated with a given present internal state/tape state pair (q,s). Otherwise, it is ...