Another generalization of Menon’s identity

2017 ◽  
Vol 13 (09) ◽  
pp. 2373-2379 ◽  
Author(s):  
Xiao-Peng Zhao ◽  
Zhen-Fu Cao
Keyword(s):  
Euler’S Totient Function ◽  
Number Of Divisors ◽  
Dirichlet Characters

Let [Formula: see text] be the Euler’s totient function and [Formula: see text] be the number of divisors of [Formula: see text]. Menon’s beautiful identity states that [Formula: see text] Here we extend this identity to Dirichlet characters mod [Formula: see text].

scholarly journals A generalization of Menon’s identity with Dirichlet characters

2018 ◽  
Vol 14 (10) ◽  
pp. 2631-2639 ◽  
Author(s):  
Yan Li ◽  
Xiaoyu Hu ◽  
Daeyeoul Kim
Keyword(s):  
Number Theory ◽  
Positive Integer ◽  
Dirichlet Character ◽  
Greatest Common Divisor ◽  
Divisor Function ◽  
Euler’S Totient Function ◽  
Group Of Units ◽  
Dirichlet Characters ◽  
Indian Math ◽  
Sum Formula

The classical Menon’s identity [P. K. Menon, On the sum [Formula: see text], J. Indian Math. Soc.[Formula: see text]N.S.[Formula: see text] 29 (1965) 155–163] states that [Formula: see text] where for a positive integer [Formula: see text], [Formula: see text] is the group of units of the ring [Formula: see text], [Formula: see text] represents the greatest common divisor, [Formula: see text] is the Euler’s totient function and [Formula: see text] is the divisor function. In this paper, we generalize Menon’s identity with Dirichlet characters in the following way: [Formula: see text] where [Formula: see text] is a non-negative integer and [Formula: see text] is a Dirichlet character modulo [Formula: see text] whose conductor is [Formula: see text]. Our result can be viewed as an extension of Zhao and Cao’s result [Another generalization of Menon’s identity, Int. J. Number Theory 13(9) (2017) 2373–2379] to [Formula: see text]. It can also be viewed as an extension of Sury’s result [Some number-theoretic identities from group actions, Rend. Circ. Mat. Palermo 58 (2009) 99–108] to Dirichlet characters.

Prime splitting in abelian number fields and linear combinations of Dirichlet characters

2014 ◽  
Vol 10 (04) ◽  
pp. 885-903 ◽  
Author(s):  
Paul Pollack
Keyword(s):  
Number Field ◽  
Nonzero Element ◽  
Number Fields ◽  
Upper Bounds ◽  
Prime Ideals ◽  
Linear Combinations ◽  
Dirichlet Characters ◽  
Abelian Number Field ◽  
Splitting Type ◽  
A Finite Group

Let 𝕏 be a finite group of primitive Dirichlet characters. Let ξ = ∑χ∈𝕏 aχ χ be a nonzero element of the group ring ℤ[𝕏]. We investigate the smallest prime q that is coprime to the conductor of each χ ∈ 𝕏 and that satisfies ∑χ∈𝕏 aχ χ(q) ≠ 0. Our main result is a nontrivial upper bound on q valid for certain special forms ξ. From this, we deduce upper bounds on the smallest unramified prime with a given splitting type in an abelian number field. For example, let K/ℚ be an abelian number field of degree n and conductor f. Let g be a proper divisor of n. If there is any unramified rational prime q that splits into g distinct prime ideals in ØK, then the least such q satisfies [Formula: see text].

Non-random behavior in sums of modular symbols

2021 ◽  
pp. 1-25
Author(s):  
Alex Cowan
Keyword(s):  
Eisenstein Series ◽  
Spectral Decomposition ◽  
Fourier Coefficients ◽  
Dirichlet Character ◽  
Common Phenomenon ◽  
Modular Symbols ◽  
Dirichlet Characters ◽  
Random Behavior ◽  
The Common ◽  
Automorphic Functions

We give explicit expressions for the Fourier coefficients of Eisenstein series twisted by Dirichlet characters and modular symbols on [Formula: see text] in the case where [Formula: see text] is prime and equal to the conductor of the Dirichlet character. We obtain these expressions by computing the spectral decomposition of automorphic functions closely related to these Eisenstein series. As an application, we then evaluate certain sums of modular symbols in a way which parallels past work of Goldfeld, O’Sullivan, Petridis, and Risager. In one case we find less cancelation in this sum than would be predicted by the common phenomenon of “square root cancelation”, while in another case we find more cancelation.

scholarly journals On the Number of Witnesses in the Miller–Rabin Primality Test

Symmetry ◽  
2020 ◽  
Vol 12 (6) ◽  
pp. 890
Author(s):  
Shamil Talgatovich Ishmukhametov ◽  
Bulat Gazinurovich Mubarakov ◽  
Ramilya Gakilevna Rubtsova
Keyword(s):  
Positive Integer ◽  
Euler’S Totient Function ◽  
Number Of Factors ◽  
Primality Test ◽  
Average Probability ◽  
Test Errors ◽  
The Difference

In this paper, we investigate the popular Miller–Rabin primality test and study its effectiveness. The ability of the test to determine prime integers is based on the difference of the number of primality witnesses for composite and prime integers. Let W ( n ) denote the set of all primality witnesses for odd n. By Rabin’s theorem, if n is prime, then each positive integer a < n is a primality witness for n. For composite n, the power of W ( n ) is less than or equal to φ ( n ) / 4 where φ ( n ) is Euler’s Totient function. We derive new exact formulas for the power of W ( n ) depending on the number of factors of tested integers. In addition, we study the average probability of errors in the Miller–Rabin test and show that it decreases when the length of tested integers increases. This allows us to reduce estimations for the probability of the Miller–Rabin test errors and increase its efficiency.

scholarly journals THE AVERAGE NUMBER OF SUBGROUPS OF ELLIPTIC CURVES OVER FINITE FIELDS

2020 ◽  
Vol 71 (3) ◽  
pp. 781-822
Author(s):  
Corentin Perret-Gentil
Keyword(s):  
Finite Field ◽  
Elliptic Curves ◽  
Finite Fields ◽  
Short Interval ◽  
Divisor Function ◽  
Finite Abelian Groups ◽  
Cyclic Subgroups ◽  
Number Of Divisors ◽  
Curves Over Finite Fields ◽  
Euler Products

Abstract By adapting the technique of David, Koukoulopoulos and Smith for computing sums of Euler products, and using their interpretation of results of Schoof à la Gekeler, we determine the average number of subgroups (or cyclic subgroups) of an elliptic curve over a fixed finite field of prime size. This is in line with previous works computing the average number of (cyclic) subgroups of finite abelian groups of rank at most $2$. A required input is a good estimate for the divisor function in both short interval and arithmetic progressions, that we obtain by combining ideas of Ivić–Zhai and Blomer. With the same tools, an asymptotic for the average of the number of divisors of the number of rational points could also be given.

Sign in / Sign up

Export Citation Format

Share Document