G. Paz

most citedOn the Interval [n,2n]: Primes, Composites and Perfect Powers

6 citations · 10 across the 4 of their papers we have counts for

collaborators

4 papers

math.NT2014

When $π (n)$ does not divide $n$

Germán Paz

Let $π (n)$ denote the prime-counting function and let $$f(n)=\left|\left\lfloor\log n-\lfloor\log n\rfloor-0.1\right\rfloor\right|\left\lfloor\frac{\left\lfloor n/\lfloor\log n-1\r…

math.NT2014

Two statements that are equivalent to a conjecture related to the distribution of prime numbers

Germán Paz

Let $n \in Z^{+}$ . In [8] we ask the question whether any sequence of $n$ consecutive integers greater than $n^{2}$ and smaller than $(n + 1)^{2}$ contains at least one prime number…

math.NT2013★ 4 cited

On Legendre's, Brocard's, Andrica's, and Oppermann's Conjectures

Germán Paz

Let $n \in Z^{+}$ . Is it true that every sequence of $n$ consecutive integers greater than $n^{2}$ and smaller than $(n + 1)^{2}$ contains at least one prime number? In this paper w…

math.NT2013★ 6 cited

On the Interval [n,2n]: Primes, Composites and Perfect Powers

Germán Paz

In this paper we show that for every positive integer $n$ there exists a prime number in the interval $[n, 9 (n + 3) /8]$ . Based on this result, we prove that if $a$ is an integer great…

When π(n) does not divide n

Two statements that are equivalent to a conjecture related to the distribution of prime numbers

On Legendre's, Brocard's, Andrica's, and Oppermann's Conjectures

On the Interval [n,2n]: Primes, Composites and Perfect Powers

When $π (n)$ does not divide $n$