分配格和素域生成的半环簇

Let V be the variety generated by two-element distributive lattice B2 and k prime fields Fp1,...,Fpk. That is to say that V = HSP{B2, Fp1,...,Fpk}. It is proved that the variety V is finitely based. Also, the two-element distributive lattice B2 and prime fields Fp1,..., Fpk are, up to isomorphism, the only subdirectly irreducible semirings in V. Some known results are extended and enriched.     

具有弱$s$-置换嵌入子群的有限群

Let P be a Sylow p-subgroup of a group G with the smallest generator number d,where p is a prime.Denote by M_d(P) = {P_1,P_(2,...,)P_d} a set of maximal subgroups of P such that φ(P) = ∩_(n=1)~dP_n.In this paper,we investigate the structure of a finite group G under the assumption that the maximal subgroups in M_d(P) are weakly s-permutably embedded in G,some interesting results are obtained which generalize some recent results.Finally,we give some further results in terms of weakly s-permutably embedded subgroups.     

四个素数的平方及2的若干次幂和丢番图逼近

Under certain condition, the inequality |λ_1p_1~2 λ_2p_2~2 λ_3p_3~2 λ_4p_4~2 μ_12~(x1) … μ_s2~(xs) γ|＜ηhas infinitely many solutions in primes p_1,p_2,p_3,p_4 and positive integers x_1,…,x_s.     

关于Pell方程组X~2-3y~2=1与y~2-Dz~2=1的解

设D=2p_1…P_s(1≤s≤4),P_1…,P_s是互异的奇素数.证明了:Pell方程组x~2-3y~2=1,y~2-Dz~2=1除开D=2×7,2×3×5×7×13外,仅有平凡解(x,y,z)=(±2,±1,0).     

再谈Eisenstein判别法的推广

文 [1 ]对Ｅｉｓｅｎｓｔｅｉｎ判别法作出了有益的推广 ,并给出了如下定理 :设 ｆ(ｘ) =ａｎｘｎ ａｎ -1ｘｎ -1 … ａ1ｘ ａ0 是一个整系数多项式 ,ｋ为某一自然数 ,且 1≤ｋ≤ｎ ,若存在素数 ｐ ,使得 :1 ) ｐ ａｎ;2 ) ｐ |ａｋ -1,ｐ |ａｋ -2 ,… ,ｐ|ａ0 ;3) ｐ2 ａ0 ,那么 ｆ(ｘ)在有理数域上有一个次数不小于ｋ的不可约因式 .该定理有效地解决了一些多项式在有理数域上的可约性判别 .但有较大的局限性 .本文将这一结论作进一步推广 .命题 1　设 ｆ(ｘ) =ａｎｘｎ ａｎ -1ｘｎ -1 … ａ1ｘ ａ0 是一个整系数多项式 ,ｍ <ｋ≤…     

素数阶群理论的量词消去及复杂性

本文中我们将研究语言,上素数阶群理论Ｔ的量词消去及相应的复杂性．我们证明理论Ｔ有量词消去性质,并利用该性质给出理论Ｔ判定问题的一个复杂性上界．     

Lukasiewiczlz p＋1值逻辑系统中VDF问题的解决

为在经典逻辑学中建立Fuzzy分离规则的推理模式,由赋值决定公式问题(简称VDF问题)已经提出,并已于二值命题逻辑以及三值Lukasiewicz命题逻辑中得到了解决,但当w＞3时,VDF问题相当复杂且尚未解决.本文完满地解决了当w=p+1(p为素数)时,Lukasiewicz逻辑系统Lp+1中的VDF问题.     

利用微机计算古典数论问题

判断一个大的整数是否素数，如果它不是素数的话又如何将它分解为若干个因数的乘积是古典数论的一个重要问题．由于计算机科学和密码学的发展，上述的古典问题又焕发出了新的光亮．因为有一种很简单的密码是用素数模乘法变换来构造的．如果你不知道这个素数，你就无法解开这个密码．有人甚至将这个密码的钥匙半公开：一般是把两个素数乘起来产生一个合数．因为这个数很大，如果你不会分解它你是无法解开这个密码的．而制造这个密码的人就需要记住合数分解的方法，密码随时可以解开。     

Gauss Sum of Index Four

Let p be a prime number, q=p^f and m|q-1. For a multiplicative character x of Fq with order m, the Gauss sum G(x) over Fq is defined by     

On the Characterizability of the Automorphism Groups of Sporadic Simple Groups by Their Element Orders

For G a finite group, π _e (G) denotes the set of orders of elements in G. If Ω is a subset of the set of natural numbers, h(Ω) stands for the number of isomorphism classes of finite groups with the same set Ω of element orders. We say that G is k-distinguishable if h(π _e (G)) = k < ∞, otherwise G is called non-distinguishable. Usually, a 1-distinguishable group is called a characterizable group. It is shown that if M is a sporadic simple group different from M ₁₂, M ₂₂, J ₂, He, Suz, M ^c L and O′N, then Aut(M) is characterizable by its element orders. It is also proved that if M is isomorphic to M ₁₂, M ₂₂, He, Suz or O′N, then h(π _e (Aut(M))) ∈¸ {1,∞}.