All Questions
51 questions
3
votes
1
answer
203
views
Chowla's theorem on class number of real quadratic field
Let $p\equiv1\bmod 4$ be a prime number and $h$
the class number of real quadratic field $\mathbb Q(\sqrt{p})$, $\epsilon=\frac{t+u\sqrt{p}}{2}$ its fundamental unit. In this paper https://www.pnas....
- 287
2
votes
0
answers
107
views
Record for determining complete list of imaginary quadratic fields with small class number
In 2003, Mark Watkins (Class numbers of imaginary quadratic fields) determined all imaginary quadratic fields having class number at most 100.
Has this list been improved? That is, what is the largest ...
- 26.9k
2
votes
0
answers
146
views
Reference for accelerated sum to compute the Meissel-Mertens constant
The Meissel-Mertens constant
$$ B_1 = \lim_{n \to \infty} \left(\sum_{p \leq n} \frac{1}{p} - \log\log n\right) $$
has the series representation
$$
\begin{equation} \tag{1}
B_1 = \gamma + \sum_{n=2}^{...
- 451
4
votes
1
answer
223
views
Generators of the ideal class group
Theorem 4 of Eric Bach's "Explicit bounds for primality testing and related problems" states the following:
Let $K$ be a number field of degree greater than 1. Let $d$ be the absolute value ...
- 43
6
votes
0
answers
200
views
Empirical bounds on $\left|\frac{\zeta'(1+it)}{\zeta(1+it)}\right|$
It is reasonable to expect that $$\left|\frac{\zeta'(1+it)}{\zeta(1+it)}\right| < 2 \log \log t$$
for all $t\geq 4$ (say): a somewhat stronger bound is known for $t\geq 10^{165}$ or so (Theorem 5 ...
- 20.2k
1
vote
2
answers
383
views
Is there any way to estimate this functions: $f(n)=\sum_{d|n}d\varphi(d)$ and $g(n)=\sum_{d|n}\frac{\varphi(d)}{d}$?
Let that $n$ be a natural number and $\varphi(n)$ be the Euler totient function. Is there any formula or estimation for computing functions $f,g$ such that:
$$
f(n)=\sum_{d\mid n}d\varphi(d)
$$
and
$$
...
- 139
10
votes
2
answers
3k
views
Can every integer be written as a sum of squares of primes?
This question is mainly inspired from a different problem I was working on.
Is there a value of $k$ such that, for each $n\in \mathbb N$, the equation
$$\sum_{i=1}^{k}x_i^2=n$$
is solvable in $x_1,\...
- 791
-2
votes
2
answers
149
views
Calculate the great common factor between $2^{2n+1}-1$ and $2^{4m+2}+1$ [closed]
How to calculate the great common factor between $2^{2n+1}-1$ and $2^{4m+2}+1$, where $n$ and $m$ are positive numbers.
We guess that: the great common factor is $1$.
- 577
15
votes
0
answers
365
views
Do primes of the form $4k+1$ ever lead the greatest prime factor race?
Analogous to Chebyshev's race between primes, I examined the race between primes in the greatest prime factors, GPF, of natural numbers. Similar to the regular prime race, in the GPF race, the ...
- 5,470
0
votes
2
answers
288
views
Counting powerful integers. Lower bounds
Remark: The upper bounds are perhaps still more interesting; I may address them in another post.
PROBLEM: Find simple (numerically efficient) lower bounds for the number of powerful integers (...
- 4,786
1
vote
1
answer
282
views
Robin's inequality for odd numbers
In this article (Theorem 1.2) there is a proof for Robin's inequality for odd numbers,
$\sigma(n)/n< e^{\gamma}\log(\log(n))$ where $\gamma$ is the Euler-Mascheroni constant and $\sigma(n)$ is the ...
11
votes
2
answers
1k
views
Do consecutive integers have a big prime factor?
Let us say that three consecutive positive integers $(m-1,m,m+1)$ have a big prime factor if the largest prime factor $p$ of $N=(m-1)m(m+1)$ satisfies $e^p>N$.
I ckecked that it is true for all $m&...
4
votes
1
answer
995
views
Is there a way to specify a special kind of reciprocals of natural numbers?
Any number with of a form $\frac{1}{n}$ has a decimal with a repetend of finite length that is never longer than $n$ (provable by Dirichlet principle). (Example: $\frac{92}{99}=0.929292\ldots$ in ...
- 211
0
votes
1
answer
87
views
Constructing an integer with small residues for two distinct primes in polynomial time
Given two primes $p,q\in[T,2T]$, how many integers $m$ of size $O(T^{3/2+\epsilon})$ are there such that the residues $m\bmod p$ and $m\bmod q$ are both $O(polylog(T))$? Looking for an answer
Is it ...
- 13.9k
9
votes
3
answers
584
views
Why is there an unexpected increase in the density of certain types of Goldbach primes?
Note: Posted in MO since it was unanswered in MSE.
I was checking how quickly we can verify Goldbach's conjecture for a given even number $n$ and it was clear that searching backward starting from the ...
- 5,470
1
vote
0
answers
84
views
How common are semiprimes with equally bitsized factors among semiprimes with equal bitsize?
I am curious about the following after having looked at the paper "Almost primes in almost all short intervals", theorem 3 says:
Almost all intervals $[x, x + \log^{3.51}{(x)}]$ with $x ≤ X$...
- 11
2
votes
0
answers
205
views
Sum of all primes below $n$ without listing all primes below $n$
Asymptotically there is around $\frac{n}{\ln n}$ primes below a given integer $n$. Thus $\frac{n}{\ln n}$ is a lower bound for the time complexity of any algorithm that at some point finds each prime ...
- 21
20
votes
1
answer
1k
views
Possible contemporary improvement to bounded gaps between primes?
In his summary of his book Bounded gaps between primes: the epic breakthroughs of the early 21st century, Kevin Broughan writes
Which brings me to my final remark: where to next in the bounded gaps ...
- 35.5k
1
vote
0
answers
96
views
Smooth number pairs satisfying a congruence
Let $\mathcal P=\{p_1,\dots,p_{2t}\}$ be $2t$ primes between $2^\ell$ and $2^{\ell+1}$ and fix an exponent bound $a\in\mathbb Z_{\geq2}$.
Fix $N\in\mathbb N$ whose prime factors $p$ satisfy $p>2^{\...
- 13.9k
-1
votes
1
answer
342
views
Finite or polynomial number integral points clarification on Coppersmith's theorems (possibility of ellipse counter example?)
Coppersmith states if $f(x,y)$ is an irreducible bivariate with total degree $\delta$ then if he can list all roots $(X,Y)$ of the polynomial in $\mathsf{poly}(\log D,\delta)$ time if the roots ...
- 13.9k
5
votes
3
answers
2k
views
Goldbach conjecture and other problems in additive combinatorics
The field is also known as additive number theory. I am interested in sums $z=x + y$ where $x \in S, y\in T$, and both $S, T$ are infinite sets of positive integers. For instance:
$S = T$ is the set ...
- 3,098
6
votes
0
answers
290
views
Effective bounds for Fermat's Last Theorem
Suppose $n>2$. By Fermat's Last Theorem, we know that $a^{n}+b^{n}=c^{n}$
has no non-trivial solutions. Can we quantify it more?
More specifically, given $a,b,c,n\in\mathbb{N}$ with $n>2$ and $...
- 583
2
votes
0
answers
99
views
A problem in modular roots
We have three mutually coprime integers $r,t,M$ where $M\asymp K^{\frac12-2\epsilon}$ and $r,t\asymp K^{\frac14+\epsilon}$ holds with some fixed $\epsilon>0$ and $K>0$ is a large parameter. ...
- 13.9k
7
votes
0
answers
274
views
Are there infinitely many zeroes of $\sum_{r = 1}^{n-1} \mu(r)\gcd(n,r) $?
Let $\mu(n)$ be the Möbius function and $S(x)$ be the number of positive integers $n \le x$ such that
$$
\sum_{r = 1}^{n-1} \mu(r)\gcd(n,r) = 0
$$
My experimental data for $n \le 6 \times 10^5 $...
- 5,470
1
vote
1
answer
189
views
Explicit bivariate quadratic polynomials where Coppersmith is better than standard solver?
http://www.numbertheory.org/pdfs/general_quadratic_solution.pdf gives a general method to solve quadratic bivariate diophantine equation while Coppersmith introduced a method to solve bivariate ...
- 13.9k
2
votes
0
answers
78
views
Accelerating convergence of a product by multiplying by zeta values: history?
Let $R(s_1,\dotsc,s_n) = \prod_p r(p^{-s_1},\dotsc,p^{-s_n})$, where
$r$ is a rational function on $n$ variables. Say we want to compute the value of $R(s_1,\dotsc,s_n)$ for some choice of $s_1,\dotsc,...
- 545
3
votes
1
answer
510
views
Yet another question on sums of the reciprocals of the primes
I recall reading once that the sum $$\sum_{p \,\, \small{\mbox{is a known prime}}} \frac{1}{p}$$
is less than $4$.
Does anybody here know what the ultimate source of this claim is?
Please, let me ...
- 8,842
1
vote
1
answer
144
views
Factoring with partial information on gaps
If $N=PQ$ is a semi-prime with $P=N^{\frac12 +\delta}$ and $Q=N^{\frac12-\delta}$ then if we know $\delta\in(0,\frac12)$ to a reasonable precision we can factor $N$ quickly. What precision (number of ...
- 13.9k
3
votes
1
answer
293
views
Number of lattice points on spheres with center not at the origin
Let $k\ge1$. It is known that the number of lattice points on the $k$-sphere $S^k(0)$ (center at the origin, radius $R$), namely the size of $\mathbb{Z}^{k+1}\cap S^k(0)$, is bounded by $R^{k-1+\...
- 187
-1
votes
1
answer
722
views
summation of Euler totient function
Let $\phi(n)$ be the Euler totient function and let $2\leq k\in\mathbb{N}$. For $m\in\mathbb{N}$, are there any known results, upper bounds (tighter than just removing the coprimality) or ...
2
votes
0
answers
127
views
Coppersmith's method to quadrivariate degree $2$ polynomials that behave as bivariate?
We have a polynomial $f(x_1,x_2,x_3,x_4)\in\mathbb Z[x_1,x_2,x_3,x_4]$ where the only monomials are either from set $$\{x_1,x_1x_2,x_2,x_3,x_3x_4,x_4\}$$ and we seek solutions $(x_1,x_2,x_3,x_4)\in\...
- 13.9k
0
votes
1
answer
159
views
Parity and number of squares taken by polynomials in a range?
I have a polynomial $f(x)=a^2x^2+bx+c\in\mathbb Z[x]$ with $f(x)$ not a constant times a square and $abc\neq0$ and I want to know how many $x$ between $-a$ and $a$ the polynomial is a perfect square. ...
- 13.9k
3
votes
0
answers
186
views
Factoring problem similar to $RSA$ structure that is possibly not $NP$ complete and not $coNP$ also?
Standard factoring problem $\Pi_1$ is 'Given integers $N$ and $M$ is there a factor $d\in[1,M]$ of $N$?'. This is in $NP$ since such a factor is the witness and in $coNP$ since one can check all the ...
- 13.9k
2
votes
0
answers
132
views
Quick computation of a certain exponential sum
Is there a quick way to compute (somewhat accurately) for large $X$, the following exponential sum, where $\Lambda$ is the von Mangoldt function?
$$\int_0^1 \bigg|\sum_{n\le X} \Lambda(n)e(n\alpha)\...
- 1,890
0
votes
1
answer
186
views
Could the sequence A287326 be generalized in order to receive expansion of natural power n>3? [closed]
The sequence https://oeis.org/A287326 - is Binomial distributed triangular array, that shows us necessary items to expand perfect cube $n^3$. Summation of $n$-th row of Triangle A287326 from $0$ to $n-...
- 167
6
votes
2
answers
385
views
Is the nth-power-sum graph connected?
This post was inspired by the Square-Sum Problem presented in Numberphile by Matt Parker.
He asked about Hamiltonianness for $n=2$, and we ask about connectedness for all $n \in \mathbb{N}^*$.
...
1
vote
1
answer
153
views
Specializing non-trivial primality tests
Primes $p$ are integers with no factors (composite allowed) in $[1,p]$. There is a polynomial time test for them.
Given an interval $[a,b]$ what is the best way to test given integer $q$ has no ...
- 13.9k
10
votes
3
answers
1k
views
Explicit formula for elementary symmetric sum
For $k\ge1$, $j\ge1$, Let $$e_k(j)=\sum_{1\le i_1<...<i_k\le j}i_1\cdot\cdot\cdot i_k.$$ We know that $e_k(j)$ is a polynomial in $j$ with coefficients depending on $k$. I am curious about ...
- 113
5
votes
2
answers
314
views
Congruences for the non-divisors of Euler's $\phi(n)$
If $n$ is composite, then $\phi(n) < n-1$: hence, there is at least one number $d$ which does not divide $\phi(n)$ but divides$(n-1)$. We shall call $d$ the totient divisor of $n$. The purist will ...
- 5,470
9
votes
2
answers
647
views
On bounds for idoneal integer
What is the best known lower bound and upper bound known for such a number if it exists and have there been any attempts (computational including) to eliminate the existence of such a number in known ...
user76479
7
votes
1
answer
353
views
Numerically double-checking formula with L-values
I'm working with a special case of Ichino's triple product formula, which for classical holomorphic newforms $f$, $g$ ,$h$ of weights $k$, $m-k$, $m$ (and central characters satisfying $\chi_f \chi_g =...
- 131
1
vote
1
answer
325
views
Error term for prime harmonic
What is known about the asymptotic behavior of
$$
f(x)=\sum_{p\le x}\frac1p-\log\log x-B_1?
$$
Of course by Mertens we know that $f(x)=o(1),$ but has more been proved (in terms of $O$ or $\Omega_\pm$,...
- 9,114
3
votes
1
answer
233
views
Calculating (n ^ fibonacci(k)) MOD m for a large value of k
The value of $k$ can be very large indeed (up to $10^{12}$). Is there an efficient way to calculate the output?
Edit : 'm' is a prime number.
4
votes
2
answers
517
views
Average involving the Euler phi function
Does
$$\frac{1}{N^2}\sum _{d=1}^N \log d \sum _{n=1}^{N/d} \frac{\phi(n)}{\log (dn)},$$
converges or not when $N$ goes to infinity?
- 43
15
votes
2
answers
1k
views
Sum of $\sum_{k=1}^nd(k^2)$
There is a literature dealing with
$$
\sum_{k\le x}d(f(k))
$$
where $f$ is an irreducible polynomial and $d(n)$ is the number of divisors of $n$. Erdos 1952 shows that the sum $\asymp x\log x,$ which ...
- 9,114
11
votes
2
answers
754
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$ ...
- 397
8
votes
3
answers
1k
views
Effective detection of CM modular forms
Say $f$ is a newform of weight $k$ and level $\Gamma_1(N)$. $f$ is called CM if, for example, there is an imaginary quadratic field $K$ such that for all $p\nmid N$ which are inert in $K$, the $p$th ...
- 4,807
20
votes
3
answers
2k
views
Computing (on a computer) the first few (non-trivial) zeros of the zeta function of a number field.
Let $M$ be the splitting field of
x^8 + 3*x^7 + 13*x^6 + 17*x^5 + 45*x^4 + 37*x^3 + 11*x^2 + 112*x + 108
over the rationals. If I've understood some tables ...
- 41.4k
4
votes
1
answer
708
views
Calculating the constant in the Bateman-Horn-Stemmler conjecture
Bateman & Horn [1], building on Bateman & Stemmler [2], give a conjectured formula for the density of numbers that produce simultaneous primes in a number of fixed polynomials.
The constant ...
- 9,114
54
votes
2
answers
8k
views
Walsh Fourier transform of the Möbius function
This question is related to this previous question where I asked about ordinary Fourier coefficients.
Special case: is Möbius nearly orthogonal to Morse
August Ferdinand Möbius (November 17, 1790 – ...