Search Results for ""

The tangent function is defined by tanx=(sinx)/(cosx), (1) where sinx is the sine function and cosx is the cosine function. The notation tgx is sometimes also used ...

The AC method is an algorithm for factoring quadratic polynomials of the form p(x)=Ax^2+Bx+C with integer coefficients. As its name suggests, the crux of the algorithm is to ...

If r is a root of the polynomial equation x^n+a_(n-1)x^(n-1)+...+a_1x+a_0=0, where the a_is are integers and r satisfies no similar equation of degree <n, then r is called an ...

Let X be an alphabet (i.e., a finite and nonempty set), and call its member letters. A word on X is a finite sequence of letters a_1...a_n, where a_1,...,a_n in X. Denote the ...

A number n with prime factorization n=product_(i=1)^rp_i^(a_i) is called k-almost prime if it has a sum of exponents sum_(i=1)^(r)a_i=k, i.e., when the prime factor ...

The conjecture that the number of alternating sign matrices "bordered" by +1s A_n is explicitly given by the formula A_n=product_(j=0)^(n-1)((3j+1)!)/((n+j)!). This ...

The Andrews-Gordon identity (Andrews 1974) is the analytic counterpart of Gordon's combinatorial generalization of the Rogers-Ramanujan identities (Gordon 1961). It has a ...

The Andrews-Schur identity states sum_(k=0)^nq^(k^2+ak)[2n-k+a; k]_q =sum_(k=-infty)^inftyq^(10k^2+(4a-1)k)[2n+2a+2; n-5k]_q([10k+2a+2]_q)/([2n+2a+2]_q) (1) where [n; m]_q is ...

Two points which are collinear with respect to a similitude center but are not homologous points. Four interesting theorems from Johnson (1929) follow. 1. Two pairs of ...

Given a commutative unit ring R and a filtration F:... subset= I_2 subset= I_1 subset= I_0=R (1) of ideals of R, the associated graded ring of R with respect to F is the ...