# Questions tagged [prime-numbers]

Prime numbers are natural numbers greater than 1 not divisible by any smaller number other than 1. This tag is intended for questions about, related to, or involving prime numbers.

1,829 questions with no upvoted or accepted answers
Filter by
Sorted by
Tagged with
2k views

### Sorting of prime gaps

Let $g_i$ be the $i^{th}$ prime gap $p_{i+1}-p_i.$ If we re-arrange the sequence $(g_{n,i})_{i=1}^n$ so that for any finite $n$ the gaps are arranged from smallest to largest we have a new sequence ...
794 views
+100

### Can we remove any prime number with this strange process?

This is a little algorithm I made today, which may appear to be quite complex, so I will start with an example. Questions are at the end of the post. The process goes as follows: Start with the ...
1k views

### A question about the divisibility of sum of 2 consecutive primes.

Well as I was curious about the sum of $2$ consecutive primes, after proving that the sum for the odd primes always has at least 3 prime divisors, I came up with this question: Find the least ...
726 views

### Algorithm to find primes up to $n$ in $O\left(\frac{n}{\log n}\right)$?

Consider the problem of given an integer $n$, generating a list of the primes not greater than $n$. An optimized version of the Sieve of Eratosthenes can do such task in $O(n)$, while the more modern ...
848 views

### Does the average primeness of natural numbers tend to zero?

Note 1: This questions requires some new definitions, namely "continuous primeness" which I have made. Everyone is welcome to improve the definition without altering the spirit of the question. Click ...
566 views

207 views

### The famous prime race and generalizations

So I was messing around with the famous prime race that comes down to this: We make a list of primes. The list has two rows; the top row is for primes $1\mod 4$ and the bottom row for primes $3\mod 4$...
195 views

### Is every finite list of integers coprime to $n$ congruent $\pmod n$ to a list of consecutive primes?

For example the list $(2, 1, 2, 1)$ is congruent $\pmod 3$ to the consecutive primes $(5, 7, 11, 13)$. But how about the list $(1,1,1,1,1,1,1,1,2,3,4,3,2,3,1) \mod 5$? More generally, we are given ...
1k views

### Matrix generated by prime numbers

Let $p$ be the vector of dimension $n^2$ consisting of ordered prime numbers i.e. $p= [ 1 \ 2 \ 3 \ 5 \ 7 \ldots]^T$ and $A$ be the matrix of dimension $n\times{n}$ constructed with this vector by ...
191 views

320 views

### Does Chaitin's constant have infinitely many prime prefixes?

Define $f(n) = \lfloor 2^n \cdot \Omega \rfloor$, that is, $f(n)$ is the first $n$ bits of Chaitin's constant interpreted as a number written in binary. I am trying to figure out if $f(n)$ can have ...
462 views

### Twin-prime sieve

My question concerns the following sieve (call it S), which was an exercise in applying some elementary aspects of Brun's sieve while reading Halberstam's text. Using the Chinese Remainder theorem ...
306 views

### Weak version of Fortune's conjecture

Let $p\#=2\cdot3\cdot5\cdots p$ denote the primorial and $N(x)$ the smallest prime greater than or equal to $x$. Then Fortune's conjecture is that $N(p\#+2)-p\#$ is prime for all $p$. (Heuristic: to ...
472 views

### A non-composite sequences

Can you provide a counterexample for a claim given below? Inspired by Puzzle 937 I have formulated the following claim: For any $n > 0$ let $B = p_1 \cdot p_2 \cdot .... \cdot p_n$ be the ...
242 views

### Is there an elementary argument for $\prod\limits_{p \le n}p < 3^n$ where $p$ is prime.

I was reading Hanson's proof that $\prod\limits_{p^a \le n}p^a < 3^n$ where $p$ is a prime and it occurred to me that there might be a simpler argument for $\prod\limits_{p \le n} p < 3^n$. Am ...