Search Results for ""

An algorithm for computing an Egyptian fraction.

For n a positive integer, expressions of the form sin(nx), cos(nx), and tan(nx) can be expressed in terms of sinx and cosx only using the Euler formula and binomial theorem. ...

An Egyptian fraction is a sum of positive (usually) distinct unit fractions. The famous Rhind papyrus, dated to around 1650 BC contains a table of representations of 2/n as ...

A cryptarithmetic in which digits are used to represent other digits.

Let there be n>=2 integers 0<a_1<...<a_n with GCD(a_1,a_2,...,a_n)=1. The values a_i represent the denominations of n different coins, where these denominations have greatest ...

The group theoretical term for what is known to physicists, by way of its connection with matrix traces, as the trace. The powerful group orthogonality theorem gives a number ...

The word "base" in mathematics is used to refer to a particular mathematical object that is used as a building block. The most common uses are the related concepts of the ...

A periodic continued fraction is a continued fraction (generally a regular continued fraction) whose terms eventually repeat from some point onwards. The minimal number of ...

Roman numerals are a system of numerical notations used by the Romans. They are an additive (and subtractive) system in which letters are used to denote certain "base" ...

Let union represent "or", intersection represent "and", and ^' represent "not." Then, for two logical units E and F, (E union F)^'=E^' intersection F^' (E intersection ...