0
votes
0answers
96 views

Arithmetic progression and average of two prime numbers

Let $A=(a_n : n \in \mathbb{N})$ be the sequence given by: $$ \ a_n = a_1 + (n - 1)d,\quad a_1,\ d,\ n \in \mathbb N,\quad d\gt a_1,\quad \gcd(a_1,\ d)=1. $$ For all terms of $A$ greater than $\ ...
1
vote
2answers
54 views

Intuitively, what separates Mersenne primes from Fermat primes?

A Mersenne prime is a prime of the form $2^n-1$. A Fermat prime is a prime of the form $2^n+1$. Despite the two being superficially very similar, it is conjectured that there are infinitely many ...
13
votes
1answer
499 views

Big-Daddy-Conjectures and Hierarchy of Mathematical Conjectures

I am interested in the Hierarchy and Connections between various different open problems in Mathematics, and the most general conjectures in various fields of Mathematics. Examples of Hierachy ...
3
votes
1answer
23 views

Find all $n$ so that $c_n$ $>$ $\pi(n^2)$

Find all $n$ $\in$ $\mathbb{N}$ so that $p_{c_n}$ $>$ $n^2$ where $p_n$ denotes the $n$-th prime and $c_n$, the $n$-th composite. I have tried doing the problem using The stronger version of ...
2
votes
0answers
60 views

Is this a conjecture or an already existing one??

Does the following inequality hold? $p(n)\leq 2^n,$ where $p(n)$ is the $n$th prime. If this is true then it follows that: If $p(n)=p(m)^x+p(o)^y$, then $\max[x,y] \le n$.
5
votes
1answer
113 views

Zhang's theorem and Polignac's conjecture

Yitang Zhang made a groundbreaking discovery when he proved that there are infinitely many pairs of prime numbers which differ by less than $70,000,000$. Zhang's theorem has been significantly ...
2
votes
0answers
61 views

Prove the inequality for composite numbers

Is it true that $c_m+c_n$ $>$ $c_{m+n}$ for all $m$, $n$ $\in$ $\mathbb{N}$? Though the result seems true, I can't get a solution. Even the bounds on $c_n$ obtained from Prime Number Theorem ...
0
votes
0answers
26 views

A conjecture on the product of digits of a number

Define $(m,n)$ to be a special pair if $n=m \cdot Pd(n)$. Where $Pd(n)$ is the product of digits $n$. Then I have the following conjecture - For every $m$ with no digit of $m$ being $0$ , there ...
5
votes
1answer
313 views

Prove that there exists an $m$ such that for any $n>m$ there exists at least one prime between $c_n$ and $n$

Let $c_n$ be the $n$-th composite. Then the problem is to prove that- $\pi(c_n)-\pi(n)>0$ $\forall n>m$ I have tried to progress in the problem using an elementary approach. So far I have ...
2
votes
0answers
47 views

How to prove that every $l$ (such that $ 2 \leq l \leq \lfloor \sqrt{k^2+2n+1} \rfloor $) divides at least one of the following numbers?

$ k^2+2n, k^2, k^2+1, 2n, 2n+1$, (for some $n$) if $k$ is even and $0 < n < k$. I have no idea of how to prove that. I'm working on Legendre's conjecture. Update 1: Yes, for $n=0$ all $l$ ...
0
votes
2answers
27 views

On extracting primes from coprimes

Proof or disprove the following statement - There exists infinitely many $a$ and $b$ which are pair of co-prime integers , either $ab+1$ or $ab-1$ is prime. Motivation- Looking at some twin prime ...
2
votes
1answer
116 views

Twin Prime conjecture current status

Can someone help me with a link to read about the status of the Twin Prime conjecture. I have browse on the internet and have read some articles but still I have no clue of the updated status of Twin ...
1
vote
1answer
44 views

Mertens conjecture - bounds

The disproven Mertens Conjecture states that $$|M(n)|\leq \sqrt{n}$$ If it is bounded at all, would the bounds $$|M(n)|\leq \sqrt{2n\log(\log (n))}$$ not be more realistic, and still consistent with ...
5
votes
0answers
95 views

Mertens conjecture & Riemann hypothesis [closed]

The Mathworld page on the Mertens Conjecture states that $$\limsup_{n\rightarrow\infty}|M(n)|n^{-1/2}=\infty$$ seems very probable (Odlyzko and te Riele 1985). Would it not then follow that ...
1
vote
0answers
86 views

All about a failed conjecture.

Some months ago I made the following conjecture - Let $d(n)$ denote the number of divisors of $n $. Then let $N$ be a number such that $d(N)$ divides $N$ . Also let $I= \frac{N}{d(N)}$ which is ...
5
votes
0answers
106 views

Are $ut + 1$ and $ut + t + 1$ both prime for some t for any $u$?

Conjecture : For any natural number $u$, there is a natural number $t$ such that $ut + 1$ and $ut + t + 1$ are both prime. So we get a solution of the equation $$au - b(u+1) = -1$$ with prime ...
0
votes
1answer
53 views

Conjecture linking multiplicative order of $2$ and semi-primes

Suppose we have a semi-prime $N=pq$, where $p \ne q$, and $p>2$, $q>2$ Let $k$ be the multiplicative order of $2$ mod $N$, then either $p^{2} \bmod k \equiv 1$ or $q^{2} \bmod k \equiv 1$ Is ...
4
votes
2answers
133 views

Conjecture involving semi-prime numbers of the form $2^{x}-1$

Let $x$ be a positive integer such that $(2^{x}-1)=pq$ , where $p$ and $q$ are prime numbers. I want to show that either $p^{2} \bmod x \equiv 1$ or $q^{2} \bmod x \equiv 1$ (or both of course). Is ...
4
votes
2answers
241 views

A conjecture on $\phi(n)$

Let $\phi(n)$ denote the Euler totient function of $n $. Then let $N$ be a number such that $\phi(N)$ divides $N$ . Also let $I_1= \frac{N}{\phi(N)}$ which is defined as the "Second order Index of ...
8
votes
1answer
186 views

Proving infinitude of primes in a certain form.

Here I have the following conjecture -Let $$S_1(n)= \frac{(n-1)! +1}{n}$$ then there exist infinite prime numbers $p$ for which $S_1(p)$ is prime. And I don't know how to prove it. EDIT Let ...
2
votes
1answer
120 views

Proof on a conjecture involving $d(N)$

Let $d(n)$ denote the number of divisors of $n $. Then let $N$ be a number such that $d(N)$ divides $N$ . Also let $I= \frac{N}{d(N)}$ which is defined as the "Index of Beauty of $N$ ". Then prove ...
1
vote
0answers
139 views

Proving there exists prime numbers between the squares of prime numbers

Conjecture: $\forall $ $p_{n}$, $p_{n+1} \in \mathbb{P}$, $\:$ $p^2_{n+1} = p^2_{n} +\omega_{n} p_{n} + \phi_{n} : \phi_{n} , \omega_{n} \in \mathbb{N} $ and $ \phi_{n} < p_{n}$, $\:$ ...
2
votes
2answers
114 views

Does there exist a prime number within the interval?

Conjecture $\forall p_{n}\in \mathbb{P} : n\geq3, \: \exists p_{m}\in \mathbb{P} : 3p_{n} - 4 \geq p_{m} > \sqrt{2(p^2_{n+1} - 1)} $ How would you go about proving/disproving this?
5
votes
1answer
154 views

A conjecture about the difference between consecutive primes with respect to a prime number squared.

Conjecture If we have two consecutive prime numbers $p_{a}$ and $p_{a+1}$, and two other consecutive primes $p_n$ and $p_{n+1}$, so that $p_{a} < p_{a+1} < p^2_{n+1}$, then $p_{a+1} - ...
1
vote
1answer
127 views

The name and proof of a conjecture on prime intervals

Conjecture: There exists at least one prime number $p_{m}$ : $ap_{n} < p_{m} < (a+1)p_{n}$, $\forall$ $a \in \mathbb{N}$ and $\forall$ $p_{n}$ $\in \mathbb{P} $ if $(a+1)p_{n} < ...
3
votes
1answer
236 views

My conjecture on almost integers.

Here when I was studying almost integers , I made the following conjecture - Let $x$ be a natural number then For sufficiently large $n$ (Natural number) Let $$\Omega=(\sqrt x+\lfloor \sqrt x ...
3
votes
0answers
353 views

Totient summatory function

Let $\Phi(n) = \sum_{k=1}^n \phi(k)$ be the totient summatory function. Here is an interesting conjecture I've made: The ratio $\Phi(n^2)/\Phi(n)$ is an integer only for $n=1,2,3,5$ and $6$. I made a ...
0
votes
2answers
793 views

Checking the Harald Helfgott proof of the little Goldbach conjecture without a public release of numerical checks?

A few month ago, a proof of the little/ternary Goldbach conjecture has been claimed by Harald Helfgott with three articles: Major arcs for Goldbach's theorem Minor arcs for Goldbach's theorem ...
3
votes
1answer
192 views

Weaker Version of “Goldbach's Other Conjecture”

Taken from problem 46 on Project Euler: It was proposed by Christian Goldbach that every odd composite number can be written as the sum of a prime and twice a square. $9 = 7 + 2 \times 1^2$ ...
2
votes
0answers
157 views

Approximation to $\pi(x)$ conjecture.

A friend conjectured that $\left[\prod_{k=1}^{a_j <\sqrt{x}} \left(1-\frac{1}{a_k}\right)\right] x$ is usually closer to $\pi(x)$ than $\operatorname{Li}(x)$ is for some (fixed) sequence of ...
5
votes
4answers
490 views

Erdös-Straus conjecture

I'm reading a lot about the Erdös-Straus Conjecture (ESC), a conjecture that states that for every natural number $p \geq 2$, there exists a set of natural numbers $a, b, c$ , such that the following ...
5
votes
1answer
293 views

Is this number theory conjecture known to be true?

I've been working on proving that there is always a prime between $n$ and $2n$, and also that there is always a prime between $n^2$ and $(n+1)^2$ (Legendre's conjecture). I believe I've proven those ...
1
vote
1answer
278 views

Converse of Collatz Conjecture

How to write a pseudocode program that halts only if the Collatz Conjecture is false. Thanks much in advance!!!
3
votes
0answers
81 views

Prime clasfication by some constructive function

How to prove or justify the following: $$ f(g)= \frac1{1-g^2} \prod_{k=1}^{\infty} \left(\frac{\sin(\pi \frac gk)}{\pi \frac gk} \cdot \frac 1{1-\frac{g^2}{k^2}}\right), $$ The above statment can ...
0
votes
1answer
152 views

Goldbach conjecture and primes

I need some clarification on (1) Is there any proof to say Mersenne primes $M_p$ are finite or infinite? if there, could you share here.. (2) If Goldbach is conjecture is true, how you can justify the ...
0
votes
3answers
113 views

Primes + Inetvel + conjecture on primes

a) Can we establish a proof, there exists infinitely many primes of the form $n^2$ + 1. Why is the unit digit of such a prime p always 1 or 7? Is there any reasonable procedure or concept for the fact ...
7
votes
0answers
258 views

Asymptotic FLT $\implies$FLT using ABC Conjecture

Edit: I'm beginning to suspect I either misread the sources or perhaps something wasn't stated, but it's my guess now that there is no nontrivial way of showing the ABC conjecture implies Fermat's ...
5
votes
1answer
165 views

How to prove the equivalence between the two statements of ABC conjecture?

The ABC conjecture stated by wikipedia says the following statements are equivalent: I. For $\epsilon>0$, there are finite coprime triple $(a,b,c)$ satisfying $a+b=c$ such that ...
1
vote
1answer
59 views

Integer solutions to $2^x+3^y=9^z+8^w+8^t$

currently in number theory is there a method to solve for integer solutions to equations like $2^x+3^y=9^z+8^w+8^t$? For example, $2^{13}+3^6=9^3+8^4+8^4$. (obtained using computer brute force) In ...
14
votes
1answer
320 views

Density of odd numbers in a sequence relating base 2 and base 3 expansion

Define the function $$f(4n)=6n+1\\ f(4n+1)=6n+2\\ f(4n+2)=6n+3\\ f(4n+3)=6n+5$$ and the sequence $u_0=2$, $u_{k+1}=f(u_k)$. Let $d_1\le d_2$ be the lower and upper asymptotic density of odd numbers ...
11
votes
1answer
367 views

The Goldbach Conjecture and Hardy-Littlewood Asymptotic

A source I am reading refers to the Goldbach conjecture (that every even number is the sum of two primes), and then immediately follows with the "Hardy-Littlewood conjecture" that $\sum ...
3
votes
2answers
294 views

Question about the Collatz Conjecture, Nicomachus's Triangle, and more

Using $(3p+1)/2$ starting with $p = 44102911$, we find an ordered set of $8$ primes. By computer, we find that this is the only ordered set of $8$ primes $< 300000000$ primes. The primes: ...
5
votes
1answer
265 views

Does this $\zeta(s)$ identity have a name?

I have generalized the product from this thread: Let $s=2n+1$ for $n\ge1$, $$\zeta (s)=\frac{\zeta (2 s)}{\zeta (2)} \prod _{n=1}^{\infty } \frac{\sum _{i=0}^{s-1}(-p_n){}^i}{(p_{n}-1)p_{n}^{s-2}}$$ ...
6
votes
1answer
408 views

Is it known or new? [duplicate]

Possible Duplicate: Starting digits of 2^n While I was randomly working with number patterns, I came along with some interesting pattern which seems to turn to a conjecture in fact. My ...
4
votes
1answer
208 views

Problems about consecutive semiprimes

I was playing around with semi-prime numbers and I made two conjectures, which are: Given any integer $a$, at least one of $a,(a+1),(a+2)$ or $(a+3)$ is not semi-prime. There are infinitely many ...
3
votes
4answers
724 views

Goldbach conjecture

I have seen the following in my observation. I am so sorry, if I am wrong. I do not know how far I am right. But, I feel that, it might be correct. If correct, Please let me know that way to proceed ...
1
vote
2answers
388 views

twin prime conjecture

Whether I am correct or wrong I don't know. If there are any corrections, please let me know. Let $p_n$ = product of all primes. (of course we can go still beyond as we know $p_n$ is infinite). Now ...
16
votes
3answers
583 views

Interesting Property of Numbers in English

I was playing with the letters in numbers written in English and I found something quite funny. I found that if you count the number of letters in the number and write this as a number and then count ...
-1
votes
1answer
270 views

Number theory conjecture [closed]

Let us observe the following pattern $N - p_1 = m_1, N - p_2 = m_2, \ldots , N - p_r = m_r$; take $p_1 = 3$ and $p_2 = 5,\ldots$ notice that $p_r$ is the larger prime less than or equal to square ...
2
votes
2answers
377 views

If $a$ is even and $b$ is odd then $\gcd(2^{a}+1,2^{b}+1)=1$

How to prove that: If $a$ is even and $b$ is odd then $\gcd(2^{a}+1,2^{b}+1)=1$ This statement is generalization of the statement from my previous question. I have checked for many $(a,b)$ ...