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)

4
votes
0answers
41 views

De Rham-Etale comparison isomorphism for elliptic curves

I can't find anywhere a proof of the following comparison isomorphishm: $$H^1_{dR}(E)\otimes \mathbb{C}=H^1_{et}(E)\otimes \mathbb{C}$$ where $E$ is an elliptic curve over $\mathbb{C}$. Any ...
4
votes
0answers
99 views

Find all $x,y\in \mathbb{N}$ such that: $2^x+17=y^2$.

Find all $x,y\in \mathbb{N}$ such that: $2^x+17=y^2$. Its easy to find that $x=6$ is the only even value for $x$, the others have to be odd. One more thing is that we get $y^2 \equiv 19 \pmod ...
4
votes
0answers
67 views

Tate curve and action of inertia group

I read the answers to this question Clarifying a comment of Serre. However I miss a passage of the second answer and since I can't comment there I have should post a new question. I don't understand ...
4
votes
0answers
130 views

Diophantine equation: $13^x+3=y^2$

$x,y$ are positive integers. $$13^x+3=y^2\iff \left(4+\sqrt{3}\right)^x\left(4-\sqrt{3}\right)^x=\left(y+\sqrt3\right)\left(y-\sqrt3\right)$$ $\gcd\left(y+\sqrt3, y-\sqrt3\right)=1$, therefore ...
4
votes
0answers
128 views

Connections between Fibonacci and natural numbers

Here are some known facts about the Fibonacci numbers and then some questions regarding them . 1.Carmichael's theorem : For every $n>12$ $F_n$ has a prime divisor which doesn't divide any of ...
4
votes
0answers
46 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
51 views

Which permutations of $\mathbb{C}$ commute with the Riemann zeta function?

I'm trying to figure out whether the permutations of $\mathbb{C}$ which commute with the Riemann $\zeta$ function are necessarily continuous or not. Obviously both the identity and the complex ...
4
votes
0answers
144 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
83 views

Prove that for each integer $n \ge 2$ there exists a prime number $p$ dividing $a_n$

Let $c \ge 1$ be an integer. Define a sequence of positive integers by $a_1 = c$ and $$a_{n+1}=a_n^3-4c\cdot a_n^2+5c^2\cdot a_n+c$$ for all $n\ge 1$. Prove that for each integer $n \ge 2$ there ...
4
votes
0answers
59 views

Linear independence of primitive Dirichlet characters and convolution

This is not an exercise but merely a question I have. Fix $N \in \mathbb{N}$ and suppose there exist some values $a_k \in \mathbb{C}$, for $k \in \mathbb{Z}_N$, such that $$ \sum_{k \in \mathbb{Z}_N} ...
4
votes
0answers
88 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
45 views

Connection between sgn character and the Legendre symbol

Today, while I was lecturing on the Legendre symbol, I realized that the phenomenon: "the product of two non-squares is a square" isn't so foreign. For example, for $\mathbb R^\times$, the squares are ...
4
votes
0answers
72 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
31 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
77 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
39 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
44 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
72 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
120 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
79 views

How prove $\sigma(4^p-1)<(2^{p+1}-1)^2$

If $p$ is an odd prime numbers, show that $$\sigma(4^p-1)<(2^{p+1}-1)^2$$ where $\sigma(n)$ stands for the sum of divisors. I thought of using the formula for $\sigma(n)$: If ...
4
votes
0answers
68 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
71 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
57 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
107 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
93 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
98 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
42 views

Number of digits $d$ in $d^k$

The title says it all really. For example, how many occurences of $6$ are there in $6^k$? It starts 6, 36, 216, ... so 1, 1, 1... The question can now be generalized into any digit or group of digits. ...
4
votes
0answers
71 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
147 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
53 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 ...
4
votes
0answers
106 views

More on primes $p=u^2+27v^2$ and roots of unity

Given, $$p=u^2+27v^2=3m+1\tag1$$ and the cubic, $$x^3+x^2-mx+N=0\tag2$$ with its constant expressed in terms of $(1)$ as, $$N = \frac{1}{27}(1-3p\pm2pu)\tag3$$ and the sign $\pm u$ chosen ...
4
votes
0answers
103 views

An infinite series that gives $f(s)=s$. How could it be explained more easily?

This question loosely builds this one. Equate the following two infinite series for $\zeta(s)$: $$\displaystyle \zeta(s) = \frac{1}{4\,(s-1)} \left(1+s+\sum _{n=1}^{\infty } \left( {\frac ...
4
votes
0answers
87 views

Group generated by two polynomials

The $Homeo(\mathbb{R})$ be the group of all the homeomorphisms on $\mathbb{R}$, with the group operation of composition. Let $f(x)=x^3+\alpha$ and $g(x)=x^3+\beta$ be two elements of ...
4
votes
0answers
53 views

Prove this congruence

Let $p$ be a prime of the form $4k+3$ and $m$ an even positive integer less than $p-1$. Prove that $$1^m+2^m+\cdots+\left(\frac{p-1}{2}\right)^m \equiv ...
4
votes
0answers
105 views

Any heuristic explanation on why sieve methods can not prove Goldbach conjecture?

Any heuristic explanation on why sieve methods can not prove strong Goldbach conjecture ? I remember that Terence Tao published a blog and gave an heuristic explanation on why circle methods very ...
4
votes
0answers
39 views

$\sum_{a^2<p\leq (a+1)^2}p$ Summation of primes

$$\sum_{a^2<p\leq (a+1)^2}p$$ where p is prime. Are there some known bounds for this sum?
4
votes
0answers
116 views

Diophantine inequality that comes up after Vieta Jumping Hurwitz technique

I am blaming this on Prove the equality EDITTTTT: allowing $x_1 \geq x_2$ and $x_2 \geq x_n,$ I would rather not explain what that was about and the only changes are in $n=3,4,$ already settled. ...
4
votes
0answers
140 views

Adding Numbers Pattern

A few nights ago I couldn't sleep and so started doing this: I would take a number and add up all of its digits to get a new number and then add up all of those digits and so on until there was only ...
4
votes
0answers
31 views

properties of certain semigroup action on $\mathbb{Z}/p\mathbb{Z}$

Suppose we have a polynomial $f \in \mathbb{Z}/p\mathbb{Z}[x]$, $f(x) = x^2 - x$. We are interested in elements $n \in \mathbb{Z}/p\mathbb{Z}$ such that after repeated application of f they ...
4
votes
0answers
49 views

Artin-Schreier Question from Corps Locaux

I have a question from Serre's book "Corps Locaux", namely question 5a in section 2 of chapter IV. It is as follows: "Let $e_K$ be the absolute ramification index of K, and let n be a positive ...
4
votes
0answers
357 views

Inverse logarithmic integral

If the expansion of the logarithmic interval is$$\text{li}(n) = \log \log n + \gamma + \sum_{k=1}^\infty \dfrac{(\log n)^k}{k! k}$$ what is the inverse of the function?
4
votes
0answers
162 views

Transfinite Knuth-arrow hierarchy vs. fast-growing hierarchy

Suppose Knuth arrow notation (and hence the hyperoperation sequence) is extended to transfinite ordinal indices as follows: Let μ be a large countable ordinal such that a fundamental sequence is ...
4
votes
0answers
118 views

Number of Solutions to a Diophantine Equation

I am asked the following: Show that the number of integer solutions to $y^p=x^2+2$ for any odd prime $p$ is at most $p-1$. I checked that for $y^p=x^2+2$, the same method for $y^3=x^2+2$ works ...
4
votes
0answers
84 views

Chinese Remainder Theorem stuff (but more advanced, certainly derived from)

First, let $m$,$n$ be coprime. Suppose we want to find: $x\equiv y\text{ mod }m$ $x\equiv z\text{ mod }n$ As m,n are coprime $\exists a,b\in\mathbb{Z}:am+bn=1$ (GCD=1 basically) Then, for ...
4
votes
0answers
132 views

Appear the digits in the number $3^{3^{3^3}}$ approximately equally often?

Does the number $$3\uparrow \uparrow 4 = 3^{3^{3^3}}$$ contain the digits 0-9 approximately equally often ? With "approximately" I mean that a chi-squared test for equal distribution would produce ...
4
votes
0answers
94 views

Asymptotics for Mertens function

It seems that the cumulative mean of the Mertens function is very similar in behaviour to $x$ raised to the power of the first zeta zero. I tentatively notate it as: ...
4
votes
0answers
125 views

Prime factors of $2^{2^2}+3^{3^3}+5^{5^5}+7^{7^7}$

Are there any useful restrictions to the prime factors of the number $$2^{2^2}+3^{3^3}+5^{5^5}+7^{7^7}$$ The two smallest are 6771419 and 72153167 , which I found by trial division. The number is ...
4
votes
0answers
72 views

$P_{K,1}(\mathfrak m)\subset \operatorname {ker} \Phi_{\mathfrak m,L|K} \subset \operatorname {ker} \Phi_{\mathfrak m,M|K}$ imples $M \subset L$

Let $K$ be a number field and $L, M$ finite abelian extensions. Let $\mathfrak m$ be a modulus. Consider the two Artin maps $ \Phi_{\mathfrak m,L|K}$ and $ \Phi_{\mathfrak m,M|K}$. Let ...
4
votes
0answers
59 views

Closest Pair between 2 sets of powers

Assume $a$ and $b$ are natural numbers, $A=\{a,a^2,a^3,\cdots\}$ and $B=\{b,b^2,b^3,\cdots\}$, find $\min\left|a_i-b_j\right|$ where $a_i\in A$ and $b_j\in B$. For example, if $a=3$, $b=10$, then ...
4
votes
0answers
110 views

How find this equation all pairs of integers $(m,n)$ such that $m^6 = n^{n+1} + n -1$

Find all pairs of integers $(m,n)$ such that $m^6 = n^{n+1} + n -1$ My try: If $n>1$ is odd, then note $$\left(n^{\frac{n+1}{2}}\right)^2<n^{n+1}+n-1<\left(n^{\frac{n+1}{2}}+1\right)^2$$ so ...