Primitive sets with large counting functions

Details Primitive sets with large counting functions Primitive sets with large counting functions

2010-09-06

arxiv.org/abs/1009.1014v2

Mathematics

Number Theory

7 pages. Revision includes a strengthening of Theorem 1: an upper bound for S(x) of the same order of magnitude as the lower b

Scientific paper

A set of positive integers is said to be primitive if no element of the set is a multiple of another. If $S$ is a primitive set and $S(x)$ is the number of elements of $S$ not exceeding $x$, then a result of Erd\H os implies that $\int_2^\infty (S(t)/t^2\log t) dt$ converges. We establish an approximate converse to this theorem, showing that if $F$ satisfies some mild conditions and $\int_2^\infty (F(t)/t^2\log t) dt$ converges, then there exists a primitive set $S$ with $S(x) \gg F(x)$.

Affiliated with

Also associated with

No associations

Rating

Primitive sets with large counting functions 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 Primitive sets with large counting functions, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Primitive sets with large counting functions will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-297892