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

A nonzero vector v=(v_0,v_1,...,v_(n-1)) in n-dimensional Lorentzian space R^(1,n-1) is said to be positive lightlike if it has zero (Lorentzian) norm and if its first ...

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

A number of the form 2^n that contains the digits 666 (i.e., the beast number) is called an apocalyptic number. 2^(157) is an apocalyptic number. The first few such powers ...

A Brier number is a number that is both a Riesel number and a Sierpiński number of the second kind, i.e., a number n such that for all k>=1, the numbers n·2^k+1 and n·2^k-1 ...

Brown numbers are pairs (m,n) of integers satisfying the condition of Brocard's problem, i.e., such that n!+1=m^2 where n! is the factorial and m^2 is a square number. Only ...