mobius function
Recently Published Documents


TOTAL DOCUMENTS

226
(FIVE YEARS 44)

H-INDEX

14
(FIVE YEARS 1)

2022 ◽  
pp. 33-105
Author(s):  
Eugene Spiegel ◽  
Christopher J. O’Donnell

2022 ◽  
Vol 355 ◽  
pp. 02003
Author(s):  
Yuyang Zhu ◽  
Jing Huang ◽  
Lili Wang ◽  
Ming Li

This paper generalizes Wolstenholme theorem on two aspects. The first generalization is a parameterized form: let p > k + 2, k ≥ 1, ∀t ∈ ℤ, then ${{(pt + p - 1)!} \over {(pt)!}}\mathop \sum \limits_{m = 0}^{k - 1} {( - 1)^m}\mathop \sum \limits_{1 \le {i_l} < \cdots < {i_{k - m}} \le p - 1} {{{p^{k - (m + 1)}}} \over {\mathop \prod \limits_{l = 1}^{k - m} (pt + {i_l})}} \equiv 0{\left( {\bmod {p^{k + 1}}} \right)^.}$ The second generalization is on composite number module: Let 1overa be the x in congruent equation ax ≡ 1(mod m)(1 ≤ x < m), if m ≥ 5, then $$\matrix{ {\sum\limits_{\scriptstyle (k,m) = 1, \hfill \atop \scriptstyle 1 \le j \le m \hfill} {{{\left( {{1 \over k}} \right)}^2}} } \hfill & \equiv \hfill & {{m \over 6}[2m\varphi (m) + \prod\limits_{p|m} {(1 - p)]{{(\bmod m)}^{\;;}}} } \hfill \cr {\sum\limits_{\scriptstyle (k,m) = 1, \hfill \atop \scriptstyle 1 \le j \le m \hfill} {{{\left( {{1 \over k}} \right)}^3}} } \hfill & \equiv \hfill & {{{{m^2}} \over 4}[m\varphi (m) + \prod\limits_{p|m} {(1 - p)](\bmod m){\;^;}} } \hfill \cr {\sum\limits_{\scriptstyle (k,m) = 1, \hfill \atop \scriptstyle 1 \le j \le m \hfill} {{{\left( {{1 \over k}} \right)}^4}} } \hfill & \equiv \hfill & {{m \over {30}}[6{m^3}\varphi (m) + 10{m^2}\prod\limits_{p|m} {(1 - p) - \prod\limits_{p|m} {(1 - {p^3})](\bmod m){\;^;}} } } \hfill \cr {\sum\limits_{\scriptstyle (k,m) = 1, \hfill \atop \scriptstyle 1 \le j \le m \hfill} {{{\left( {{1 \over k}} \right)}^r}} } \hfill & \equiv \hfill & {{m^r}\sum\limits_{d|m} {\mu (d){{\left( {{m \over d}} \right)}^{ - r}}\sum\limits_{k = 1}^{{m \over d}} {{k^r}(\bmod m){\;^.}} } } \hfill \cr } $$ Where φ(x) is Euler function , μ(x) is Möbius function.


2021 ◽  
Vol 2 (1) ◽  
pp. 36-42
Author(s):  
Václav Zvoníček

The aim of this paper is to generate and examine a pseudorandom sequence over a finite field using the Möbius function. In the main part of the paper, after generating a number of sequences using the Möbius function, we examine the sequences’ pseudorandomness using autocorrelation and prove that the second half of any sequence in $\mathbb{F}_{3^n}$ is the same as the first, but for the sign of the terms. I reach the conclusion, that it is preferable to generate sequences in fields of the form $\mathbb{F}_{3^n}$, thereby obtaining a sequence of the numbers $-1$,$0$,$1$, each of which appear in the same amounts. There is a variety of applications of the discussed pseudorandom generator and other generators such as cryptography or randomized algorithms.


Author(s):  
Ali Shehu ◽  
Jetmira Uka

We demonstrate a new quantitative method to the sieve of Eratosthenes, which is an alternative to the sieve of Legendre. In this method, every element of a given set is sifted out once only, and therefore, this method is free of the Mobius function and of the consequential parity barrier. Using this method, we prove that every sufficiently large even number is the sum of two primes, and that every even number is the difference of two primes in infinitely many ways.


Author(s):  
Ali Shehu ◽  
Jetmira Uka

We demonstrate a new quantitative method to the sieve of Eratosthenes, which is an alternative to the sieve of Legendre. In this method, every element of a given set is sifted out once only, and therefore, this method is free of the Mobius function and of the consequential parity barrier. Using this method, we prove that every sufficiently large even number is the sum of two primes, and that every even number is the difference of two primes in infinitely many ways.


Author(s):  
Ali Shehu ◽  
Jetmira Uka

We demonstrate a new quantitative method to the sieve of Eratosthenes, which is an alternative to the sieve of Legendre. In this method, every element of a given set is sifted out once only, and therefore, this method is free of the Mobius function and of the consequential parity barrier. Using this method, we prove that every sufficiently large even number is the sum of two primes, and that every even number is the difference of two primes in infinitely many ways.


Author(s):  
Darrell Cox ◽  
Sourangshu Ghosh ◽  
Eldar Sultanow

The Mobius function is commonly used to define Euler's totient function and the Mangoldt function. Similarly, the summatory Mobius function (the Mertens function) can be used to define the summatory totient function and the summatory Mangoldt function (the second Chebyshev function).


Author(s):  
Darrell Cox ◽  
Sourangshu Ghosh ◽  
Eldar Sultanow

The Mobius function is commonly used to define Euler&rsquo;s totient function and the Mangoldt function. Similarly, the summatory Mobius function (the Mertens function) is used to define the summatory totient function and the summatory Mangoldt function (the second Chebyshev function). Analogues of the product formula for the totient function are introduced. An analogue of the summatory totient function with many additive properties is introduced.


Author(s):  
Martino Borello ◽  
Francesca Dalla Volta ◽  
Giovanni Zini

Let [Formula: see text] be the simple group [Formula: see text], where [Formula: see text] is a prime number. For any subgroup [Formula: see text] of [Formula: see text], we compute the Möbius function [Formula: see text] of [Formula: see text] in the subgroup lattice of [Formula: see text]. To this aim, we describe the intersections of maximal subgroups of [Formula: see text]. We point out some connections of the Möbius function with other combinatorial objects, and, in this context, we compute the reduced Euler characteristic of the order complex of the subposet of [Formula: see text]-subgroups of [Formula: see text], for any prime [Formula: see text] and any prime power [Formula: see text].


2021 ◽  
Author(s):  
Darrell Cox ◽  
Eldar Sultanow ◽  
Sourangshu Ghosh

The Mertens function is the summatory Mobius function but the Mertens function can be generated recursively without using this definition. This recursive definition is the basis of autocorrelations that can be done on sequences of Mertens function values. Fourier transforms of the autocorrelations result in the energy spectral density. A likely upper bound of the absolute value of the Mertens function is determined.


Sign in / Sign up

Export Citation Format

Share Document