Questions on more advanced topics of number theory, such as quadratic residues, primitive roots, prime numbers, non-linear Diophantine equations, etc. Consider first if (elementary-number-theory) might be a more appropriate tag before adding this tag.

learn more… | top users | synonyms (1)

5
votes
0answers
139 views

Best upper bound on the number of divisors of $n$ that are larger than $N$.

I am looking for the best upper bound on $$\sum_{\substack{d | n\\ d \geq N}} 1.$$ I know that $$ d(n) = \sum_{\substack{d | n}} 1 \leq e^{O(\frac{\log n}{\log \log n})}. $$ For my application, I ...
5
votes
0answers
157 views

Each new member from the second divides the sum of all previous

All integers from $1$ to $13$ are recorded in a sequence such that each number (from the second onwards) divides the sum of all previous numbers. What numbers can be in the third place and why? I ...
5
votes
0answers
339 views

The divergence of the series of reciprocals of primes (proof check):

I just wanted to check my attempt at a proof for the divergence of: $$\sum_{n=1}^{\infty} \frac{1}{p_n} \tag{ $\star$ }$$ We begin with assuming that $(\star)$ converges. If $(\star)$ ...
5
votes
0answers
125 views

A formula by R.L.Graham,AMM(1995)

I see this formula in a book, it comes from R.L.Graham,AMM(1995) : ...
5
votes
0answers
137 views

Proof that $t^8+2t^6+4t^4+t^2+1$ is reducible in $\mathbb{F}_p$

Prove that the polynomial $t^8+2t^6+4t^4+t^2+1$ is reducible in $\Bbb F_p$, for all $p\in \Bbb P$. Here are some examples: $t^8+2t^6+4t^4+t^2+1=(1 + t + t^4)^2\pmod{2}$ $t^8+2t^6+4t^4+t^2+1=(1 + t) (2 ...
5
votes
0answers
153 views

Primes of the form $\frac{n^2-n+4}{2}$ satisfy Hardy-Littlewood analogue?

Let $n,a,b$ be positive integers with $a<b$. Consider primes of the form $f(n)=\dfrac{n^2-n+4}{2}$. Let $C(a,b)$ denote the amount of primes of the form $f(n)$ between (and including) $f(a)$ and ...
5
votes
0answers
161 views

Given an integer, how can I detect the nearest integer perfect power efficiently?

If you give me an integer N, how can I detect the nearest integer perfect power, larger or smaller than N? In other words, the perfect power the distance between N and which is less than the ...
5
votes
0answers
108 views

What is the smallest integer $n$ for which $\theta(n) > n$?

What is the smallest integer $n$ for which $\theta(n) > n$? Here $\theta(x) = \sum_{p \leq x} \log p$. I googled around, checked some likely textbooks, and ran a program for $n \leq 10^7$, but ...
5
votes
0answers
262 views

Estimation for logarithm of Riemann zeta function

Let $\sigma >1-\dfrac{c}{2\log(|t|+3)},|t|>7/8,$ where $c$ is constant from Theorem about region without zeros of Riemann zeta function. Using the fact that $$\log \zeta(s) - \log \zeta(s_1) = ...
5
votes
0answers
178 views

Fastest Primality test using $N-1$ Factorization?

If $N-1$ could be factored easily with several small prime factors, then what is the fastest way to check $N$ for primality? Updated I'm aware of Pocklington primility test which is not good for ...
5
votes
0answers
152 views

Extensions of Mixed Hodge Structures

The analogy on the front page of this paper by Bloch and Kriz seems like it's going to be lovely, but I don't get it, because I don't know how to view a torsor for $\mathbb{Q}(1)$ as an extension of ...
5
votes
0answers
218 views

Carmichael number factoring

The task I'm faced with is to implement a poly-time algorithm that finds a nontrivial factor of a Carmichael number. Many resources on the web state that this is easy, however without further ...
5
votes
0answers
140 views

Has the $\Gamma$-like function $f_p(n) = 1^{\ln(1)^p} \cdot 2^{\ln(2)^p} \cdot \ldots \cdot n^{\ln(n)^p} $ been discussed anywhere?

In an older fiddling with the gamma-function (expanding on the idea of sums of consecutive like-powers of logarithms, similarly as the bernoulli-polynomials for the sums of like powers of consecutive ...
5
votes
0answers
109 views

Approach to elliptic curve $y^2=x^3+1/4+p/a^2$

While taking a brute-force look at this question I discovered that it seems that almost every prime (I'll conjecture every prime larger than 20627) can be written as $p=w^2+wc+d$ for $w,c,d\in ...
5
votes
0answers
237 views

Weak Dirichlet's theorem for powers of primes

Let $p$ be a prime, and let $m$ be an integer coprime to $p$. Then fix a natural number $k>0$. Is there any result that is simpler than the full Dirichlet's theorem that proves the existence of ...
5
votes
0answers
317 views

Taxicab numbers.

I think most people know these numbers. Find $x,\ y,\ z,\ w$ such that $x^3 + y^3 = z^3 + w^3$ and $x,\ y,\ z,\ w$ are not equal to each other. The first is $1729$. I'm trying to figure out if ...
5
votes
0answers
181 views

$2, 5, 13, 17, 29, 421, 401, 53, 281,…,\rightarrow \infty$? $a_{n+1}=\operatorname{ GPF}(qa_n+p)$

I denote by $\operatorname{ GPF}(n)$ the greatest prime factor of $n$, eg. $\operatorname{ GPF}(17)=17$, $\operatorname{ GPF}(18)=3$. Is there a way to prove that the sequence $a_{n+1}=\operatorname{ ...
5
votes
0answers
83 views

Composite $n$ such that $\sigma(n) \equiv n+1 \pmod{\phi(n)}$

I'm looking for composite $n$ such that $$\sigma(n)\equiv n+1\pmod{\varphi(n)}$$ Are there only finitely many? Can this be proved? This is Sloane's A070037 but there's not much information in the ...
5
votes
0answers
400 views

Ramanujan Series

I have the following question involving the series of $1/\pi^3$: Can we find such expansions by using the one for $1/\pi^3$ with $1/\pi^4$ or $1/\pi^n$ etc? Note that $$\frac{1}{32}\sum_{n=0}^\infty ...
5
votes
0answers
162 views

Proof of infinitude of primes whose reversal in base 10 is also prime

Is there any proof of infinitude of http://oeis.org/A007500 primes. If you want to generate them here is trivial and naive python program. ...
5
votes
0answers
466 views

Sum of odd prime and odd semiprime as sum of two odd primes?

How to prove that each sum of odd prime and odd semiprime can be written as sum of two odd primes $(p_1+p_2p_3=p_4+p_5)$ ? Since we know that each prime number greater than $3$ is of the form $6k\pm ...
5
votes
0answers
170 views

Solutions to equation in matrix form

Suppose $x=[x_1, x_2, \cdots, x_n]^t$, $b=[b_1,b_2,\cdots,b_n]^t$ with $b_i\in K$ and $A\in M_n(K)$, where $K$ is a field. There are well known criteria for the system of equations $Ax=b$, by ...
5
votes
0answers
391 views

Is this a relation between the Riemann zeta function and the Prime zeta function?

I am partly repeating myself here again. Is this a correct relation between the Riemann zeta function and the Prime zeta function? $$ \zeta (s) = \sum\limits_{n=1}^{\infty}\frac{1}{n^{s}}$$ ...
5
votes
0answers
143 views

Shintani cone zeta function

Is there a procedure/algorithm for calculating sums of the form $$ \sum_{n_1,\ldots,n_r >0} \frac1{L_1(n_1,\ldots,n_r)^{m_1} \ldots L_r(n_1,\ldots,n_r)^{m_r}} $$ where $$ L_i(n_1,\ldots, n_r) ...
5
votes
0answers
185 views

A subtle relationship from class field theory

Recently, I consider a problem: Let $E/F$ is a Galois extension of number field, denote the idele group of $E$ (resp $F$) by $I_E$ (resp $I_F$). There is a homomorphism induced by norm map $N_{E/F}$: ...
4
votes
0answers
82 views

Integer solutions to the equation $a^3+b^3+c^3=30$

The following problem was posed to me but I could not do much about it: Determine if there are any integer solutions to the equation $a^3+b^3+c^3=30$ I made a computer search that shows that ...
4
votes
0answers
38 views

Motivation behind the Archimedean norm on number fields .

It is easy to justify the use of non-archimedean norms on number fields from an "inside view" as arising from the prime ideals and are therefore clearly useful a priori. However, it seems to me that ...
4
votes
0answers
75 views

On a unique(?) binomial property of $3003$

Given the triangular number, $$T_k = \frac{k(k+1)}{2}$$ and remembering that, $$\binom{n}{m}=\binom{n}{n-m}$$ Excluding $a_0=1$, we then have the six-fold (at least) equalities, $$\begin{aligned} ...
4
votes
0answers
134 views

A lower bound for an arithmetic function

Let $N \in \mathbb{N}$ such that $\phi(N) \sim N$, where $\phi$ is the Euler's totient function. Let $A \subset [N] := \{1, 2, \ldots, N\}$. For $n \in \mathbb{N}$ define the function $$ C_A(n) = \#\{ ...
4
votes
0answers
75 views

Exponential diophantine equation: $2p^2-6p+7=3^n$.

I'm trying to prove that the only integer positive solutions are $(n=1,\ p=1)$ and $(n=3,\ p=5)$. Is there a simple way to do that?
4
votes
0answers
83 views

Special Case of Composite mersenne number mod p

We want to investigate if a composite mersenne number $p|2^{qb}-1$ where $p\nmid2^q-1$ ,$q,p$ are primes, $p=1+6qb,\ qb\equiv1(mod64) $ and $b$ is an odd number. In general for $$\begin{align*} ...
4
votes
0answers
53 views

A sequence avoiding 3-term power progressions

Rankin1 studied sequences of integers that avoid 3-term geometric progressions, $(a, a c, a c^2)$, e.g., $$\{1, 2, 3, 5, 6, 7, 8, 10, 11, 13, 14, 15, 16, 17, 19, \ldots \} \;$$ So, $18$ is excluded ...
4
votes
0answers
59 views

Finding first n so nth fibonacci is c modulo p

This is a question I stumbled upon in an online programming contest archive. The problem statement is simple, given $c \equiv F(n)$ mod $P$ and $P$, where $P$ is a prime of form 5$k$ + 1 or 5$k$ - 1, ...
4
votes
0answers
96 views

Does $\pi$ contain infinitely many “zeros” in its decimal expansion?

Some number doesn't contain $"7"$ in its decimal expansion. For example Liouville's constant $$L=\sum_{n=1}^\infty\frac{1}{10^{n!}}=0.11000100....$$ contains only $0$ and $1$. It is well-known ...
4
votes
0answers
30 views

The copy-problem : Does any block of digits appear at least twice?

Suppose, $N$ random digits have been generated. Let $X$ be the largest natural number with the following property : There are natural numbers $i$ and $j$ with $i+X-1<j$ , such that the digits $i$ ...
4
votes
0answers
58 views

Zeta zeros standard normal distribution

Below is a partially scaled plot of $\vartheta (\gamma_n) - \pi (n - 3/2) ,$ where $\gamma_n$ is the imaginary part of the $n$th zeta zero, and $\vartheta $ is the Riemann-Siegel theta function, for ...
4
votes
0answers
36 views

Squarefree products of a class of primes

Numbers which are the sum of two squares are the product of a square and a collection of distinct primes which are 1 or 2 mod 4. Landau proved that there are $\sim kx/\sqrt{\log x}$ such numbers up ...
4
votes
0answers
39 views

Multiples of some set has density

Nathanson gives a proof in Elementary Methods in Number Theory (Theorem 7.14) that, if a set $S$ of positive integers has $$ \sum_{s\in S}\frac1s<+\infty $$ then the set of positive multiples of ...
4
votes
0answers
66 views

Is there anything known about the value where the Euler and Hadamard products for $\zeta(s)$ are equal?

Take the Hadamard product for the Riemann $\xi$-function ($\rho$ is a non-trivial zero of $\zeta(s)$): $$\xi(s) =\frac12\, s\,(s-1) \,\pi^{-\frac{s}{2}}\, \Gamma\left(\frac{s}{2}\right)\, \zeta(s) ...
4
votes
0answers
104 views

Solve $(x+1)^n-x^n=p^m$ in positive integers

Solve in positive integers: $$(x+1)^n-x^n=p^m$$ $p$ is prime, $n\ge 2$. Seemingly Zsigmondy's Theorem and LTE won't work here. Though you can tell (as suggested by user barto), using ...
4
votes
0answers
58 views

Exploiting a crypto backdoor based on a polynomial

At a capture-the-flag competition during the weekend, there was a task that involved the following polynomial over the field $F = \mathbb{F}_P$ of integers modulo $P = 571787215471557516425591$ (yes, ...
4
votes
0answers
57 views

A question on the Pell equation $x^2-pqy^2 = -1$, with prime $p,q$.

We know that a necessary but not sufficient condition such that, $$x^2-dy^2 = -1\tag1$$ is solvable is that $d$ is not divisible by a prime of form $4m+3$. It is not sufficient because the prime ...
4
votes
0answers
50 views

Question about exponentiation

Consider exponentiation on the natural numbers. Suppose we have an equation involving only the variable $x$, where there are $m$ $x$'s on one side and $n$ $x$'s on another side where $m$ and $n$ are ...
4
votes
0answers
71 views

The canonical height of a point on an elliptic curve

I am struggling with exercise 3.3 in Silverman-Tate Rational Points on Elliptic Curves. Here is the paraphrased problem with necessary background: Let $C:y^2 = x^3 + a x + b$ be a nonsingular cubic ...
4
votes
0answers
84 views

Find integer numbers $x,y>1$ such that $x|3^y+1$ and $y|3^x+1$

Find all integer numbers $x,y>1$ such that $x|3^y+1$ and $y|3^x+1$. I tried to use $\text{ord}$ but still no clue.
4
votes
0answers
60 views

Characterization of Extended Lucky Numbers

The Lucky Numbers is a sieve where one starts out with the positive integers: 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 ... and then eliminate ...
4
votes
0answers
88 views

Is there a formula for $\sum_{n=0}^{+\infty} q^{n^3}$?

When I studyied the representation of integers as sum of squares, I found that the most powerful tool is the Jacobi Triple Product, in fact this amazing identity allows us to find more useful ...
4
votes
0answers
53 views

Can we find the GCD of two polynomials in $\mathbb Q[x]$ by representing the coefficients as vectors?

Can we find the GCD of two polynomials in $\mathbb Q[x]$ by representing the coefficients as vectors? For example: $f=x^5+3x^4+x^3+4x^2+1$, and $g=x^5+3x^4+4x^3+3x+1$ Can we represent these ...
4
votes
0answers
107 views

Questions about decimal expansion being able to represent all real numbers

I read this in several books, and there's a Wikipedia article unquestionably stating that reals must be representable by means of regular language generated from finite alphabet. My questions are: ...
4
votes
0answers
52 views

Not using Jacobi symbol how to prove For all positive integer $n>1$ $2^n - 1 \not | 3^n-1$?

There is a proof: if $n$ is even,then $3|2^n-1$ but $3\not|\;3^n-1$,It is correct; if $n$ is odd,suppose $2^n-1|3^n-1$,then $3^n \equiv 1(\mod 2^n-1)$,then ...