首页 | 本学科首页   官方微博 | 高级检索  
     检索      

整数的模n同因分类
引用本文:魏国祥,徐志军.整数的模n同因分类[J].四川职业技术学院学报,2014(6):143-145.
作者姓名:魏国祥  徐志军
作者单位:四川职业技术学院,四川遂宁629000
基金项目:四川省教育厅自然科学重点项目(编号:11ZA263)研究成果之一.
摘    要:在整数集Z上定义了模n同因关系,得到整数的模n同因分类Z(n).证明了:Z(n)的元素个数是T(n)(其中T(n)是n的正因数个数);Z(n)关予乘法a]b]=ab]作成以0]为零元,1]为单位元的交换半群,且除1]外其余的元都没有逆元;在不等式T(n)+φ(n)≤n+1中,当且仅当n=1.4,p(p为素数)时等号成立,其中φ(n)是欧拉函数.

关 键 词:整数  模n同因分类  正因数个数  交换半群  欧拉函数

The Mod N Equi-divisor Classification of Integers
WEI Guoxiang,XU Zhijun.The Mod N Equi-divisor Classification of Integers[J].Journal of Sichuan Vocational and Technical College,2014(6):143-145.
Authors:WEI Guoxiang  XU Zhijun
Institution:(Sichuan Vocational and Technical College, Suining Sichuan629000)
Abstract:An equivalent divisor relation based on the modulus of integer n (mod n) is defined in the integer set Z. Amod n equi-divisor classification Z(n) of the integer n is therefore obtained. It is proved that the number of elements in Z(n) is T (n), where T(n) is the number of positive divisors of n. Based on the multiplication a] b] = ab], Z(n) forms a commutative semi-group, in which 0] is the zero element, 1] is the unit element and the only element having its inverse element. For the inequalityT (n)+φ (n) ≤n+1, the equality holds true if and Only if n=1, 4p(p is a prime number and φ(n) is an Euler function).
Keywords:Integers  mod n equi-divisor classification  the number of positive divisors  commutative semi-group  Euler function
本文献已被 维普 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号