4
votes
1answer
425 views

What keeps asymptotic Goldbach's conjecture out of reach of current technology?

Despite the rather recent progress in prime number theory (see the proof of the ternary Goldbach conjecture by H.A. Helfgott, and the striking result of Yitang Zhang improved by Tao, Maynard and ...
6
votes
3answers
801 views

Objections to and arguments for the simplicity of all Riemann zeros

It seems to be that the simplicity of all the zeros is quite widely accepted as a working hypotheses, and it is known that a positive proportion are as such. Titchmarsh explains in the last chapter ...
17
votes
2answers
703 views

Floors of rationals to powers: Infinite number of primes?

Let $r=a/b$ be a rational number in lowest terms, larger than $1$, and not an integer (so $b > 1$). Q. Does the sequence $$ \lfloor r \rfloor, \lfloor r^2 \rfloor, \lfloor r^3 \rfloor, ...
6
votes
4answers
1k views

Interactions of number theoretic conjectures and other fields of mathematics

There are many interesting open conjectures in number theory. My question is not about partial results or possible ways to prove them. It is about their interactions with the other fields of ...
1
vote
1answer
238 views

Any results towards the irrationality of the sum of reciprocals of perfect numbers? [closed]

This question is a follow up to my comment to Sum of the reciprocal of perfect numbers. I would like to know which results have been published about the possible irrationality of the sum of ...
16
votes
1answer
570 views

A Question on 1, 2 ,3 Conjecture

1, 2, 3 conjecture is well-known: If $G$ is a simple graph which is not $K_2$ then one can assign a number among $1, 2, 3$ to every edge such that if we label each vertex with the sum of the numbers ...
10
votes
0answers
688 views

Is $\varliminf_{n \rightarrow +\infty} |n \sin n| = 0$ correct, where $n$ is an integer?

Is it true that $\varliminf_{n \rightarrow +\infty} |n \sin n| = 0$, where $n$ runs over the integers? The existence of the limes inferior follows from Dirichlet's approximation theorem, but the ...
3
votes
4answers
626 views

Product of exponents of prime factorization

Let $p(n)$ be the product of the exponents of the prime factorization of $n$. For example, $$p(5184) = p(2^6 3^4) = 24 \;,$$ $$p(65536) = p(2^{16}) = 16 \;.$$ Define $P(n)$ as the number of iterations ...
2
votes
0answers
118 views

What are the divisors of $2n^2 - \sigma_{1}(n^2)$ for composite $n$?

What are the divisors of $2n^2 - \sigma_{1}(n^2)$ for composite $n$? Here, $\sigma_{1}$ is the classical sum-of-divisors function. For example, $\sigma_{1}(3^2) = 1 + 3 + {3^2} = 13$. (The function ...
1
vote
0answers
189 views

Can six square numbers be simultaneously represented in a single sum of consecutive odd numbers? [closed]

I had some free time from my work to do a little exploration regarding the existence (or non existence) of perfect cuboids. A solution is represented by the set of Diophantine equations: $a^2 + b^2 = ...
9
votes
1answer
492 views

A conjecture by Euler about $8n+3$

Euler's conjecture: For any positive integer $n$, $8n+3$ can be represented as a sum $$8n+3=(2k-1)^2+2p,$$ where $k$ is a positive integer, and $p$ is a prime. I want to know whether there has been ...
1
vote
0answers
168 views

Counting factors: is this approach in the literature on multiperfect numbers?

Does the following approach (or something near it) exist in the number theory literature? I will provide some motivation for $\omega(p^n - 1)$ as $n \rightarrow \infty$ and for this question. First, ...
12
votes
2answers
1k views

Distinctive property of the primes 17 and 19?

Consider the question whether it is true that a prime number $p$ divides $1^1+2^2+3^3+....+(p-1)^{p-1}$ if and only if $p \in \{17,19\}$. For the obvious heuristic reasons, for large $n$ one would ...
1
vote
1answer
484 views

Collatz conjecture— finite state machine transducer construction, origination?

wikipedia has an entry on the Collatz conjecture with a section on As an abstract machine that computes in base two. this apparently describes a construction of a FSM transducer computing sequential ...
6
votes
0answers
332 views

How many values a polynomial map misses?

Let $F$ be a field. For a uni-variate polynomial $f(x)$ over $F$,let $M_f(F)$ denote the number of values that $f$ misses, that is, the cardinality of the subset $F - f(F)$ in $F$. Assume that $f$ is ...
46
votes
1answer
2k views

A function whose fixed points are the primes

If $a(n) = (\text{largest proper divisor of } n)$, let $f:\mathbb{N} \setminus \{ 0,1\} \to \mathbb{N}$ be defined by $f(n) = n+a(n)-1$. For instance, $f(100)=100+50-1=149$. Clearly the fixed points ...
10
votes
1answer
450 views

Are Galois groups of Q with restricted ramification supposed to be finitely generated?

Fix a finite set $S$ of places of $\mathbb Q$. Let $G_{\mathbb Q,S}$ be the Galois group of the maximal extension of $\mathbb Q$ unramified outside S$. I believe that it is an open question whether ...
4
votes
2answers
676 views

Kronecker's Jugendtraum for real quadratic fields?

Kronecker's Jugendtraum (or Hilbert's 12'th problem) is to find abelian extensions of arbitrary number fields by adjoining `special' values of transcendental functions. The Kronecker-Weber theorem was ...
9
votes
1answer
603 views

The Class Number One Problem for Real Quadratic Fields

An approach to the Gauß class number one problem for imaginary quadratic fields is to determine the integral points on the modular curve $Y_{nonsplit}(n)$ for a suitable $n$. Here follows a quick ...
1
vote
1answer
516 views

A question concerns prime numbers

I have arrived to this conjecture in my work, I am not sure that is true or false. So I would appreciate if someone give a counterexample or prove it. My question: Let n be a non-prime such that n-1 ...
17
votes
1answer
717 views

Does smooth and proper over $\mathbb Z$ imply rational?

Does smooth and proper over $\mathbb Z$ imply rational? I think someone told me that this is a standard conjecture. Is it a widely held? held at all? Did someone in particular make this conjecture? ...
11
votes
2answers
644 views

Interesting result on the Euler-Maschroni constant - what is the background?

Today I entered the following expression in maple: $$a_i = H_{10^i} - ln(10^i) - \gamma$$ Here $H_j$ equals $\sum_{k=1}^{j} 1/k$ and $\gamma$ is the Euler-Mascheroni constant. When I computed $a_n$ ...
-1
votes
1answer
2k views

On Odd Perfect Numbers

Hi all. My question today will be regarding what I consider to be a "stumbling block" while trying to research odd perfect numbers. Let $N = {q^k}{n^2}$ be an odd perfect number with Euler prime ...
1
vote
0answers
386 views

Reference Request - Jakob Weisblat's “The Search for the Odd Perfect Number” [closed]

Hi All! I am currently trying to locate an online copy of Jakob Weisblat's paper titled "The Search for the Odd Perfect Number". I could only get hold of the abstract: "A perfect number is a number ...
-1
votes
1answer
598 views

Question Re: Arian Berdellima's Papers On Odd Perfect Numbers [closed]

Hi everyone. I'd like to refer you to two papers by Arian Berdellima on odd perfect numbers: More Properties About Odd Perfect Numbers http://mpra.ub.uni-muenchen.de/31587/1/MPRA_paper_31587.pdf ...
11
votes
4answers
8k views

The Ramanujan Problems.

I originally thought of asking this question at the Mathematics Stackexchange, but then I decided that I'd have a better chance of a good discussion here. In the Wikipedia page on Ramanujan, there is ...
4
votes
1answer
352 views

A question concerning products of finite cyclic groups

Let $m_1,\ldots, m_n$ be pairwise coprime natural numbers $\geq 1$. We consider the product $$G(m_1,\ldots,m_n) := \prod_{i=1}^{n} \mathbb{Z} / m_i \mathbb{Z}.$$ We define $M(n)$ as the set $n$-tuple ...
19
votes
3answers
4k views

Are nontrivial integer solutions known for $x^3+y^3+z^3=3$?

The Diophantine equation $$x^3+y^3+z^3=3$$ has four easy integer solutions: $(1,1,1)$ and the three permutations of $(4,4,-5)$. Elsenhans and Jahnel wrote in 2007 that these were all the solutions ...
0
votes
2answers
505 views

A simple question regarding the sum-of-divisors function

A good day to everyone. Consider the following "Conjecture": If $a, b \in M \subset \mathbb{N}$, then $1 < a < b$ and ... [plus some more conditions on $a, b$ and $M$...] if and only if ...
0
votes
1answer
359 views

Existence of Solutions to an Equation Involving the Sum-of-Divisors Function [Reference Request]

Let $\sigma(x) = \sigma_1(x)$ denote the sum of all the positive divisors of $x$. If $n \in \mathbb{N}$ is odd and $\gcd(n, \sigma(n)) = 1$, then do there exist any solutions to the following ...
0
votes
1answer
341 views

Something new in old question about sums of three polynomial cubes ?

An old problem asks whether or not the polynomial $$ t \in \mathbb{Q}[t] $$ is a sum of three cubes, (of polynomials in $\mathbb{Q}[t]$). Question: Something new known now ? Somebody has an idea of ...
17
votes
2answers
1k views

unboundedness of number of integral points on elliptic curves?

If $E/\mathbf{Q}$ is an elliptic curve and we put it into minimal Weierstrass form, we can count how many integral points it has. A theorem of Siegel tells us that this number $n(E)$ is finite, and ...
6
votes
0answers
252 views

Real approximation for homogeneous spaces of linear algebraic groups

Let $X$ be a smooth geometrically integral variety over $\mathbf{Q}$, having a $\mathbf{Q}$-point. We say that $X$ has the real approximation property if $X(\mathbf{Q})$ is dense in $X(\mathbf{R})$. ...
8
votes
3answers
1k views

Prepending strings to primes.

Hello, we all know that 31,331,3331,33331,333331,3333331,33333331 all are primes, and that 333333331 is not. Here we prepend the digit 3 to 31, to get a list of 7 primes.This gives me the following ...
0
votes
1answer
766 views

Perfect Numbers - On Mersenne and Euler Primes

Hi, I apologize if there is already an (obvious) answer to my question, but please bear with me for the moment as I find it hard to see a good way to answer this question: In the same way that the ...
1
vote
1answer
462 views

Infinitely many pairs of primes?

Hi. I want to know how many (infinitely many) pairs of primes are known. For convinience, let me give two definitions. For any nonconstant polynomial $f(x)\in \mathbb{Z}[x]$, define $A_{f}=\lbrace ...
4
votes
2answers
2k views

Re: Mordell's Equation $y^2 = x^3 + k$ and Perfect Numbers

I have already tried a somewhat exhaustive search of the literature, but couldn't find anything close to the problem that I am working on. My question is: When does Mordell's Equation $$y^2 = x^3 ...
2
votes
1answer
504 views

Reference Request - Sharp Estimates for a Logarithmic Sum

Can anybody suggest a good (e.g. "non-technical") introduction to estimating bounds for logarithmic sums of the form $$\sum_{i=1}^{r}{{\alpha_i}{\log(q_i)}}$$ where the $$\alpha_i$$ are positive ...
5
votes
2answers
820 views

On Sorli's Conjecture Re: OPNs (Circa 2003)

In the PhD dissertation titled "Algorithms in the Study of Multiperfect and Odd Perfect Numbers" (hyperlinked here) and completed in 2003, Ronald Sorli conjectured that the exponent $k$ on the Euler ...
4
votes
2answers
662 views

Artin's conjecture for n=2

I am interested in the following question: Is it known that $2$ is a primitive root modulo $p$ for infinitely many primes $p$? there is some information about Artin's conjecture in ...
4
votes
0answers
499 views

Are there an infinite number of prime Euclid numbers?

A number defined as the product of first $n$ prime numbers $+1$ is called $n$th Euclid number. Are there any survey on the progress for answering the following question: are there an infinite number ...
25
votes
1answer
1k views

Density of values of polynomials in two variables

This question is a reposting of a comment I made on Polynomial representing all nonnegative integers. Let $f(x,y)\in \mathbb Q[x,y]$ such that $f(\mathbb Z\times \mathbb Z)$ is a subset of $\mathbb ...
8
votes
0answers
447 views

What polynomials biject from $\mathbb{N}^{2}$ to $\mathbb{N}$?

Perhaps there are none with integral coefficients; so let us admit rational coefficients. The map $(x, y) \mapsto x + \frac{1}{2}(x + y)(x + y + 1)$ is well known, and swapping $x$ and $y$ in the ...
13
votes
0answers
713 views

Special values of Artin L-functions

This question might be naive and might carry the heuristic that we are living in the best possible world a little too far. If so, I appreciate being told so. Background: Stark's conjecture interprets ...
20
votes
6answers
1k views

What heuristic evidence is there concerning the unboundedness or boundedness of Mordell-Weil ranks of elliptic curves over $\Bbb Q$?

Some experts have a hunch that for any nonnegative integer $r$ there are infinitely many elliptic curves over $\Bbb Q$ with Mordell-Weil rank at least $r$. The best empirical evidence for this hunch ...
31
votes
2answers
2k views

Euler and the Four-Squares Theorem

There are several questions in the Euler-Goldbach correspondence that I am unable to answer. Sometimes it does not take very much: in his letter to Goldbach dated June 9th, 1750, Euler conjectured ...
13
votes
2answers
965 views

Detecting almost-primes quickly

There are many fast algorithms (deterministic and probabilistic) for detecting primality. Are there any fast algorithms (probabilistic ones allowed) known for detecting whether a number is the product ...
16
votes
1answer
1k views

Are all primes in a PAP-3?

Van der Corput [1] proved that there are infinitely many arithmetic progressions of primes of length 3 (PAP-3). (Green & Tao [2] famously extended this theorem to length $k$.) But taking this in ...
16
votes
6answers
2k views

Question on consecutive integers with similar prime factorizations

Suppose that $n=\prod_{i=1}^{k} p_i^{e_i}$ and $m=\prod_{i=1}^{l} q_i^{f_i}$ are prime factorizations of two positive integers $n$ and $m$, with the primes permuted so that $e_1 \le e_2 \cdots \le ...
11
votes
2answers
2k views

Does listing the prime factors always stop?

Take a natural number's prime factors and list them increasingly and repeating them according to multiplicity. Concatenate their decimal (or in any base) representation to get a new number and repeat ...