Is this observation equivalent to Legendre’s conjecture? $$E1:\forall k \in \Bbb N^+ \not \exists n,m \in \Bbb N^+, n \not = m:\ \ \ k! \le n^2\# \lt m^2\# \le (k+1)! $$ This observation is a consequence of some tests regarding the kind answer of @Will Jagy to a previous question at MSE. $E1$ can […]

I’ve been reviewing the following: $$v_i = \left\lfloor\frac{ip_k\#}{p_{k+1}}\right\rfloor + c_i$$ where: $c_i \in \left\{1,2\right\}$ so that $v_i$ is odd and $v_ip_{k+1} > ip_k\# > (v_i-c)p_{k+1}$ $i$ is an integer such that $1 \le i \le p_{k+1}-1$ $\left\lfloor\frac{a}{b}\right\rfloor$ is a floor function I hit a result that surprises me. Let $[v_i]$ be a residue modulo $p_k\#$ […]

It is well known that the number of elements in the reduced residue system for a given primorial $p_k\#$ is divisible by $p_k – 1$. Does it follow that if you divide the elements of a reduced residue class into distinct classes modulo $p_k$, that each class modulo $p_k$ has the same number of element […]

This question already has an answer here: Convergence of infinite product of prime reciprocals? 1 answer

Let $m \ge 2$ be an integer. Let $p_n$ be the $n$th prime so that $p_1 = 2, p_2 = 3,$ etc. Let $p_n\#$ be the primorial for $p_n$. Let $\gcd(a,b)$ be the greatest common divisor for $a$ and $b$. Let $f(m,p_n) =$ the number of integers $x$ where $0 < x \le m$ and […]

Let $p_n$ be the $n$th prime where $n \ge 3$. Let $p_n\#$ be the primorial for $p_n$ and let lpf$(x)$ be the least prime factor for $x$. I am feeling like this should be very easy to prove but I am struggling to complete the argument. This is easy to show if $0 \le w […]

I have invented two sets of positive integers: highly regular numbers and superior highly regular numbers. A positive integer $m \leq n$ is a regular of the positive integer $n$ if all prime numbers that divide $m$ also divide $n$. So for example: 4 has 3 regulars: 1, 2, 4. 6 has 5 regulars: 1, […]

Observe this list: $$ \begin{aligned} 2+1&=3\\ 2\cdot3+1&=7\\ 2\cdot3\cdot5+1&=31\\ 2\cdot3\cdot5\cdot7+1&=211\\ 2\cdot3\cdot5\cdot7\cdot11+1&=2311\\ 2\cdot3\cdot5\cdot7\cdot11\cdot13+1&=59\cdot509\\ 2\cdot3\cdot5\cdot7\cdot11\cdot13\cdot17+1&=19\cdot97\cdot277\\ 2\cdot3\cdot5\cdot7\cdot11\cdot13\cdot17\cdot19+1&=347\cdot27953\\ 2\cdot3\cdot5\cdot7\cdot11\cdot13\cdot17\cdot19\cdot23+1&=317\cdot703763\\ 2\cdot3\cdot5\cdot7\cdot11\cdot13\cdot17\cdot19\cdot23\cdot29+1&=331\cdot571\cdot34231\\ 2\cdot3\cdot5\cdot7\cdot11\cdot13\cdot17\cdot19\cdot23\cdot29\cdot31+1&=200560490131\\ 2\cdot3\cdot5\cdot7\cdot11\cdot13\cdot17\cdot19\cdot23\cdot29\cdot31\cdot37+1&=181\cdot60611\cdot676421\\ 2\cdot3\cdot5\cdot7\cdot11\cdot13\cdot17\cdot19\cdot23\cdot29\cdot31\cdot37\cdot41+1&=61\cdot450451\cdot11072701\\ 2\cdot3\cdot5\cdot7\cdot11\cdot13\cdot17\cdot19\cdot23\cdot29\cdot31\cdot37\cdot41\cdot43+1&=167\cdot78339888213593 \end{aligned} $$ Is it true that all prime factors occur with multiplicity one in this list? (Note that if one multiplies consecutive primes not starting from 2 and adds 1, there are many examples of multiplicities […]

As the title explains, I am trying to know if there is a definition about the upper limit to find the first primorial $p_i\#$ (following the definition at OEIS) existing after a given factorial $n!$ (in other words, the first primorial greater than the given factorial $n!$ such as $\not\exists \ p_j\#: \ n! \lt […]

How often is $1+\prod_{k=1}^n p_k$ is not prime?,wkere $p_k$ is k’th prime consider that $2\times3\times5\times7\times11\times13+1=59\times509 = 30031$ is this one off or, are there infinitely many composites of the form $1+\prod_{k=1}^n p_k$?

Intereting Posts

Prove the uniqueness of poisson equation with robin boundary condition
totient function series diverges?
Induction to prove $2n + 3 < 2^n$
Clairaut's Theorem And continuity of a multivariate function
Comparing the Lebesgue measure of an open set and its closure
How do I find the cumulative distribution function of a binomial random variable?
Prove that function is homeomorphism.
Ideal correspondence
If $(m,n)\in\mathbb Z_+^2$ satisfies $3m^2+m = 4n^2+n$ then $(m-n)$ is a perfect square.
$\text{Sup}\{x\geq0:\sum\limits_{n=1}^\infty x^{\sqrt n}<\infty \}$
Fast arithmetic, without a calculator?
Un-curl operator?
Prob. 5, Sec. 27 in Munkres' TOPOLOGY, 2nd ed: Every compact Hausdorff space is a Baire space
How does this equation to find the radius from 3 points actually work?
Create a formula that creates a curve between two points