Some arithmetic properties of numbers of the form ⌊pc⌋\lfloor p^c\rfloor

preprint2015arXivOpen access

Abstract

Let Pc=(⌊pc⌋)p∈P(c>1, c∉N),{\mathbb P}^c=(\lfloor p^c\rfloor)_{p\in{\mathbb P}} \qquad (c>1,\ c\not\in {\mathbb N}), where P{\mathbb P} is the set of prime numbers, and ⌊⋅⌋\lfloor\cdot\rfloor is the floor function. We show that for every such cc there are infinitely many members of Pc{\mathbb P}^c having at most R(c)R(c) prime factors, giving explicit estimates for R(c)R(c) when cc is near one and also when cc is large.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.