Search Results for ""

The study of how the intrinsic structure of graphs ensures certain types of properties (e.g., clique-formation and graph colorings) under appropriate conditions.

Given a subset K of a vector space X, a nonempty subset S subset K is called an extreme set of K if no point of S is an internal point of any line interval whose endpoints ...

If a function f(x) is continuous on a closed interval [a,b], then f(x) has both a maximum and a minimum on [a,b]. If f(x) has an extremum on an open interval (a,b), then the ...

An extremum is a maximum or minimum. An extremum may be local (a.k.a. a relative extremum; an extremum in a given region which is not the overall maximum or minimum) or ...

Each of the sacred unit fractions which the ancient Egyptians attributed to the six parts of the eye of the god Horus: 1/2, 1/4, 1/8, 1/16, 1/32, and 1/64. These fractions, ...

A subset F subset R of the real numbers is said to be an F_sigma set provided F is the countable union of closed sets. The name F_sigma comes from French: The F stands 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 ...

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, ...