Search Results for ""
4111 - 4120 of 13131 for eulerstotienttheorem.htmlSearch Results

A folding function is a function that maps the integers Z={...,-3,-2,-1,0,1,2,3,...} onto the nonnegative integers Z^*={0,1,2,3,...}. This type of function arises naturally ...
Let M^n be an n-manifold and let F={F_alpha} denote a partition of M^n into disjoint pathwise-connected subsets. Then F is called a foliation of M^n of codimension c (with ...
Let M^n be an n-manifold and let F={F_alpha} denote a partition of M into disjoint pathwise-connected subsets. Then if F is a foliation of M, each F_alpha is called a leaf ...
The term folium means "leaf" in Latin and refers and refers to a plane curve having "leaf-shaped" rounded lobes. There are a number of different sorts of folia, including ...
A plane curve proposed by Descartes to challenge Fermat's extremum-finding techniques. In parametric form, x = (3at)/(1+t^3) (1) y = (3at^2)/(1+t^3). (2) The curve has a ...
The Folkman graph is a semisymmetric graph that has the minimum possible number of nodes (20) (Skiena 1990, p. 186). It is implemented in the Wolfram Language as ...
There are three theorems related to pedal circles that go under the collective title of the Fontené theorems. The first Fontené theorem lets DeltaABC be a triangle and P an ...
If a proposition P is true for all B, this is written P forall B. forall is one of the two so-called quantifiers, and translates the universal quantifier forall . The Wolfram ...
An expression occurring in existential sentences. "For some x" is the same as " exists x." Unlike in everyday language, it is does not necessarily refer to a plurality of ...
A graph is a forbidden (vertex-)induced subgraph if its presence as a vertex-induced subgraph of a given graph means it is not a member of some family of graphs. For example, ...

...