Use this tag if your question is about a well-known conjecture or a conjecture of your own.

learn more… | top users | synonyms

2
votes
1answer
30 views

Sum involving the number of zeros of $k$

I'm currently interested in sums involving digit-functions. Especially, I'd like to calculate the following sum: $$ s=\sum_{k=1}^{\infty}{\frac{a_0(k)}{k\left(k+1\right)}} $$ Where $a_0(k)$ is the ...
8
votes
5answers
184 views

The maximal size of between $\varphi(n)$ divided by $\lambda(n)$.

I want to find $$f(n) = \max\left\{\frac{\varphi(k)}{\lambda(k)} : 1 \leq k \leq n\right\}$$ In other words, I want to find the maximal value of $\frac{\varphi(k)}{\lambda(k)}$ when $k$ is ...
35
votes
3answers
594 views
+200

Prove that there exist infinitely many integers $(n^{2015}+1)\mid n!$

I conjecture that there exist infinitely many integers $n$ such that $$(n^{2015}+1)\mid n!.$$ I have seen a simpler problem that there exist infinitely many integers $n$ such that $(n^2+1)\mid ...
8
votes
0answers
85 views

A conjectured identity for tetralogarithms $\operatorname{Li}_4$

I experimentally discovered (using PSLQ) the following conjectured tetralogarithm identity: $$\begin{align}&\phantom{+\;}19\!\;\pi^4-570\ln^42-90\ln^43\\ ...
4
votes
1answer
127 views

Euler's totient and divisors count function relationship when $[(\frac{\varphi(n)}{2}+1)\cdot(\frac{\tau(n)}{2}+1)] = n$

I am studying the Euler's totient function $\varphi(n)$ and the divisors count function, $\tau(n)$, also named $d(n)$, and recently opened a question (link here) about the following condition: ...
1
vote
0answers
24 views

The asymptotic behaviour of triples $n!+q^{n!}=c$, where $q$ is the first prime greater than $n$, and abc conjecture

For a large positive integer $n$, let $q=q(n)$ (below we denote this $q=q(n)$ by $q_{N}$ because we assumed that is the $N$-th prime number) the first prime number which is (strictly) greater that ...
2
votes
0answers
48 views

Beal Conjecture and ($\bmod 3$) operation [closed]

When we apply a ($\bmod 3$) operation on the $A^x +B^y =C^z$ we will see some strange results. For e.g.: Let $A=6m+1$ & $B=6n+1$. Since $A$ & $B$ are odd numbers, $C$ will have to be even. ...
1
vote
0answers
33 views

Consequences of the Carathéodory conjecture

This is a very stupid question. What are consequences and applications of the Carathéodory conjecture? It seems to me interesting, but completely useless.
1
vote
0answers
33 views

Inequality in 3 variables (conjecture)

Let $a, b, c$ be nonnegative real numbers such that $a+b+c=3$. If $0<k\leq 3+2\sqrt{3}$, then $$\frac{a}{b^2+k}+\frac{b}{c^2+k}+\frac{c}{a^2+k}\geq \frac{3}{1+k}$$ If $k=3+2\sqrt{3}$, then equality ...
6
votes
0answers
176 views

Does the set of $m \in Max(ord_n(k))$ for every $n$ without primitive roots contain a pair of primes $p_1+p_2=n$?

I have made the following observation: for those n even numbers that do not have primitive roots modulo n ,$Pr(n)$, the set $M(n)$ of those $k$ having a maximum multiplicative order $ord_n(k)$ ...
2
votes
3answers
176 views

How can I know if my conjecture is not lacking mathematical formality? [closed]

I'm a teenager and student who came up with his own conjecture. Because I'm not a mathematician and I haven't got the knowledge yet, I would like to know if my conjecture doesn't exceed the limits of ...
128
votes
1answer
7k views

A variation of Fermat's little theorem

Fermat's little theorem states that for $n$ prime, $$ a^n \equiv a \pmod{n}. $$ The values of $n$ for which this holds are the primes and the Carmichael numbers. If we modify the congruence ...
5
votes
0answers
48 views

What steps have been taken so far to solve Brocard's Problem?

The equation is $$n!+1=m^2$$ where $n$ and $m$ are natural numbers. Brocard's Problem asks whether there are solutions for n other than $4, 5, 7$. The only improvement I have found that people have ...
77
votes
23answers
2k views

Open mathematical questions for which we really, really have no idea what the answer is

There is no shortage of open problems in mathematics. While a formal proof for any of them remains elusive, with the "yes/no" questions among them mathematicians are typically not working in both ...
13
votes
2answers
173 views

Prove that $\lim_{n\rightarrow \infty} \frac{\log_{10}\lfloor\text{Denominator of } H_{10^n}\rfloor+1 }{10^n}=\log_{10} e$

In short, my question is asking to prove that the $$\lim_{n\to\infty}\frac{\text{number of digits in the denominator of} \sum_{k=1}^{10^n} \frac 1k}{10^n}=\log_{10} e$$ I know that the number of ...
8
votes
1answer
109 views

Question regarding the status of Erdős' conjectures

Has Erdős' conjecture on arithmetic progressions or his conjecture on Sylvester's sequence been proven?
6
votes
1answer
36 views

Where $ax + b$ prime infinitely often, is $ax + b - 2$ semiprime at least once?

I'm trying to figure out a way to prove this: Given arithmetic progression $ax + b$ where $a$, $b$ coprime and $ax + b$ is prime infinitely often, it is the case at least once that $ax + b - 2$ is ...
1
vote
2answers
110 views

What do you think about this conjecture?

Beforehand, please know that I'm a little bit of an amateur mathemitician, so this could be very wrong. But, I have tested it over and over and over again and it seems to be plausible, but there's ...
3
votes
2answers
58 views

Conjectured diagonal Ramsey numbers

While doing some reading on the Wikipedia page for Ramsey numbers, I stumbled upon OEIS sequence A120414, which lists the allegedly conjectured values of the diagonal Ramsey numbers $R(n,n)$. I ...
1
vote
0answers
25 views

Is the conjecture $Per A $ is the largest eigenvalue of $\tilde{A}$ being solved?

Let A be a positive semidefinite matrix of order $n$. Is the conjecture $Per A $ is the largest eigenvalue of $\tilde{A}$ is being solved? Where $\tilde{A}$ is the matrix of order $n!\times ...
2
votes
3answers
62 views

Conjecture about linear diophantine equations

I've been dabbling with linear Diophantine equations and came across a rather interesting pattern that I would like to conjecture as true but I have no idea how about to come up with a proof. Let ...
3
votes
0answers
116 views

Very tentative proof of Beal's Conjecture?

I'm a high school student, so please point out my mistakes nicely and in layman's terms :) Thanks! Ok. Beal's Conjecture: If $$a^x+b^y=c^z$$ where $a$, $b$, $c$, $x$, $y$, $z$ are whole numbers; $x, ...
-2
votes
1answer
332 views

Is this attempted proof of ABC conjecture correct [closed]

This mathematician claims that he has tackled ABC conjecture! He uses induction and simple inequalities to achieve the result. Is this some serious stuff or is there a basic flaw in the reasoning?
3
votes
1answer
69 views

Why are there so many conjectures in number theory and comparatively less in others?

My question is that : Why are there so many conjectures in elementary number theory and comparatively less in others? This is particularly weird because every topic in maths should have its equal ...
1
vote
0answers
56 views

How I can make a proof to this conjecture if it is possible?

Is there someone who can show me the way helping me to proof this conjecture. If it's not open, at a least show me links or papers which to be helpful. Conjecture: Assume $c > 0$ and that an ...
1
vote
0answers
27 views

A question and a conjecture on $USp(N)$ group

$USp(N)$ with $N$ an even integer is defined as the group of unitary matrices $M$ that satisfy $M^TJM=J$, where $M^T$ is the transpose of $M$ and $J$ is the anti-symmetric $N$-by-$N$ matrix ...
15
votes
2answers
422 views

Euler's Totient function $\forall n\ge3$, if $(\frac{\varphi(n)}{2}+1)\ \mid\ n\ $ then $\frac{\varphi(n)}{2}+1$ is prime

While I was studying Euler's Totient function, $\varphi(n)$, I stumbled upon the marvelous book "Index to Mathematical Problems, 1980-1984" By Stanley Rabinowitz. In this page of the book (link to ...
4
votes
1answer
114 views

Conjecture about the product of the primitive roots modulo a prime number ($\prod Pr_p$)

While I was learning about the primitive roots modulo $p \in \Bbb P$ (I will call $Pr_p$ to the complete list of the primitive roots module $p$) and having in mind the conjecture explained in this ...
4
votes
2answers
65 views

Conjecture: only one even Fibonacci term divided by two gives a prime: $F(9) = 34 = 2 \times 17$

Every Fibonacci term $F(3n)$ is divisible by two $F(3) = 2$ $F(6) = 8$ $F(9) = 34$ $...$ After seeking Fibonacci tables factorization until $F(10000)$, for every term $\frac{F(3n)}{2}$, it ...
9
votes
2answers
237 views

Yet another conjecture about primes

Let $\mathcal{N}(n)$ be the next prime greater than $n$. Conjecture: $\mathcal{N}(n!)-n!\:$ is either $1$ or a prime. It holds for n=1 to 99 and the expression is 1 for 3,11,27,37,41,73,77 and ...
2
votes
3answers
64 views

Why is it that if you square two prime numbers and add them, you get a number that is even and is not a perfect square?

If you do $x^2 + y^2 = n$ where $x$ and $y$ are both prime numbers and are both greater than $3$, why is $n$ always an even number that isn't a perfect square?
6
votes
2answers
88 views

The conjecture that no triangle has rational sides, medians and altitudes

I have found a conjecture that there is no triangle whose sides, medians, altitudes and area are all rational. I figure that someone must have already found such a triangle if one existed and yet I ...
3
votes
3answers
597 views

Result of solving an unsolved problem?

I was mulling over currently unsolved problems in mathematics (as I, and many others, find them quite interesting) and began to wonder what would happen if these problems were to be solved. I know ...
2
votes
2answers
27 views

Algorithmic procedure to establish the possibility of finding a proof of a conjencture

I was always puzzled by these conjectures which can be stated quite simply, yet finding a proper proof is a monumental task even for the most brilliant mathematicians . Consider the following ...
18
votes
1answer
295 views

Is $K\left(\frac{\sqrt{2-\sqrt3}}2\right)\stackrel?=\frac{\Gamma\left(\frac16\right)\Gamma\left(\frac13\right)}{4\ \sqrt[4]3\ \sqrt\pi}$

Working on this conjecture, I found its corollary, which is also supported by numeric caclulations up to at least $10^5$ decimal digits: ...
2
votes
2answers
489 views

Tangent at average of two roots of cubic with one real and two complex roots

I was able to easily prove that the tangent at the average of two roots of a real cubic polynomial passed through the third root of the function. But I have only done this for functions with three ...
7
votes
2answers
368 views

About the hyperplane conjecture.

I have recently heard about the hyperplane conjecture and I would like to understand better the problematic behind this conjecture. The hyperplane conjecture: There exists a universal constant ...
1
vote
2answers
36 views

Prove that $\det(A) \cdot v \, A^{-1} = \det(A+uv) \cdot v \, (A+uv)^{-1}$.

Let $A$ be a $n \times n$ matrix, $u$ a $n \times 1$ matrix and $v$ a $1 \times n$ matrix. If $A$ and $(A+uv)$ are invertible, prove that $$ \det(A) \cdot v \, A^{-1} = \det(A+uv) \cdot v \, ...
1
vote
1answer
54 views

Euler's Totient function $\forall n\ge3$, if $(n-\phi(n)) = \sqrt{n}\ $,$\ $then $(n-\phi(n)) \in \Bbb P$

Recently I opened a question about what it might be a new property of Euler's Totient function. I am still studying the Totient function and I found another interesting relationship, it is very ...
4
votes
3answers
91 views

Given an odd $x$ there is an $m,n$ such that $2^n + 1 = 3^m x$?

I'm curious about this question: Is it true that for any odd number $x\in 2\mathbb N + 1$ there exists numbers $m,n\in \mathbb N \cup \{0\}$ such that $$2^n+1 = 3^mx$$ Edit: I'm not trying to make ...
0
votes
1answer
35 views

Binary Representation of the Collatz Conjecture

What is the benefit of looking at the binary representation of the collatz conjecture. I know that it makes the computation easier because there is really one operation involved which is multiplying ...
21
votes
3answers
453 views

An integral $\int_0^\infty P_s(x-1)\,e^{-x}\,dx$ involving Legendre functions

Let $P_s(x)$ denote the Legendre functions of the $1^{st}$ kind, i.e. the Legendre polynomial generalized to an arbitrary (not necessarily integer) order $s$. It can be expressed using the ...
7
votes
2answers
297 views

Trying mathematical induction with $3n+1$ conjecture

Collatz's Conjecture is also known as the $3n+1$ conjecture. Well I thought since the conjecture is dealing with natural numbers so we might as well try mathematical induction and see why it doesn't ...
0
votes
1answer
74 views

A question about the $3n+1$ conjecture

So I know that if you take any even number $n$ that is a power of $2$ like $32 = 2^5,16=2^4$ or $64=2^6$ we will keep dividing by 2 until we reach 1. and so all the steps will be $\frac{n}{2}$ and we ...
2
votes
2answers
68 views

Can I demonstrate a proposition without a rigorous proof?

Writing a paper, I want to declare a certain proposition, but is only supported by other research's empirical result. In this sort of case, what can I name to my argument in my paper? CONJECTURE is so ...
1
vote
1answer
57 views

Asymptotic behavior of the zeros of the digamma function

The gamma function has just one extremum on each interval $(k,k+1)$, where $k$ is a negative integer. These extrema occur at the zeros of the derivative of the gamma function. Let $z_n$ denote the ...
6
votes
1answer
138 views

Power towers of $2$ and $3$ - looking for a proof

Let $\uparrow$ denote the right-associative exponentiation operator: $a\uparrow b\uparrow c=a\uparrow(b\uparrow c)=a^{b^c}$ There is a sequence $A248907$ recently submitted to OEIS (see also ...
0
votes
1answer
24 views

Prove conjecture using premises

I have three premises with me defined: $(B \land L) \implies A$ $(A \land D) \implies \lnot H$ $\lnot J \implies (D \land \lnot H)$ I need to prove the following conjecture with the help ...
0
votes
1answer
98 views

Legendre's Conjecture!

This is my last attempt to the Legendre's Conjecture: based on my first one, it's not that difficult to follow, I'm not using logical manipulation or something like this, it's all about inequalities ...
0
votes
0answers
29 views

Addressing a conjecture with different “strengths”

I plan on writing a conjecture in a publication I am developing. However, the conjecture has different "strengths" to it, take this example: Conjecture 1.1. $\exists a$, such that $a$ is a solution ...