Larry Freeman's user avatar
Larry Freeman's user avatar
Larry Freeman's user avatar
Larry Freeman
  • Member for 12 years, 9 months
  • Last seen more than a week ago
13 votes
7 answers
4k views

Are there any interesting or lesser known proofs related to Bertrand's Postulate

13 votes
3 answers
1k views

At what point would an elementary generalization of Bertrand's Postulate be interesting?

7 votes
1 answer
2k views

What are the best known lower and upper bounds for the second Chebyshev function $\psi(x)$

7 votes
1 answer
896 views

Are reduced residue systems relative primorials an active area of research? If not, why not?

6 votes
1 answer
1k views

A question about the Möbius Function

5 votes
1 answer
809 views

Going beyond the Sylvester and Schur theorem with regard to $x,x+1,\dots,x+n-1$

5 votes
0 answers
728 views

Least Prime Factor in a sequence of 2n consecutive integers

4 votes
1 answer
875 views

Least Prime Factors: found a counting formula for a given range -- what is the standard approach?

4 votes
0 answers
159 views

smallest k such that highest prime factor of m(m+1)...(m+k-1) is > n if m > n.

4 votes
2 answers
434 views

Is there a lower bound for the first non-trivial sequence of consecutive integers where each of the first $n$ primes is a least prime factor

3 votes
1 answer
380 views

A question about the second Chebyshev function $\psi(x) = \sum_{m=1}^{\infty}\vartheta(\sqrt[m]{x})$

3 votes
3 answers
674 views

For any prime $p$, is there $C$ such that if $x\ge C$, then all but one integer among $x+1, x+2, \dots, x+p$ has Greatest Prime Factor $> p$

3 votes
0 answers
706 views

Paul Erdős and Ramanujan Primes

2 votes
1 answer
162 views

Are there any theorems about a prime $p > k$ in a sequence stronger than Sylvester-Schur?

2 votes
2 answers
702 views

Are simplified elementary proofs if valid interesting to the professional mathematical community [closed]

2 votes
1 answer
135 views

Estimating the minimum number of distinct least prime factors found in range of $c$ consecutive integers

1 vote
0 answers
119 views

Can the Inclusion-Exclusion Principle be used to establish a lower bound for the number of $i$ where $an < i \le an+n$ and $\gcd(i,w)=1$

1 vote
1 answer
243 views

Another question on strengthening the Sylvester-Schur Theorem

1 vote
1 answer
444 views

Is it true that the sum of a specific floor function of a prime = 1?

0 votes
0 answers
141 views

A question about the Heilbronn-Rohrbach Inequality

-1 votes
1 answer
476 views

Can anyone recommend a reference where the collatz conjecture is viewed as a combinatorics problem?