Search Results for ""

A binary operation f(x,y) is an operation that applies to two quantities or expressions x and y. A binary operation on a nonempty set A is a map f:A×A->A such that 1. f is ...

The determinant of a binary quadratic form Au^2+2Buv+Cv^2 is defined as D=AC-B^2. It is equal to 1/4 of the corresponding binary quadratic form discriminant. Unfortunately, ...

The discriminant of a binary quadratic form au^2+buv+cv^2 is defined by d=4ac-b^2. It is equal to four times the corresponding binary quadratic form determinant. ...

Given a set of objects S, a binary relation is a subset of the Cartesian product S tensor S.

An algorithm for computing an Egyptian fraction (Stewart 1992).

The two recursive sequences U_n = mU_(n-1)+U_(n-2) (1) V_n = mV_(n-1)+V_(n-2) (2) with U_0=0, U_1=1 and V_0=2, V_1=m, can be solved for the individual U_n and V_n. They are ...

If M^3 is a closed oriented connected 3-manifold such that every simple closed curve in M lies interior to a ball in M, then M is homeomorphic with the hypersphere, S^3.

A polynomial with 2 terms.

There are several closely related results that are variously known as the binomial theorem depending on the source. Even more confusingly a number of these (and other) ...

If two complementary Plücker characteristics are equal, then each characteristic is equal to its complement except in four cases where the sum of order and class is 9.