Search results
Results from the WOW.Com Content Network
For example, the largest amount that cannot be obtained using only coins of 3 and 5 units is 7 units. The solution to this problem for a given set of coin denominations is called the Frobenius number of the set. The Frobenius number exists as long as the set of coin denominations is setwise coprime.
The postage stamp problem (also called the Frobenius Coin Problem and the Chicken McNugget Theorem [1]) is a mathematical riddle that asks what is the smallest postage value which cannot be placed on an envelope, if the latter can hold only a limited number of stamps, and these may only have certain specified face values.
Some solutions of a differential equation having a regular singular point with indicial roots = and .. In mathematics, the method of Frobenius, named after Ferdinand Georg Frobenius, is a way to find an infinite series solution for a linear second-order ordinary differential equation of the form ″ + ′ + = with ′ and ″.
The Frobenius theorem can be restated more economically in modern language. Frobenius' original version of the theorem was stated in terms of Pfaffian systems, which today can be translated into the language of differential forms. An alternative formulation, which is somewhat more intuitive, uses vector fields.
In mathematics, more specifically in abstract algebra, the Frobenius theorem, proved by Ferdinand Georg Frobenius in 1877, characterizes the finite-dimensional associative division algebras over the real numbers. According to the theorem, every such algebra is isomorphic to one of the following: R (the real numbers) C (the complex numbers) H ...
Frobenius reciprocity theorem in group representation theory describing the reciprocity relation between restricted and induced representations on a subgroup Perron–Frobenius theorem in matrix theory concerning the eigenvalues and eigenvectors of a matrix with positive real coefficients
Group theory was one of Frobenius' principal interests in the second half of his career. One of his first contributions was the proof of the Sylow theorems for abstract groups. Earlier proofs had been for permutation groups. His proof of the first Sylow theorem (on the existence of Sylow groups) is one of those frequently used today.
A more general version of Frobenius's theorem states that if C is a conjugacy class with h elements of a finite group G with g elements and n is a positive integer, then the number of elements k such that k n is in C is a multiple of the greatest common divisor (hn,g) (Hall 1959, theorem 9.1.1).