Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
157 tokens/sec
GPT-4o
8 tokens/sec
Gemini 2.5 Pro Pro
46 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Multiplicative bases and an Erdős problem (1602.06724v1)

Published 22 Feb 2016 in math.NT

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

We haven't generated a summary for this paper yet.