Search Results for ""

A sequence is an ordered set of mathematical objects. Sequences of object are most commonly denoted using braces. For example, the symbol {2n}_(n=1)^infty denotes the ...

Squarefree factorization is a first step in many factoring algorithms. It factors nonsquarefree polynomials in terms of squarefree factors that are relatively prime. It can ...

A subset of an algebraic variety which is itself a variety. Every variety is a subvariety of itself; other subvarieties are called proper subvarieties. A sphere of the ...

The tetranacci numbers are a generalization of the Fibonacci numbers defined by T_0=0, T_1=1, T_2=1, T_3=2, and the recurrence relation T_n=T_(n-1)+T_(n-2)+T_(n-3)+T_(n-4) ...

Trigonometric functions of npi/11 for n an integer cannot be expressed in terms of sums, products, and finite root extractions on real rational numbers because 11 is not a ...

Trigonometric functions of npi/13 for n an integer cannot be expressed in terms of sums, products, and finite root extractions on real rational numbers because 13 is not a ...

There exist points A^', B^', and C^' on segments BC, CA, and AB of a triangle, respectively, such that A^'C+CB^'=B^'A+AC^'=C^'B+BA^' (1) and the lines AA^', BB^', CC^' ...

A unique factorization domain, called UFD for short, is any integral domain in which every nonzero noninvertible element has a unique factorization, i.e., an essentially ...

Following Yates (1980), a prime p such that 1/p is a repeating decimal with decimal period shared with no other prime is called a unique prime. For example, 3, 11, 37, and ...

The upper irredundance number IR(G) of a graph G is the maximum size of an irredundant set of vertices in G. It is therefore equal to the size of a maximum irredundant set as ...