1
vote
1answer
146 views

Asymptotic formula for the number of ways to write a number as the sum of $k$ triangular numbers

How would one derive an asymptotic formula for the number of representations of a number $n$ as the sum of $k$ numbers of the form $\frac{m(m + 1)}{2}$ I think that one could use the circle method, ...
-1
votes
0answers
23 views

Proof that $G(3)\le 7$ [migrated]

Let $G(k)$ be the minimal $n$ s.t. every sufficiently large integer is the sum of $n$ nonnegative $k$th powers. Does anybody know where I can find Vaughan's proof that $G(3)\le 7$? I can't find a ...
4
votes
1answer
261 views

Circle method on things other than the integers

The circle method is often used to estimate the number of solutions to the equation $$x_1 + x_2 + ... x_k = N$$ if for all $i$ $x_i\in A\subseteq\mathbb{N}_0$ and some subset of the nonnegative ...
21
votes
3answers
2k views

How many different numbers can be obtained as product of first $n$ natural numbers?

Let m and n be natural numbers, and consider the set of all possible products of m (not necessarily distinct) elements from the set $\{1,2,\ldots,n\}$, that is consider the set $\{1^{a_1} \cdot ...
4
votes
2answers
395 views

Average involving the Euler phi function

Does $$\frac{1}{N^2}\sum _{d=1}^N \log d \sum _{n=1}^{N/d} \frac{\phi(n)}{\log (dn)},$$ converges or not when $N$ goes to infinity?
1
vote
0answers
153 views

Estimates for the size of the product set [n].[n] [duplicate]

Possible Duplicate: Number of elements in the set {1,…,n}*{1,..,n} Writing $[n]$ for the set $\lbrace1,2,...,n\rbrace$, let $P_n$ denote the product set $[n].[n]$, i.e. $$ P_n = ...
23
votes
2answers
2k views

Number of elements in the set $\{1,\cdots,n\}\times\{1,\cdots,n\}$

Let $A_n=\{a\cdot b : a,b \in \mathbb{N}, a,b\leq n\}$. Are there any estimates for $|A_n|$? Will it be $o(n^2)$?
2
votes
0answers
246 views

Prime divisors of the difference set

Fix $c\in(0,1)$, and let $N$ be a (large) positive integer. Given a set $A=\{0=a_1<\dots<a_n=N\}$ of density $\alpha:=n/N>c$ with $\gcd(A)=1$, I want to find a prime dividing as few ...