Iterating the Sum of Möbius Divisor Function and Euler Totient Function

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Iterating the Sum-of-Divisors Function

1991 Mathematics Subject Classi cation: 11A25, 11Y70 Let 0(n) = n and m(n) = ( m 1(n)), where m 1 and is the sum-of-divisors function. We say that n is (m; k)perfect if m(n) = kn. We have tabulated all (2; k)-perfect numbers up to 109 and all (3; k)and (4; k)-perfect numbers up to 2 108. These tables have suggested several conjectures, some of which we prove here. We ask in particular: For any ...

متن کامل

compactifications and function spaces on weighted semigruops

chapter one is devoted to a moderate discussion on preliminaries, according to our requirements. chapter two which is based on our work in (24) is devoted introducting weighted semigroups (s, w), and studying some famous function spaces on them, especially the relations between go (s, w) and other function speces are invesigated. in fact this chapter is a complement to (32). one of the main fea...

15 صفحه اول

‏‎interpersonal function of language in subtitling

‏‎translation as a comunicative process is always said to be associated with various aspects of meaning loss or gain. subtitling as a mode of translating, due to special discoursal and textual conditions imposed upon it, is believed to be an obvious case of this loss or gain. presenting the spoken sound track of a film in writing and synchronizing the perception of this text by the viewers with...

15 صفحه اول

On the Ratio of the Sum of Divisors and Euler’s Totient Function I

We prove that the only solutions to the equation σ(n) = 2 · φ(n) with at most three distinct prime factors are 3, 35 and 1045. Moreover there exist at most a finite number of solutions to σ(n) = 2 ·φ(n) with Ω(n) ≤ k, and there are at most 22 k+k − k squarefree solutions to φ(n) ∣∣σ(n) if ω(n) = k. Lastly the number of solutions to φ(n) ∣∣σ(n) as x→∞ is of order O (x exp (−1 2log x)).

متن کامل

On Square Values of the Product of the Euler Totient and Sum of Divisors Functions

If n is a positive integer such that φ(n)σ(n) = m for some positive integer m, then m 6 n. We put m = n − a and we study the positive integers a arising in this way.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Mathematics

سال: 2019

ISSN: 2227-7390

DOI: 10.3390/math7111083