Questions on more advanced topics of number theory. 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
99 views

Number of points on an affine hypersurface

I am curious to know the following and I would appreciate any help! Let $k$ be a finite field of $q$ elements. Let $X \subseteq \mathbb{A}^{n+1}_k $ be the affine hypersurface defined by $f = ...
5
votes
0answers
89 views

Prime number theorem for Dedekind domains

Let $\mathscr P\subseteq \mathbb N$ be the set of prime numbers. The prime number theorem tells us that if $\pi(x)=|\{p\in\mathscr P\colon p\leq x\}|$ then $\pi(x)\sim \frac{x}{\log x}$. Now one could ...
5
votes
0answers
115 views

Are $ut + 1$ and $ut + t + 1$ both prime for some t for any $u$?

Conjecture : For any natural number $u$, there is a natural number $t$ such that $ut + 1$ and $ut + t + 1$ are both prime. So we get a solution of the equation $$au - b(u+1) = -1$$ with prime ...
5
votes
0answers
159 views

How is graph theory used to solve problems in number theory?

What are some applications of graph theory in number theory? How can a graph theory approach be useful to solving number theory problems? In general, is graph theory ever useful in making number ...
5
votes
0answers
106 views

Ramification index and residue class degree under completion

I've got a problem in proving something written at page 111 of the book "Algebraic Number Theory" by A. Fröhlich and M. J. Taylor. This is the setting. Let $\mathfrak{o}$ be a Dedekind domain with ...
5
votes
0answers
146 views

How to list the prime factorised natural numbers?

Today I set out to invent a two character numeral system designed to make factorization trivial. Indeed, it lets one factor non-trivial numbers with over thousand digits within 30 seconds per hand - ...
5
votes
0answers
86 views

About solutions to $x^2+y^2+z^2=8n+3,n\in \mathbb N$

As we know that $x^2+y^2+z^2=8n+3,(n\in \mathbb N)\tag{1}$ has integer solutions $x,y,z\in \mathbb N.$ If $k\in \mathbb N$ has at least one prime factor which is $\equiv 3 \mod 4,$ then we call $k$ ...
5
votes
0answers
169 views

How to partition $S$ in this way?

Assume: $$ P =\{p_1,p_2,\cdots,p_K\}\subset \{1,2,\dots,N\},\quad |P| = K, \qquad x \in \mathbb{R}_+^K , \qquad w = e^{-j\frac{2\pi}N} $$ and, $$ f(l) = \sum_{i=1}^K \sum_{j=1}^K x_i x_j ...
5
votes
0answers
79 views

Constructing pairs of units $(x,y)$ which solve $x^2 + y^2 \equiv -1 \pmod{N}$

A classic result on the way to the Lagrange Four Squares theorem — for instance proven by Theorem 87 of Hardy & Wright, as noted by this remark on the Four Squares theorem — is that ...
5
votes
0answers
204 views

How Ramanujan find this formula

I have seen this formula from Ramanujan $\sum_n \frac{a^{n+1}-b^{n+1}}{a-b}\frac{c^{n+1}-d^{n+1}}{c-d}T^n=\frac{1-abcdT^2}{(1-abT)(1-acT)(1-bcT)(1-bdT)}$. I know how to prove it via geometric ...
5
votes
0answers
244 views

Ramanujan and sum of four cubes

This is more a question on History than proof itself. About a decade ago, a college professor and a Math coach told us about this beautiful theorem: Every multiple of 6 can be written as a sum of ...
5
votes
0answers
64 views

Matrix representation of field automorphism

Let $K$ be the degree $n$ field extension of the field $k$, and let $\alpha_1,\dots,\alpha_n\in K$ be a basis of $K$ over $k$ (as a vector space). I read somewhere that the following matrix $$ M= ...
5
votes
0answers
256 views

Maximum length of sequence of non-coprimes of $N$ - least upper bound for Jacobsthal's function

I am looking at the length of the longest sequences of adjacent integers that are not coprime to $N$ for very large $N$. Let $F_N$ be the set of integers less than $N$ which are not coprime with $N$: ...
5
votes
0answers
128 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
155 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
238 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
117 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
126 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
140 views

Primes of the form $\dfrac{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
235 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
169 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
193 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
136 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
73 views

Statement about Woodal primes.

A Woodal number is an integer of the form $n 2^{n}-1$. A Woodal prime is an integer that is both a prime and a Woodal number. Let $p$ be a prime of the form 1 mod 4. Then $p 2^{p} -1$ is never a ( ...
5
votes
0answers
222 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
287 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
139 views

Density of products of a certain set of primes

I have an infinite set S of prime numbers with relative density 0 (that is, $\lim_ns_n/p_n=\infty$ with $S=\{s_1,s_2,\ldots\}$ and $s_1 < s_2< \cdots$). I would like to find the size (in some ...
5
votes
0answers
179 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
135 views

Polynomial equations in $p$ and $q$ with $p,q$ primes

Is there a non zero polynomial $R \in \mathbb{Z}[X,Y]$ such that there exists an infinite number of pair $(p,q)$ with $p$ and $q$ primes, $p \neq q$ and $R(p,q)=0$ ? I know the curve must be of genus ...
5
votes
0answers
382 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
156 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
217 views

Sums of Dirichlet-Characters over prime numbers (part 2)

This is kind of related to my previous question that was poorly stated because of misreading my own notes that I have taken on the papers I am currently reading, so no surprise that it eventually ...
5
votes
0answers
168 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
363 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
135 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
176 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
70 views

Are there infinitely many $N^3$ (especially for prime $N$) that cannot be expressed as a sum of three positive cubes?"

Well few days ago i asked a question on perfect numbers and Tito Piezas III answered the question in a very intriguing way which has helped me to get a lead on it.But his answer and perfect numbers ...
4
votes
0answers
50 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
78 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
77 views

Is $\{ \sin n^m \mid n \in \mathbb{N} \}$ dense in $[-1,1]$ for every natural number $m$?

Is $\{\sin n^m \mid n \in \mathbb{N}\}$ dense in $[-1,1]$ for every natural number $m$? Progress For $m=1$, I can prove this using the fact that $\sin$ is continuous and $a+b\pi$ is dense in the ...
4
votes
0answers
99 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
51 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
38 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
46 views

Numbers Made From Concatenating Prime Factorizations

I came across the following curious problem while playing around with my calculator. Take any positive integer $n$; for this example we'll use $216$. Create a sequence as follows: Factor $n$ into ...
4
votes
0answers
49 views

When does a variety have a point over a finite field for sufficiently large primes p?

Let $X$ be an algebraic variety over the rational numbers. Suppose that $X$ has positive dimension. I would like to say that $X(\mathbb{F}_p)$ is non-empty for sufficiently large primes $p$. One idea ...
4
votes
0answers
134 views

Differences between large numbers with many factors has little factors

I apologise beforehand for the informality and lack of precision in this question but it is that way because it comes from only an intuition, nothing more than a heuristic argument. Say one has two ...
4
votes
0answers
89 views

Binomial triplets

Solutions to the equation $$\dbinom{a}{n}+\dbinom{b}{n}=\dbinom{c}{n}$$ I will refer to as 'Binomial triplets of order $n$'. These triplets describe simplicial $n$-polytopic numbers that can be ...
4
votes
0answers
200 views

Prove modular equivalence related to carmichael function.

Statement if $n=p_1p_2p_3\cdots p_r$ (prime numbers are distinct) and $2 \le a \le n-1$ then prove that $$a^{k\lambda} \equiv \left(1+\sum_{p_i\mid\gcd(a,n)}\left(\dfrac{n}{p_i} \right) ...
4
votes
0answers
96 views

Is it decidable whether the iterates of a polynomial map are bounded?

Let $f:\mathbb{Q}^n\to \mathbb{Q}^n$ be a polynomial map with rational coefficients. Let $p\in \mathbb{Q}^n$. Is there a known algorithm that given this data determines whether or not the iterates ...
4
votes
0answers
98 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. ...