期刊文献+

方程Z(SL(n))=φe(n)(e=3,4,6)的正整数解 被引量:1

The Positive Integral Solutions for the Equation Z(SL(n))=φ;(n)(e=3,4,6)
下载PDF
导出
摘要 设n,e>1均为正整数,利用初等的方法和技巧,以及伪Smarandache函数Z(n).Smarandache LCM函数SL(n)和广义Euler函数φ_(e)(n)的基本性质,讨论数论函数方程Z(SL(n))=φ_(e)(n)(e=3,4,6)的可解性,并给出其全部的正整数解. Let n,e>1 be positive integers. By using elementary methods and techniques, in addition to the properties for the pseudo-Smarandache function, the Smarandache LCM function and the generalized Euler function, this paper discusses the positive integer solutions for the equation Z(SL(n))=φ_(e)(n) when e∈{3,4,6}, and determines its all positive integer solutions.
作者 杜珊 廖群英 王慧莉 DU Shan;LIAO Qunying;WANG Huili(School of Mathematical Sciences,Sichuan Normal University,Chengdu 610066,Sichuan)
出处 《四川师范大学学报(自然科学版)》 CAS 2022年第1期21-26,共6页 Journal of Sichuan Normal University(Natural Science)
基金 国家自然科学基金(12071321)。
关键词 广义Euler函数 伪SMARANDACHE函数 Smarandache LCM函数 generalized Euler function pseudo-Smarandache function Smarandache LCM function
  • 相关文献

参考文献14

二级参考文献71

  • 1徐哲峰.Smarandache函数的值分布性质[J].数学学报(中文版),2006,49(5):1009-1012. 被引量:88
  • 2Frankel Y,Mackenzie P D,Yung M.Robust Efficient Distributed RSA-Key Generation[C] ∥ Proc of the 30th Annual ACM Symp on Theory of Computing,1998:663-672.
  • 3Lory P.Reducing the Complexity in the Distributed Computation of Private RSA Keys[C] ∥ Proc of Australasian Conf on Information Security and Privacy,2009:250-263.
  • 4Miyazaki S,Sakurai K,Yung M.On Threshold RSA-Signing with No Dealer[C] ∥Proc of the 2nd Int'l Conf on Information Security and Cryptology,1999:197-207.
  • 5Catalano D,Gennaro R,Halevi S.Computing Inverses over a Shared Secret Modulus[C] ∥ Proc of EUROCRYPT'00,2000:190-206.
  • 6Cachin C.Rational Protocols[C] ∥Proc of iNetSec 2009-Workshop on Open Research Problems in Network Security,2009:93-94.
  • 7Halpern J Y.Computer Science and Game Theory:A Brief Survey[EB/OL].[2010-02-05].http:∥www.cs.cornell.edu/home/ halpern/papers/csgt.pdf.
  • 8Halpern J Y,Teague V.Rational Secret Sharing and Multiparty Computation[C] ∥ Proc of the 36th ACM Symp on Theory of Computing,2004:623-632.
  • 9Shoham Y,Tennenholtz M.Non-Cooperative Computation:Boolean Functions with Correctness and Exclusivity[J].Journal of Theoretical Computer Science,2005,343(2):97-113.
  • 10Osborne M J,Rubinstein A.A Course in Game Theory[M].Massachusetts:The MIT Press,2006.

共引文献162

同被引文献13

引证文献1

二级引证文献2

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部