Take the 2-minute tour ×
Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. It's 100% free, no registration required.

In this question on Math.SE, I asked about Ramanujan's (ridiculously close) approximation for counting the number of 3-smooth integers less than or equal to a given positive integer $N$, namely, \begin{eqnarray} \frac{\log 2 N \ \log 3 N}{2 \log 2 \ \log 3}. \end{eqnarray} In his posthumously published notebook, Ramanujan generalized this formula to similarly counting numbers of the form $b_1^{r_1} b_{2}^{r_{2}}$, where $b_1, b_2 > 1$ are (not necessarily distinct) natural numbers and $r_1, r_2 \geq 0$: \begin{eqnarray} \frac{\log b_1 N \ \log b_2 N}{2 \log b_1 \ \log b_2}, \end{eqnarray} where a factor of $\frac{1}{2}$ is to be added if $N$ is of the prescribed form. Both of these problems could be understood by counting the number of non-negative integer solutions of the Diophantine inequality: $(\log b_1) x_1 + (\log b_2) x_2 \leq \log N$, which also counts the number of $\mathbb{Z}$-lattice points in the $\log N$ dilate of the $2$-polytope $\mathcal{P} = \textbf{conv}(\mathbf{0}, (\log b_{1})^{-1} \mathbf{e}_1, (\log b_2)^{-1} \mathbf{e}_{2})$. Here, $\{ \mathbf{e}_{i}\}$ is the standard basis of $\mathbb{R}^{n}$. Unfortunately, counting lattice points in real polytopes is hard.

My question, now, is how important a contribution to mathematics would it be if one had an exact formula for counting $y$-smooth integers less than or equal to a real $x > 0$, i.e., an exact formula for the de Bruijn function $\Psi(x,y)$? This would, at the same time, translate into an exact formula for counting lattice points of real polytopes of the form $\textbf{conv}(\mathbf{0}, a_{1} \mathbf{e}_{1}, \dots, a_{n} \mathbf{e}_{n})$ with $a_{i} \in \mathbb{R}_{> 0}$.

I'm aware of the review articles by Pomerance, Granville, Hildebrand and Tenenbaum, which each deal with various estimates of the De Bruijn function and its useful in the Quadratic Sieve Method of factorization and applications to cryptography, and even Waring's Problem. However, none of these review articles deal with the consequences of having an exact formula.

share|improve this question
add comment

1 Answer

I would say it would be important enough to publish it. According to the survey by Hildebrand and Tenenbaum, the approximate estimates have themselves found surprising applications in number theory. An exact formula will only do better!

In any case, one can never expect the surprising ways some results can be used. Consider the pigeon-hole principle for instance.

Congratulations, btw.

(Probably not the answer you were expecting, though).

share|improve this answer
add comment

Your Answer

 
discard

By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.