Approximation of the Multiplication Table Function

Simple item page
dc.creatorHassani, Mehdi
dc.date2006-03-28
dc.date2006-05-02
dc.date.accessioned2026-07-07T08:07:41Z
dc.date.available2026-07-07T08:07:41Z
dc.descriptionIn this paper, considering the concept of Universal Multiplication Table, we show that for every $n\geq 2$, the inequality: $$ M(n)=#\{ij|1\leq i,j\leq n\}\geq\frac{n^2}{\mathfrak{N}(n^2)}, $$ holds true with: $$ \mathfrak{N}(n)=n^{\frac{\log 2}{\log\log n}(1+\frac{387}{200\log\log n})}. $$
dc.description5 pages
dc.identifierhttps://arxiv.org/abs/math/0603644
dc.identifierhttp://arxiv.org/abs/math/0603644
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/131015
dc.subjectNumber Theory
dc.subjectStatistics Theory
dc.subject65A05, 03G10, 11S40
dc.titleApproximation of the Multiplication Table Function
dc.typetext

Files

Collections

arXiv