On a problem of Sierpinski

Details On a problem of Sierpinski On a problem of Sierpinski

2011-10-21

arxiv.org/abs/1110.4714v1

Mathematics

Number Theory

15pages

Scientific paper

Let $s\ge 2$ be an integer. Denote by $\mu_s$ the least integer so that every integer $\ell >\mu_s$ is the sum of exactly $s$ integers $>1 $ which are pairwise relatively prime. In 1964, Sierpi\'nski asked a determination of $\mu_s$. Let $p_1=2$, $p_2=3, ...$ be the sequence of consecutive primes and let $\mu_s = p_2+p_3+...+p_{s+1}+c_s$. P. Erd\H os proved that there exists an absolute constant $C$ with $-2\le c_s\le C$. In this paper, we determine $\mu_s$ for all $s\ge 2$. As a corollary, we show that $-2\le c_s\le 1100$ and the set of integers $s$ with $\mu_s= p_2+p_3+... +p_{s+1}+1100$ has the asymptotic density 1.

Affiliated with

Also associated with

No associations

Rating

On a problem of Sierpinski does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with On a problem of Sierpinski, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On a problem of Sierpinski will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-84917