Search Results
Search type | Search syntax |
---|---|
Tags | [tag] |
Exact | "words here" |
Author |
user:1234 user:me (yours) |
Score |
score:3 (3+) score:0 (none) |
Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
Views | views:250 |
Code | code:"if (foo != bar)" |
Sections |
title:apples body:"apples oranges" |
URL | url:"*.example.com" |
Saves | in:saves |
Status |
closed:yes duplicate:no migrated:no wiki:no |
Types |
is:question is:answer |
Exclude |
-[tag] -apples |
For more details on advanced search visit our help page |
On the blending of real/complex analysis with number theory. The study involves distribution of prime numbers and other problems and helps giving asymptotic estimates to these.
17
votes
2
answers
2k
views
Is every odd positive integer of the form $P_{n+m}-P_n-P_m$?
I am looking for a comment, reference, remark, or proof of three conjectures as follows:
Conjecture 1: Let $x$ be an odd positive integer. Then there exist two integers $n, m \ge 2$ so that $$x=P_{ …
10
votes
1
answer
2k
views
Is new $n$-conjecture as follows correct?
Given a positive integer $P>1$, let its prime factorization be written as$$P=p_1^{a_1}p_2^{a_2}p_3^{a_3}\cdots p_k^{a_k}.$$
Define the functions $h(P)$ by $h(1)=1$ and $h(P)=\min(a_1, a_2,\ldots,a_k). …
8
votes
0
answers
575
views
Are there at least one of $a$, $b$, $c$, $a+b$, $b+c$, $c+a$ have h(P) $\le 3$? (was checked...
Given a positive integer $P>1$, let its prime factorization be written $$P=p_1^{a_1}p_2^{a_2}p_3^{a_3}\cdots p_k^{a_k}$$
Define the functions $h(P)$ by $h(1)=1$ and $h(P)=\min(a_1, a_2,\ldots,a_k)$
I …
8
votes
2
answers
385
views
Can exist a positive integer number $x$ such that $a_1=x$ and $a_n=2a_{n-1}+1$ are not prime...
Using my computer, I found that the most of positive integer number $x$ such that $a_1=x$ and $a_n=2a_{n-1}+1$ is prime number after a few iterations. But exist some positive integer numbers, my comp …
7
votes
1
answer
659
views
Prove: If $P_n$ is $n$-$th$ prime number then $P_{n+m} \ge P_n+P_m$
Let $n > 1$ and $m > 0$ be two integers and $P_n$ be the $n^{th}$ prime.
Prove: $$P_{n+m} \ge P_n + P_m .$$
Can you give a hint, reference, comment, or proof?
6
votes
2
answers
711
views
Does always exist a prime number between $n(n+1)$ and $(n+1)(n+2)$?
Let $n$ is positive integer number, does always exist a prime number between $n(n+1)$ and $(n+1)(n+2)$?
6
votes
2
answers
1k
views
$\pi((n+1)^2)-\pi(n^2) \le \pi(n)$ for all $n \ge 370$?
There are some conjectures of the form: There always exist at least $X$ prime numbers between $A$ and $B$. Examples:
Bertrand's postulate: for every $n>1$ there is always at least one prime $p$ such …
5
votes
1
answer
266
views
Is it a known property of positive integers $n> 2 $ that one must have $n < \mathrm{rad}(n(n...
Let $P(n)$ be the statement that
$$n < \mathrm{rad}(n(n-1)(n-2)),$$
where $\mathrm{rad}$ is the radical of an integer, that is defined as
$$\operatorname{rad}(m)=\prod_{\substack{p\mid m\\p\text{ pri …
4
votes
0
answers
334
views
The number of continuously increasing primes gaps in the interval $[2,n]$ is less than $\log n$
A prime gap is the difference between two successive prime numbers. The $n$-th prime gap, denoted $g_n$ or $g(p_n)$ is the difference between the $(n+1)$-st and the $n$-th prime numbers. Using my comp …
4
votes
4
answers
894
views
Let $X$ be a positive integer. Then $\pi{(X+\ln^2{X})}-\pi{(X-\ln^2{X})}>\ln{X}$?
The prime-counting function is the function counting the number of prime numbers less than or equal to some real number $x$. It is denoted by $\pi{(x)}$. Using my computer I found that for any posit …
3
votes
1
answer
396
views
Probability of finding a prime number between $x-\ln(x)$ and $x+\ln(x)$
Using my computer, I found that in the interval $[1, N]$ the probability of finding a prime number between $x-\ln(x)$ and $x+\ln(x)$ is greater than constant $c$ where $N=10^2, 10^3,...,10^{9}$, $x$ …
2
votes
1
answer
339
views
Is there a constant $\alpha$ such that: $P_{n+1} < P_n.\left(\frac{n+1}{n}\right)^\alpha$?
Is there a constant $\alpha$ such that:
$$P_{n+1} < P_n \cdot \left(\frac{n+1}{n}\right)^\alpha$$
Or
$$\lim_{n\to\infty}\frac{\ln\frac{P_{n+1}}{P_n}}{\ln\frac{n+1}{n}} < +\infty$$
Whe …
1
vote
1
answer
153
views
Is $P_{2n} \ge 2P_n$ and $\pi(2x) \le 2\pi(x)$ inconsistent to the Prime k-tuple conjecture?
I posed a conjecture as follows that is a special case of Second Hardy–Littlewood conjecture:
For $n, x \ge 2$ be two integers then:
$$P_{2n} \ge 2P_n$$
and
$$\pi(2x) \le 2\pi( …
-3
votes
2
answers
260
views
The inequality $\Pi (1-\frac{1}{a_i})^{x_i} \le \Pi (1-\frac{1}{b_j})^{y_j} $ hold? [closed]
Question: Are the properties as follows holds?
Version 1: the answer by Bjørn Kjos-Hanssen
Let $P$ be a positive integers. We written: $P=$ $a_1^{x_1}a_2^{x_2}...a_n^{x_n}$ $=b_1^{y_1}b_ …
-4
votes
1
answer
228
views
A generalization Bertrand's postulate [closed]
Let $n, k$ are integers number such that $1<n \le k$, does always exist a prime number between $kn$ and $k(n+1)$?
When $n=1, k>1$ always exist a prime number between $k$ and $2k$ the question was pr …