Papers
Topics
Authors
Recent
Search
2000 character limit reached

Multiplicative bases and an Erdős problem

Published 22 Feb 2016 in math.NT | (1602.06724v1)

Abstract: In this paper we investigate how small the density of a multiplicative basis of order $h$ can be in ${1,2,\dots,n}$ and in $\mathbb{Z}+$. Furthermore, a related problem of Erd\H os is also studied: How dense can a set of integers be, if none of them divides the product of $h$ others?

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.