Romeo Mevstrovi'c

activity

20122019

most citedEuclid's theorem on the infinitude of primes: a historical survey of its proofs (300 B.C.--2022) and another new proof

13 citations · 48 across the 20 of their papers we have counts for

collaborators

Showing 2012Show all

3 papers · 1 filter

math.NT2012★ 2 cited

An elemetary proof of an estimate for a number of primes less than the product of the first $n$ primes

Romeo Meštrović

Let $α$ be a real number such that $1 < α < 2$ and let $x_{0} = x_{0} (α)$ be a {\rm(}unique{\rm)} positive solution of the equation $x^{α - 1} - \frac{π}{e ^{2} 3} x + 1 = 0.$ Then we prove t…

math.NT2012

A congruence modulo $n^{3}$ involving two consecutive sums of powers and its applications

Romeo Meštrović

For various positive integers $k$ , the sums of $k$ th powers of the first $n$ positive integers, $S_{k} (n + 1) = 1^{k} + 2^{k} + ... + n^{k}$ , have got to be some of the most popular sums in all of m…

math.HO2012★ 13 cited

Euclid's theorem on the infinitude of primes: a historical survey of its proofs (300 B.C.--2022) and another new proof

Romeo Meštrović

{\bf In the fourth extended version of this article, we provide a comprehensive historical survey of 200 different proofs of famous Euclid's theorem on the infinitude of prime numb…

An elemetary proof of an estimate for a number of primes less than the product of the first n primes

A congruence modulo n3 involving two consecutive sums of powers and its applications

Euclid's theorem on the infinitude of primes: a historical survey of its proofs (300 B.C.--2022) and another new proof

An elemetary proof of an estimate for a number of primes less than the product of the first $n$ primes

A congruence modulo $n^{3}$ involving two consecutive sums of powers and its applications