As the number of permutable steps increases, the conflicting constraints are reduced.

In other words, some steps in life are permutable, others are not.

Clearly, every permutable subgroup of a finite group is semipermutable.

It is also a permutable prime with thirty-seven.

It is conjectured that there are no non-repunit permutable primes other than those listed above.

Therefore the base 2 permutable primes are the Mersenne primes.

One-digit primes, meaning any prime below the radix, are always trivially permutable.

The theory of permutable functions.

Yebol estimated it will cover, by early Q1 2010, all existing permutable search terms in its intelligent search results format.

One movement has staves printed in red and green, straddling huge sheets of cream paper in permutable networks.

In base 2, only repunits can be permutable primes, because any 0 permuted to the one's place results in an even number.

Every 2-subnormal subgroup is a conjugate permutable subgroup.

There is a considerable literature concerning permutable matrices, see, for example, Turnbull an Aitken (4).

A conjugate permutable subgroup is one that commutes with all its conjugate subgroups.

Any repunit prime is a permutable prime with the above definition, but some definitions require at least two distinct digits.

All non-palindromic permutable primes are emirps.

A finite p-group is a modular group if and only if every subgroup is permutable, by .

Every quasinormal subgroup, and, more generally, every conjugate permutable subgroup, of a finite group is subnormal.

Suppose in our job shop problem, a fixed fraction, P, of the steps in the construction of each of the O objects were jointly permutable.

Caldwell, The Prime Glossary: permutable prime at The Prime Pages.

A permutable prime is a prime number which, in a given base, can have its digits' positions switched through any permutation and still be a prime number.

The focus of the dissertation was very close to Wielandt's interests at the time, whose 1951 work shows that the product of pairwise permutable nilpotent groups is solvable.

The prime repunits are a trivial subset of the permutable primes, i.e., primes that remain prime after any permutation of their digits.

H. E. Richert, who is supposed to be the first to study these primes, called them permutable primes, but later they were also called absolute primes.

J. Tůma and F. Wehrung, Simultaneous representations of semilattices by lattices with permutable congruences, Internat.