**0**

votes

**1**answer

84 views

### Linear forms that avoid numbers with lot of factors

Is following true?
For every given $c>0$ there is an $n_c>0$ such that for every $n>n_c$ there are integers $n<a,b<2n$ such that there are two positive integers $\frac{n}{2(\log ...

**17**

votes

**2**answers

574 views

+100

### Small quotients of smooth numbers

Assume that $N=2^k$, and let $\{n_1, \dots, n_N\}$ denote the set of square-free positive integers which are generated by the first $k$ primes, sorted in increasing order. Question: what is a good ...

**7**

votes

**4**answers

947 views

### Prime numbers $p$ not of the form $ab + bc + ac$ $(0 < a < b < c )$ (and related questions)

If we ask which natural numbers n are not expressible as $n = ab + bc + ca$ ($0 < a < b < c$) then this is a well known open problem. Numbers not expressible in such form are called ...

**0**

votes

**0**answers

74 views

### Prove that k ≤ log2N [on hold]

I have the following problem and I don't know where to star:
Let n ≥ 2 and let n = p1p2...pk be its prime factorization, where the primes are not necessarily distinct. Prove that k ≤ log2N (hint: ...

**10**

votes

**1**answer

661 views

### Estimate on radical of $2^n \pm 1$

Not sure if this belongs to MO or not.
Are there any lower bound on radical of $2^n \pm 1$ (Recall that radical of integer $rad(k)$ is a product of primes which divide integer $k$)?
As an example If ...

**4**

votes

**1**answer

174 views

### Goldbach for certain classes of $n$

Asked on MSE without response here.
$\#$ of ways even $n$ can be represented by prime additions is heareafter denoted $G(n)$.
The Wiki article on the Goldbach conjecture states that
In 1975, ...

**16**

votes

**2**answers

1k views

### Heuristic argument for the prime number theorem?

Here is a bad heuristic argument for the prime number theorem. Let n be a positive integer and assume that PNT holds up to n. Then n itself is prime if and only if for each prime p<n the event p|n ...

**2**

votes

**0**answers

287 views

### How big can a set of integers be if all pairs have bounded gcd

In this recent MO question, it was shown that the maximal cardinality of a subset $A(M,N)$ of $[1,N]$ where the pairwise GCD's of all set elements are upper bounded by $M,$ with $M^2\leq N$ has size ...

**2**

votes

**1**answer

120 views

### Gradual monotonic morphing between two natural numbers

Let $a < b$ be two natural numbers. I will use these as an example:
\begin{align*}
a & = 2^5 \cdot 3^2 \cdot 5^2 = 7200\\\
b & = 2^3 \cdot 3^5 \cdot 7^1 = 13608
\end{align*}
I seek to ...

**7**

votes

**2**answers

716 views

### What is the lower bound for highly composite numbers?

if $x=d(n)$ is the number of divisors of $n$, what is the tightest lower-bound for $n$ only given $x$?
http://en.wikipedia.org/wiki/Highly_composite_number

**4**

votes

**1**answer

435 views

### A general question about strictly non-palindromic numbers

For a definition, see the wikipedia page: http://en.wikipedia.org/wiki/Strictly_non-palindromic_number
So according to the wikipedia page, under properties, all strictly non-palindromic numbers with ...

**3**

votes

**2**answers

249 views

### Primes $P_{2n-1}$ that are $2$ mod $3$

Are infinitely many primes $P_{2n-1}$ expressible as $3k-1$?
The primes $P_{2n-1}$ are every other prime beginning with $2$: $2,5,11,17,23,31,\cdots$. The first few are of the form $3k-1$, but $31$ ...

**0**

votes

**1**answer

41 views

### Function for number of integers having only prime factors >= x? [closed]

Is there a function for the number of integers below n having only prime factors greater than or equal to p? For example, how do i determine the number of integers below 1000 only having prime ...

**0**

votes

**0**answers

32 views

### Estimates related to sum over a primes from a fixed, possibly sparse set

Let $E$ be a fixed infinite sequence of primes such that $\sum_{p \in E} \frac{1}{p} = \infty$. Assume that $\sigma > 1$ depends on some parameter $x \rightarrow \infty$ in such a way that $\sigma ...

**1**

vote

**1**answer

164 views

### Radical of the sum $=$ radical of the product

My question is:
Has it been proved/disproved or studied the following?
For every $k\geq 4$ there are $k$ pairwise relatively prime numbers $a_1,a_2,...,a_k$ all greater than $1$ such that ...

**-5**

votes

**1**answer

177 views

### How to prove twin prime conjecture or Goldbach conjecture if we assume prime distribution is completely random? [closed]

If we assume that prime number distribution is COMPLETELY random (subject to 1/log(x) restriction), can we prove twin prime conjecture or Goldbach conjecture ?
My feeling is that, this will be ...

**6**

votes

**1**answer

250 views

### The limit of the following product? What is the closed form of the value?

Assume that $P_n$ is the $n$'th prime: Please help me solve the following $$\lim_{k\to\infty} {k}\prod_{n=1}^k \frac{P_{2n-1}}{P_{2n}}$$
I am not really sure quite where to start here as I am ...

**5**

votes

**0**answers

284 views

### A problem on prime numbers

Given integers $a,b,c,d\in[2^n,2^m]$ with $m>n>1$, how many primes $p$ are there in $[n^\alpha,n^\beta]$ for some $1<\alpha<\beta$ such that
$$0<a\bmod p<n^{\alpha/k}$$
$$0<b\bmod ...

**2**

votes

**1**answer

158 views

### Definition of primitive divisor of a Lucas sequence

If $\{a_n\}_{n=1}^\infty$ is a sequence of integers, then the definition of primitive divisor of one of its terms is quite natural:
Def. 1. A prime number $p$ is a primitive divisor of $a_n$ if $p ...

**4**

votes

**1**answer

167 views

### What is known about the largest prime divisor of the product of $k$ consecutive integers?

Take $k$ consecutive composite integers from a prime gap. What is known about the largest prime divisor of their product?
It seems to me that except for the triplet $(8,9,10)$ and the pair $(8,9)$ , ...

**6**

votes

**0**answers

88 views

### Asymptotic density of winning positions in “Prime Nim”?

Consider a single-pile NIM variant, played under standard (not misere) objective, with the rule that you may remove any prime number from the pile. The winning positions of this game are all numbers ...

**4**

votes

**1**answer

266 views

### Upper bound for the first Hardy-Littlewood conjecture

About the Hardy-Littlewood conjecture by Terence Tao:
Conjecture 2 (Prime tuples conjecture, quantitative form) Let ${k_0 \geq 1}$ be a fixed natural number, and let ${{\mathcal H}}$ be a fixed ...

**4**

votes

**1**answer

378 views

### About factorization in Zhang's proof of weak Twin Prime conjecture

Why does it need to firstly factorize the number n into two factors q and r( Lemma 4 in the paper,see the following)? What's the motivation. What if it doesn't do this factorization?

**0**

votes

**2**answers

274 views

### Does theta(n)<n for all n imply the Riemann Hypothesis and/or vice versa?

I know that better and better bounds of the Chebyshev Theta and Psi functions are implied by knowing that the first (insert large number here) zeta zeroes lie on the Critical Line. These bounds, ...

**2**

votes

**0**answers

117 views

### On sets of coprime numbers

We know that from prime number theorem that the number of primes below $n$ and above $\frac n2$ (denoted by $\pi_{n,\frac n2}$ is approximately $$\pi_{n,\frac n2}\approx\frac{n}{2\ln n}.$$
Denote by ...

**-2**

votes

**0**answers

112 views

### Upper bound for the exponent $\beta$ of the log in $p_{n+1}-p_{n}\ll \log^{\beta} p_{n}$

Assuming $\beta:=\inf\{C\mid p_{n+1}-p_{n}\ll\log^{C}p_{n}\}<\infty$, can we give an explicit upper bound for $\beta$ ?
Many thanks in advance.

**2**

votes

**1**answer

141 views

### Gap between semiprimes

Is there a conjectured gap between semiprimes?
There is a conjectured gap between primes in form of Cramer's conjecture. Using this we have $p_1\leq p_0+c(\log p_0)^2$ for consecutive primes $p_0$ ...

**22**

votes

**1**answer

636 views

### How big can a set of integers be if all pairs have small gcd?

Suppose $A\subset[1,N]$ is a set of integers. If for any distinct $a,b\in A$ we have $(a,b)\leq M$ then how big can $|A|$ be?
If $M=1$ then $|A|$ is at most $\pi(N)$ since the map $a\mapsto P_+(a)$ ...

**1**

vote

**1**answer

114 views

### A deterministic and explicitly described walk which is like random ones

Consider a sequence $(X_i)_{i = 1}^{\infty}$ which every $X_i$ is $-1$, $0$ or $+1$ and lets define $Y_n = X_1+ \cdots + X_n$. We say the sequence $(X_i)_{i = 1}^{\infty}$ a Good Sequence if $Y_n \neq ...

**6**

votes

**1**answer

184 views

### $N_p := \text{card}\{(x, y, z, t) \in (\textbf{F}_p)^4 : ax^4 + by^4 + z^2 + t^2 = 0\}?$

Assume that $ab \neq 0$. What is $$N_p := \text{card}\{(x, y, z, t) \in (\textbf{F}_p)^4 : ax^4 + by^4 + z^2 + t^2 = 0\}?$$I need this result, but unfortunately I am not a number theorist. Could ...

**7**

votes

**0**answers

158 views

### Primes of the form $(2m+1)^2-2^{2s+1}$

The question is the following :
Question:
Does there exist infinitely many primes of the form $(2m+1)^2-2^{2s+1}$ with $m,s\geq 1$ ?
Why this could be true:
Bunyakowsky conjecture would ...

**2**

votes

**0**answers

188 views

### Avoiding Chinese Remainder Theorem

Given $k\in\Bbb N$ with $k<(\log_2N)^{\frac1\alpha}$ where $\alpha>2$ is fixed and $N$ being some integer such that $$N<\prod_{i=1}^k\pi_i^{a_i}$$ where $\pi_1,\pi_2,\dots,\pi_{k-1},\pi_k$ ...

**0**

votes

**0**answers

98 views

### Bounding $\dfrac{r(x)}{\pi(x+r(x))-\pi(x-r(x))}$ with $1\ll r(x)\ll \log^{4}(x)$

I would like to know whether it is possible to obtain the bounds $\sqrt{r(x)}\ll k(x)\ll r(x)$ where $k(x)={\pi(x+r(x))-\pi(x-r(x))}$ and $1\ll r(x)\ll \log^{4}(x)$ and thus ...

**2**

votes

**2**answers

330 views

### Primes $p$ for which $2p-1$ is prime

It's a well-known open problem (Sophie-Germain primes) whether there are infinitely many primes $p$, $2p+1$. What about $p$, $2p-1$?
Seemingly it's also an open problem (see here and the linked ...

**3**

votes

**1**answer

171 views

### Is $2^n -1$ finitely many times the product of consecutive primes? [duplicate]

This question was asked at MSE but recieved no attention at all.
Here it is:
Are there finitely many $(n,k) \in \mathbb{N}^2$ with $2^n-1=p_1p_2\cdots p_k$ ?
$p_1=3,p_2=5 , ...,p_k$ are ...

**20**

votes

**1**answer

654 views

### Avoiding multiples of $p$

Let $p$ be a prime number and $P=\{1,2,...,p-1\}$
In how many ways we can sum all the elements of $P$ in such a way that we will reach a multiple of $p$
only when we sum the last summand?
For ...

**4**

votes

**0**answers

96 views

### Behavior of the “mean prime factor” of numbers

This question concerns the behavior of
a function $f(\;)$ that maps each number in $\mathbb{N}$ to
its mean prime factor.
I previously posted premature questions, now deleted, which
explains the cites ...

**8**

votes

**1**answer

301 views

### Distribution of the number of prime factors

Count the number of prime factors of a number $n$
to include multiplicity,
so that
$$n=24=2^3 \cdot 3 = 2 \cdot 2 \cdot 2 \cdot 3$$
has $4$ prime factors, and
$$n =
6500 =
2^2 \cdot 5^3 \cdot 13 =
2 ...

**3**

votes

**1**answer

262 views

### Did Erdős prove there are two primes $4a+1, 4b+3$ between between $n$ and $2n$?

http://mathworld.wolfram.com/ChoquetTheory.html
Is the claim in the link true? Here's the reference given there:
https://www.renyi.hu/~p_erdos/1934-01.pdf
Erdős proved that there exist at least ...

**7**

votes

**3**answers

695 views

### Bound the error in estimating a relative totient function

Let $n=p_1^{e_1}\cdots p_k^{e_k}$ be an integer with $k$ prime factors. We know that the number of integers less than $n$ and coprime to it is
$$\Phi(n)=n-\sum_i\frac n{p_i}+\sum_{i \lt j}\frac ...

**7**

votes

**3**answers

489 views

### Quantitative and elementary proofs of the Prime Number Theorem

I would like to know two things: one, whether the best quantative bounds in the Prime Number Theorem are still basically those given by the Vinogradov-Korobov zero-free region? and two, whether there ...

**4**

votes

**2**answers

267 views

### Relative-totient function (2nd attempt)

Let $\Lambda(x,y)$ be the count of totatives of $x$ that are less than or equal to $y$.
I am asking for the following result to be verified, (particularly the final proposal), I have found no ...

**1**

vote

**0**answers

112 views

### A Question on Chinese Remainder Theorem [closed]

Let $p_1,p_2,\ldots,p_n$ be odd primes.
Let $y$ be the unique solution of the Chinese Remainder Problem ( $0 \le y < m$, $ m = p_1\cdot p_2 \cdots p_n$)
$ y = \frac{p_1-1}{2} \text{ mod } (p_1) ...

**6**

votes

**0**answers

184 views

### Any ways to Simplify Daboussi's Argument for Prime Number Theorem?

One strategy to prove the Prime number theorem involves removing some factors:
$$ \limsup_{x \to \infty} \underbrace{\frac{1}{x}\sum_{n \leq x} \mu(x)}_{\color{red}{A}}\leq
\prod_{p \leq y} \left( 1 ...

**4**

votes

**1**answer

453 views

### Green-Tao theorem for 1-central numbers

This question came to my mind this afternoon while trying to figure out a possible way to tackle de Polignac's conjecture, which states that every even positive integer can be written as the ...

**11**

votes

**7**answers

2k views

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

There are 3 standard proofs of Bertrand's Postulate:
(1) Chebyshev's original proof
(2) Ramanujan's simplification of Chebyshev's proof
(3) Erdos's proof
I recently learned about the very ...

**17**

votes

**2**answers

3k views

### Does the equation $241+2^{2s+1}=m^2$ have a solution?

Let $p$ be a prime congruent to $1$ mod. 8.
If $p= 17$ one has : $p+ 8 = 5 ^2$.
If $p= 41$ one has : $p+ 8 = 7 ^2$.
If $p= 73$ one has : $p+ 8 = 9 ^2$.
If $p= 89$ one has : $p+ 32 = 11 ^2$.
If ...

**6**

votes

**1**answer

370 views

### Prime labelling of graphs

A prime labeling of a graph is an injective function $f: V(G) \to \{1, 2, ..., |V(G)|\}$
such that for every pair of adjacent vertices $u$ and $v$, $\text{gcd}(f(u), f(v)) = 1$ (labels of any two ...

**-1**

votes

**1**answer

590 views

### What is wrong with this counterexample to primality test assuming GRH? [closed]

From SMOOTH NUMBERS: COMPUTATIONAL NUMBER THEORY AND BEYOND Andrew Granville pp.13-14:
2j. Lenstra’s polynomial time test as to whether an integer that is conjecturally prime, is rigorously ...

**-3**

votes

**2**answers

293 views

### The number of totatives to the nth primorial, in an interval shorter than the nth primorial

(The notation of this question will be improved over the next few days, sorry for the lack of clarity at the moment.)
Can, and if so when can, we determine the amount of natural numbers which are ...