Hostname: page-component-7c8c6479df-nwzlb Total loading time: 0 Render date: 2024-03-28T11:48:23.229Z Has data issue: false hasContentIssue false

On the exponents modulo 3 in the standard factorisation of n!

Published online by Cambridge University Press:  17 April 2009

Wei Liu
Affiliation:
Department of Mathematics, Nanjing Normal University, Nanjing, 210097, China, e-mail: ygchen@njnu.edu.cn
Yong-Gao Chen
Affiliation:
Department of Mathematics, Nanjing Normal University, Nanjing, 210097, China, e-mail: ygchen@njnu.edu.cn
Rights & Permissions [Opens in a new window]

Extract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

Let p be a prime and m be a positive integer. For a positive integer n, let ep(n) be the nonnegative integer with pep(n) | n and pep(n)+1n. As a corollary of our main result we derive an asymptotic formula for the counting function with regard to the condition ep(n!) ≡ ɛ (mod 3), where ɛ ∈ Z3. In 2001, Sander proved the result with modulus 2.

Type
Research Article
Copyright
Copyright © Australian Mathematical Society 2006

References

[1]Berend, D., ‘On the parity of exponents in the factorization of n!’, J. Number Theory 64 (1997), 1319.CrossRefGoogle Scholar
[2]Chen, Y.G., ‘On the parity of exponents in the standard factorization of n!’, J. Number Theory 100 (2003), 326331.CrossRefGoogle Scholar
[3]Chen, Y.G. and Zhu, Y.C., ‘On the prime power factorization of n!’, J. Number Theory 82 (2000), 111.CrossRefGoogle Scholar
[4]Erdős, P. and Graham, R.L., Old and new problems and results in combinatorial number theory (L'Enseignement Mathématique, Imprimerie Kundig, Geneva, 1980).Google Scholar
[5]Luca, F. and Stặnicặ, P., ‘On the prime power factorization of n!’, J. Number Theory 102 (2003), 298305.CrossRefGoogle Scholar
[6]Sander, J.W., ‘On the parity of exponents in the prime factorization of factorials’, J. Number Theory 90 (2001), 316328.CrossRefGoogle Scholar