Approximation of the Multiplication Table Function
Mehdi Hassani
Abstract
In this paper, considering the concept of Universal Multiplication Table, we show that for every n≥ 2, the inequality: M(n)=#\ij|1≤ i,j≤ n\≥n2N(n2), holds true with: N(n)=n 2 n(1+387200 n).
Create a lesson
Related papers
Value distribution of multiplicative functions along linear fractional sequences
Sun-Kai Leung
Delta theory of Anderson Modules II: Hodge-Pink structure
Sudip Pandit, Arnab Saha
Integers divisible by a shifted prime in a given interval
Rebecca Abi Abdallah, Valeriya Kovaleva, Jeremy Schlitt et al.
On Piatetski-Shapiro primes from almost primes
Yuhua Zhao, Jinjiang Li, Linji Long et al.
On Consecutive Non-primitive Elements over Finite Fields
Bidushi Sharma, Dhiren Kumar Basnet
Birch's theorem over function fields with quadratically many variables
Matthew Hase-Liu