His classmates were labouring with elementary algebra.

他的同学们正在绞尽脑汁地演算初等代数题。

Let G be an infinite group. If G has a normal elementary abelian subgroup, then G is irrecognizable.

设G是无限群,若G存在正规初等交换子群,则G是不可分辨的.

Based on some basic theorems in theory of numbers this program takes advantage of probabilistic algorithm to test a large number for primality.

基于初等数中的一些基本定理,本程序利用概率算法,快速判定一个大数是否为素数。

His classmates were labouring with elementary algebra.

他的同学们正在绞尽脑汁地演算代数题。

Let G be an infinite group. If G has a normal elementary abelian subgroup, then G is irrecognizable.

设G是无限群,若G存在正交换子群,则G是不可分辨的.

Based on some basic theorems in theory of numbers this program takes advantage of probabilistic algorithm to test a large number for primality.

基于数中的一些基本定理,本程序利用概率算法,判定一个大数是否为素数。

His classmates were labouring with elementary algebra.

他的正在绞尽脑汁地演算初等代数题。

Let G be an infinite group. If G has a normal elementary abelian subgroup, then G is irrecognizable.

设G是无限群,若G存在正规初等交换子群,则G是不可分辨的.

Based on some basic theorems in theory of numbers this program takes advantage of probabilistic algorithm to test a large number for primality.

基于初等数中的一些基本定理,本程序利用概率算法,快速判定一个大数是否为素数。

His classmates were labouring with elementary algebra.

他的同学们正在绞尽脑汁地演算初等代数题。

Let G be an infinite group. If G has a normal elementary abelian subgroup, then G is irrecognizable.

设G是无限,G在正规初等交换子,则G是不可分辨的.

Based on some basic theorems in theory of numbers this program takes advantage of probabilistic algorithm to test a large number for primality.

基于初等数中的些基本定理,本程序利用概率算法,快速判定数是否为素数。

His classmates were labouring with elementary algebra.

他的同学们正在绞尽脑汁地演算初等代数题。

Let G be an infinite group. If G has a normal elementary abelian subgroup, then G is irrecognizable.

设G是无限群,若G存在正规初等交换子群,则G是不可分辨的.

Based on some basic theorems in theory of numbers this program takes advantage of probabilistic algorithm to test a large number for primality.

基于初等数中的一些基本定理,本程序利用概率算法,快速判定一个大数是否为素数。

His classmates were labouring with elementary algebra.

他同学们正在绞尽脑汁地演算初等代数题。

Let G be an infinite group. If G has a normal elementary abelian subgroup, then G is irrecognizable.

设G是无限群,若G存在正规初等交换子群,则G是不可分.

Based on some basic theorems in theory of numbers this program takes advantage of probabilistic algorithm to test a large number for primality.

于初等数中一些理,程序利用概率算法,快速判一个大数是否为素数。

His classmates were labouring with elementary algebra.

他同学们正在绞尽脑汁地演算初代题。

Let G be an infinite group. If G has a normal elementary abelian subgroup, then G is irrecognizable.

设G是无限群,若G存在正规初交换子群,则G是不可分辨.

Based on some basic theorems in theory of numbers this program takes advantage of probabilistic algorithm to test a large number for primality.

基于初一些基本定理,本程序利用概率算法,快速判定一个大是否为素。

His classmates were labouring with elementary algebra.

他的同学们正在绞尽脑汁地演算初等代数题。

Let G be an infinite group. If G has a normal elementary abelian subgroup, then G is irrecognizable.

设G是无限群,若G存在正规初等交换子群,则G是不可分辨的.

Based on some basic theorems in theory of numbers this program takes advantage of probabilistic algorithm to test a large number for primality.

基于初等数中的一些基本定理,本程序利用概率算法,快速判定一个大数是否为素数。

His classmates were labouring with elementary algebra.

他的正在绞尽脑汁地演算初等代数题。

Let G be an infinite group. If G has a normal elementary abelian subgroup, then G is irrecognizable.

设G是无限群,若G存在正规初等交换子群,则G是不可分辨的.

Based on some basic theorems in theory of numbers this program takes advantage of probabilistic algorithm to test a large number for primality.

基于初等数中的一些基本定理,本程序利用概率算法,快速判定一个大数是否为素数。