Search Results for ""

Fractran is an algorithm applied to a given list f_1, f_2, ..., f_k of fractions. Given a starting integer N, the FRACTRAN algorithm proceeds by repeatedly multiplying the ...

Let f(z) = z+a_1+a_2z^(-1)+a_3z^(-2)+... (1) = zsum_(n=0)^(infty)a_nz^(-n) (2) = zg(1/z) (3) be a Laurent polynomial with a_0=1. Then the Faber polynomial P_m(f) in f(z) of ...

In the course of searching for continued fraction identities, Raayoni (2021) and Elimelech et al. (2023) noticed that while the numerator and denominator of continued ...

A factorion is an integer which is equal to the sum of factorials of its digits. There are exactly four such numbers: 1 = 1! (1) 2 = 2! (2) 145 = 1!+4!+5! (3) 40585 = ...

The determination of a set of factors (divisors) of a given integer ("prime factorization"), polynomial ("polynomial factorization"), etc., which, when multiplied together, ...

In a given acute triangle DeltaABC, find the inscribed triangle whose perimeter is as small as possible. The answer is the orthic triangle of DeltaABC. The problem was ...

A variation of chess involving a change in the form of the board, the rules of play, or the pieces used. For example, the normal rules of chess can be used but with a ...

A functor is said to be faithful if it is injective on maps. This does not necessarily imply injectivity on objects. For example, the forgetful functor from the category of ...

A module M over a unit ring R is called faithful if for all distinct elements a, b of R, there exists x in M such that ax!=bx. In other words, the multiplications by a and by ...

A module M over a unit ring R is called faithfully flat if the tensor product functor - tensor _RM is exact and faithful. A faithfully flat module is always flat and ...