首页> 外文期刊>Journal of Mathematics Research >An Extension of the Euler Phi-function to Sets of Integers Relatively Prime to 30
【24h】

An Extension of the Euler Phi-function to Sets of Integers Relatively Prime to 30

机译:将Euler Phi函数扩展为相对素数为30的整数集

获取原文
           

摘要

Let $n geq 1$ be an integer and let $S= {1,7,11,13,17,19,23,29},$ the set of integers which are both less than and relatively prime to $30.$ Define $phi_3(n)$ to be the number of integers $x, ; 0 leq x leq n-1,$ for which $gcd(30n, 30x+i) = 1$ for all $i in S.$ In this note we show that? $phi_3$ is multiplicative, that is, if $gcd(m, n)=1,$ then $phi_3(mn)=phi_3(m)phi_3(n).$ We make a conjecture about primes generated by S.
机译:令$ n geq 1 $为整数,令$ S = {1,7,11,13,17,19,23,29 },$小于且相对于$ 30为素数的整数集合。$定义$ phi_3(n)$为整数$ x,; 0 leq x leq n-1,$,其中$ gcd(30n,30x + i)= 1 $对于所有$ i in S. $在此注中,我们表明? $ phi_3 $是可乘的,也就是说,如果$ gcd(m,n)= 1,$,则$ phi_3(mn)= phi_3(m) phi_3(n)。$我们对生成的素数进行一个猜想由S.

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号