例句與造句

1. The basic idea of this algorithm is to compute x ^ { q ^ { n _ i } } \ bmod f starting from the smallest n _ 1, \ ldots, n _ k by repeated squaring or using the Frobenius automorphism, and then to take the correspondent gcd.
2. :( I may be misunderstanding your questions, so if you do not find my answers helpful please ask again . ) The Frobenius automorphism \ sigma on K = \ mathbb Z _ p is the identity ( there are no non-identity automorphisms of \ mathbb Z _ p ).
3. If the coefficients do not belong to "'F " "'p ", the " p "-th root of a polynomial with zero derivative is obtained by the same substitution on " x ", completed by applying the inverse of the Frobenius automorphism to the coefficients.
4. The Ree groups of type 2 G 2 are exceptionally hard to characterize . studied this problem, and was able to show that the structure of such a group is determined by a certain automorphism of a finite field of characteristic 3, and that if the square of this automorphism is the Frobenius automorphism then the group is the Ree group.
5. The order of the outer automorphism group is written as " d " ?" f " ?" g ", where " d " is the order of the group of " diagonal automorphisms ", " f " is the order of the ( cyclic ) group of " field automorphisms " ( generated by a Frobenius automorphism ), and " g " is the order of the group of " graph automorphisms " ( coming from automorphisms of the Dynkin diagram ).
6. It's difficult to find frobenius automorphism in a sentence. 用frobenius automorphism造句挺難的
更多例句：  上一頁(yè)