Questions on problems that have yet to be completely solved by current mathematical methods.

learn more… | top users | synonyms

3
votes
0answers
62 views

Up to which value is Rassias' conjecture verified?

I came across this conjecture: Rassias' conjecture Up to which $p$ has this conjecture be verified ? Are there intermediate results related to this conjecture ? The conjecture can be ...
3
votes
0answers
63 views

Open problems in Banach spaces? universal spaces

I have gathered a list of universality problems in Banach spaces which have been solved: The non existence of a separable reflexive space universal for the class of separable reflexive spaces. If a ...
3
votes
0answers
34 views

<Reference Request> Research done on whether the Euler prime can be the largest factor of an odd perfect number

(Note: This has been cross-posted to MO.) Good day! I would like to request for references to research done as to whether the Euler prime of an odd perfect number can also be its largest factor. ...
3
votes
0answers
85 views

Maximal abelian subalgebras of SAW*-algebras

Pedersen distilled the following class of C*-algebras which he termed SAW*-algebras: A C*-algebra $A$ is an SAW*-algebra if for each pair of orthogonal, positive elements $x,y\in A$, there exists a ...
3
votes
1answer
178 views

What are the big issues in modern graph theory?

This is inspired by the similar question on modern set theory. I've read through the open problems in graph theory on Wikipedia's list of unsolved problems in mathematics, but what I'm looking for is ...
3
votes
0answers
126 views

When is a number like “ddd…ddd”+1 (where d is a digit) a perfect square or a prime?

Inspired by Is the number $333, 333, 333, 333, 333, 333, 333, 333, 334$ a perfect square?, I wonder when numbers like these are perfect squares. Certainly, all numbers of the form $000...0001$ are ...
3
votes
0answers
228 views

A question about odd perfect numbers

Edit [in response to a comment from anon]: Hereinafter, $N$ is a positive integer, $\sigma(N)$ is the sum-of-divisors of $N$, $\omega(N)$ is the number of distinct prime factors of $N$, and ...
3
votes
0answers
209 views

An open problem on general topology

There is an open problem in this paper: J. van Mill, V.V. Tkachuk, R.G. Wilson, "Classes defined by stars and neighbourhood assignments", Topology and its Applications, Vol. 154, Issue 10, 2007, pp. ...
3
votes
0answers
121 views

Polyonimo Tiling

I came up with the following conjecture the other day, and was wondering if the result was well-known or even true: Define $f(P)$ for a polyomino $P$ (without holes) to be the least number of total ...
3
votes
0answers
272 views

Invariant Subspace Problem

Louis de Branges had a paper on his homepage claiming a solution for the Invariant Subspace Problem. But I don't see that paper anymore, though he still has a "proof" of Riemann Hypothesis on his ...
2
votes
2answers
249 views

Triplets based equation

Let $p \ge 7$ be a prime number. Find the triples $(x, y, z)$ in $\mathbb{Z}$ such as $xyz$ is not equal to zero, $\gcd (x, y, z) = 1$ and $x^p + 2y^p = z^2$. I want triplets and proof/generalization. ...
2
votes
1answer
93 views

Are there infinitely many semi primes of the form $x^2 + 2x$ for integral $x$?

My professor showed the class 1000 dollars and said he'd give it to whoever could prove it... Obviously he's not serious but in having a tough time wrestling with this problem.
2
votes
1answer
352 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 ...
2
votes
1answer
74 views

Groups $\pi$ with $K(\pi, 1)$ a finite CW-complex

For what (say, finitely generated) groups $\pi$ is $K(\pi, 1)$ a finite CW-complex? Such a group must necessarily be torsion-free, since otherwise $H^*K(\pi, 1) = H^* \pi$ would be nontrivial in ...
2
votes
2answers
115 views

State of art of prime numbers distribution [closed]

I was reading some questions about prime numbers posted in latest days and a question came to my mind: What is the state of art of the research into prime numbers distribution? I read then ...
2
votes
1answer
27 views

Measure of convex hulls

I'm not an expert of this kind of questions, but I can't give a satisfactory answer to the following question. Pick $x_1\dots x_n \in \mathbb{R}^m$. Is there a formula for the measure of the ...
2
votes
1answer
51 views

open problems regarding functions

I am looking for some open problems regarding functions. Problems like, Whether a function satisfying some properties say, X,Y,Z, exists or not, is unknown. Like there is no function $f(x)$ such ...
2
votes
1answer
101 views

two questions about primes

I'm very ignorant about results in number theory concerning the primes. Please let me know if these are open conjectures or easy problems: There are infinitely many primes of the form $n!+1$ There ...
2
votes
2answers
135 views

Coding Forcing Notions by Ordinal Numbers: A Possible Approach to Shelah-Foreman-Magidor Conjecture

Forcing notions are partial orders. In some sense each partial order is a "combination" of some well-orderings and each well-orderings is isomorphic to a unique ordinal number. Thus in some sense a ...
2
votes
1answer
98 views

Improving the bound $q < n\sqrt{3}$ for an odd perfect number $N = {q^k}{n^2}$ given in Eulerian form

(Note: This has been cross-posted to MO.) Let $N = {q^k}{n^2}$ be an odd perfect number given in Eulerian form (i.e., $q$ is prime with $q \equiv k \equiv 1 \pmod 4$ and $\gcd(q, n) = 1$). ...
2
votes
0answers
148 views

On the indivisibility of odd perfect numbers by small numbers

A good day to everyone! This question is an offshoot of the following MSE posts: Odd perfect number divisors Can an odd perfect number be divisible by $101$? My question is as follows: Is ...
2
votes
0answers
67 views

What do we know about Sorli's Conjecture and Odd Perfect Numbers?

I have seen that Jose Arnaldo Dris has recently published a great deal of literature concerning odd perfect numbers and Sorli's Conjecture. He claims that the truth of Sorli's conjecture implies that ...
2
votes
0answers
63 views

Apery's constant

I read that it is unknown if $\zeta (3)$ is algebraic but it is known to be irrational. Has anyone proved anything of the form $\zeta (3)$ is not a root of a polynomial of degree $12345$ with integer ...
2
votes
0answers
110 views

Are there infinitely many primes $p_k$ such that $(p_k-1)!+p_k$ is a also prime?

I am wondering whether there are infinitely many primes $p_k$ such that $(p_k-1)!+p_k$ is also prime. Given that $p_k \equiv 2 \pmod 3$. For a very large prime, I can assume Stirling's ...
2
votes
0answers
248 views

Open problems with practical outcome in a visible future?

[Note] The question has been asked at Matheoverflow. But there is no answers. I believe that any non-trivial idea will sooner or later find application in real life. However "sooner" is better than ...
1
vote
1answer
247 views

Would this proof strategy work for proving the lonely runner conjecture?

The problem is the lonely runner conjecture. This conjecture states that if $k$ runners begin running down a circle of unit circumference with random speeds, it will always the case that all runners ...
1
vote
1answer
279 views

What is this variation of the traveling salesman problem called?

I've encountered a description of a well-known, hard to compute problem. Let us consider $n$ sites that need to be connected in the shortest possible way. If I am only allowed to connect the sites I ...
1
vote
2answers
113 views

How can I solve this problem without having to do it by hand?

I'm dealing with the following problem in computational programming. I'm trying to find a way to build an algorithm that can quickly resolve the following problem statement without forcing me to do it ...
1
vote
2answers
104 views

Is there any way to solve this problem without having to do it by hand? [duplicate]

I'm dealing with the following problem in computational programming. I'm trying to find a way to build an algorithm that can quickly resolve the following problem statement. Is there any way to group ...
1
vote
1answer
38 views

4-Color Theorem question - is the set of 4-vertex-colorings of a planar graph closed under Kempe switching?

A $4$-vertex-colored planar graph $G$ is a planar graph $G \overset{\text{def}}{=} (V, E, C)$ where $V$ and $E$ are as usual and $C$ consists of pairs $(v \in V, c \in \{1,\dots,4\})$ such that ...
1
vote
1answer
214 views

Collatz conjecture and related problems - mathematical machinery

Collatz conjecture stands as an open problem. That leads me to believe that the conjecture cannot be resolved by elementary means. Which brings me to my question: What techniques/machinery from ...
1
vote
1answer
303 views

Cube nets hexomino tilings.

I am looking for an ~12x12 rectangle (small holes and small obtrusions are okay) made entirely of cube net hexominos. It is my understanding that perfect rectangles, in general, are not possible ...
1
vote
1answer
62 views

Does proving the following statement equate to proving the twin prime conjecture?

After some research, I found that it has been supposedly proven, that proving that there exists an infinite number of positive integers K such that; $K \neq 6ab \pm a \pm b$ and $K \neq 6ab \mp a ...
1
vote
3answers
500 views

Tiling with polyominos

How to prove or disprove that if a polyomino tiles the plane, it must also be able to perfectly tile some larger polyomino, which also tiles the plane? A polyomino is finite set of unit squares ...
1
vote
0answers
44 views

Estimates for the Dedekind number $M(9)$

The Dedekind number $M(n)$ is the number of antichains in the partial order of subsets of $\{1,\dotsc,n\}$. It is only known for $0 \leq n \leq 8$. Question. What are some known upper and lower ...
1
vote
0answers
36 views

Covering unit square

Now, I am reading this topic http://mathoverflow.net/questions/34145/can-we-cover-the-unit-square-by-these-rectangles. And do some research on it. Guys, who had written in topics, have said, that they ...
1
vote
1answer
31 views

Integers $n\geq 2$ such that there is an integer $k>1$ that divides both $n$ and $(n/k)+1$

I apologize to edit this question to request suggestions in this case for study on a sequence starting, $n\geq 2$ such that there is an integer $k>1$ that divides both $n$ and $(n/k)+1$, because it ...
1
vote
1answer
75 views

What does the Grothendieck's period conjecture mean?

I would like to know how is the Grothendieck's period conjecture about algebraic cycles, defined explicitly ? and, what link has it with the Hodge conjecture for smooth complexe algebraic projective ...
1
vote
0answers
54 views

On $p^{\log_q n}$, where $p$ and $q$ are distinct primes

Let $p,q$ be distinct primes, $n>1$ an integer with $\log_q n $ irrational. It was, and probably still is, a conjecture that $p^{\log_q n}$ is non-integer. What progress has been made towards it?
1
vote
0answers
65 views

Open problems for which all cases except one have been solved

Keller's conjecture states that in any tiling of Euclidean $n$-space by identical hypercubes there are two cubes that meet face to face. The conjecture has been shown to be true for $n<7$ and ...
1
vote
1answer
55 views

Sum on digits of powers of two is not too large

Is the following proved: Are there infinitely many positive integers $m$ and an integer $n$ such that sum of digits of $2^m$ is at most $n$?
1
vote
0answers
137 views

Research Topics Needed

This coming academic year a professor has asked me to find some topics that I wish to pursue to write about. The problem/topic that will be discussed doesn't have to be open, but my trouble is that I ...
1
vote
0answers
28 views

Why the proof of Catalan's conjecture is not easily generalizable?

Let $x,y>0$, $u,v>1$ be integers. Why is it easier to solve $x^u-y^v=1$ than $x^u-y^v=2$? Is there possible some group behind the first equation which has some nice property that the group made ...
1
vote
1answer
99 views

Can one prove a special case of Goldbach conjecture without constructing primes?

I know that sometimes in mathematics one can prove that there exist something without constructing it. I was thinking whether one can show if $2^{57885162}$ is a sum of two primes by any reasoning. ...
1
vote
0answers
74 views

$q\sin q$ is small

I read from the book "Which Way did the Bicycle Go" that it is unknown whether for every $c>0$ there are infinitely many integers $n$ such that $|n\sin n|<c.$ Let $\mathbb{Q}_{m}$ be the set ...
1
vote
0answers
244 views

Can an odd perfect number be divisible by 101?

Preamble - This question is an offshoot from the following earlier questions here at MSE: Can an odd perfect number be divisible by 825? Can an odd perfect number be divisible by 165? Odd perfect ...
1
vote
2answers
153 views

A Problem on Time Complexity of Algorithms

I want no know if the following problem is solved or not, or how can I solve it? Problem: For every integer $t$, Is there any problem that can be verified in $O(n^{s})$ but its solution can be found ...
1
vote
0answers
87 views

Is the Hilbert-Smith conjecture still unsolved?

Conjecture Let $G$ be a locally compact topological group. If $G$ has a continuous faithful group action on an $n$-manifold, then $G$ is a Lie group. Is this conjecture still unsolved? Is ...
1
vote
0answers
54 views

Strict positivity on the diagonal of a particular integral kernel: A question from Simon's Schrödinger Semigroups

This is a question pertaining to a (formerly?) open question from Barry Simon's Schrödinger Semigroups. In Theorem C.5.2 (page 504) of that publication, the existence of a specific function ...
1
vote
0answers
141 views

Panel structure on epi F**

It is known that, generically, the convex hull of a hypersurface embedded in $\mathbb{R}^n$ has a panel structure of simplices. Of course one can construct embeddings where this is not the case, but ...