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)

6
votes
0answers
123 views

Generalizing Quadratic Reciprocity Law with Dilates

Eisenstein's proof of the Quadratic Reciprocity (QR) (and its Jacobi symbol generalization) both rely on counting lattice points in two congruent triangles. If we take $t$-dilates of these triangles, ...
5
votes
0answers
63 views

Show that for a given $s$ there are a finite number of Fibonacci number of form $n^2+s$

It is well known that the last Fibonacci number $F_k$ such that $\exists \ n \in \Bbb{N} : F_k = n^2$ is $144$. Thus there are only $4$ perfect squares among the Fibonacci sequence (assuming you ...
5
votes
0answers
63 views

Summation of a function

Let $n$ is a positive integer. $n = p_1^{e_1}p_2^{e_2}...p_k^{e_k}$ is the complete prime factorization of $n$. Let me define a function $f(n)$ $f(n) = p_1^{c_1}p_2^{c_2}...p_k^{c_k}$ where $c_k = ...
5
votes
0answers
41 views

Generalisation of $\gcd\left(\frac{a^n-b^n}{a-b},a-b\right)=\gcd(n\gcd(a,b)^{n-1},a-b)$ to $\gcd\left(\frac{a^n-b^n}{a-b},a^m-b^m\right)$?

We have the identity $$\gcd\left(\frac{a^n-b^n}{a-b},a-b\right)=\gcd(n\gcd(a,b)^{n-1},a-b).$$ (see here) This appears to be a quite useful result with various applications. I wonder whether there is ...
5
votes
0answers
88 views

The smallest non-zero integer $c$ such that $\sum\limits_{n=1}^m\pm(x+n)^6 = c$?

We have the neat equalities, I. Group 1 For $k=2,3,4,5,\dots$ $$\sum_{n=1}^{2^k}\epsilon_n(x+n)^k = 2^{\frac{k(k-1)}{2}}k! = 4,\;48,\;1536,\;\color{brown}{122880},\dots$$ for appropriate ...
5
votes
0answers
47 views

Kloosterman sum and multiples of 16

A Kloosterman sum is defined as $$K(a,b;m)=\sum_{0\leq x \leq m-1}_{\gcd(x,m)=1} e^{2\pi \mathcal{i} (ax+bx^*)/m}$$ where $a,b,m \in \mathbb{N}$ and $x^*$ is the inverse of $x$ modulo $m$. How can ...
5
votes
0answers
156 views

Does this prime generating way generate all the prime numbers?

I've thought of the following algorithm to find the entire list of prime numbers: Take a prime number $p$ to your list. $1.$ Multiply all the numbers in your list and call the number you get ...
5
votes
0answers
143 views

Diophantine: $x^3+5=y^5$

Find all integers $x$ and $y$ such that $x^3+5=y^5$. I found this after solving the equation $3^a+5=2^b$. For this equation, since $(a,b)=(3,5)$ is a solution, it is possible to write it as ...
5
votes
0answers
98 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 ...
5
votes
0answers
41 views

Do modular forms of higher weight occur in the proof of FLT?

Fermat's last theorem is a consequence of a statement about weight two modular forms. Going through the long proof, does one ever encounter modular forms of higher weight?
5
votes
0answers
226 views

Successive ratios of a sequence, is this limit true?

The natural numbers $1,2,3,4,5....$ can be calculated as the row sums of the triangle $T(n,k)$ equal to $1$ if $n \geq k$ and $0$ otherwise: $$\displaystyle T = \left(\begin{matrix} ...
5
votes
0answers
62 views

Involutions of the second type in a division algebra

I'm trying to figure out some details about involutions of division algebra, thought maybe someone here might have a better insight. Let $k$ be a $p$-adic or number field, and let ...
5
votes
0answers
68 views

finding very small values of $r + s\sqrt p + t\sqrt q$

For integers $p$, $q$ I'm interested in finding good approximations to $0$ of the form $r + s\sqrt p + t\sqrt q$ for rational $r$, $s$ and $t$. In particular, I'd like to generate approximations ...
5
votes
0answers
135 views

How find this $aA_{m+1}=\overline{\sigma_{0}\sigma_{1}\sigma_{2}\cdots\sigma_{m}}$

Question let $m$ is positive numbers,and such $m\ge 5$,and $$A_{m+1}=\overline{1234\cdots m}=1\times (m+1)^{m-1}+2\times (m+1)^{m-2}+\cdots+(m-1)\times (m+1)+m$$(or see ...
5
votes
0answers
102 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
103 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
185 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
119 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
158 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
88 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
268 views

Which unordered partition of $n$ gives rise to the largest number of ordered partitions?

A quick look at the wikipedia article on partitions of $n \in \mathbb{N}$ shows that the number of ordered partitions is $2^{n-1}$, and the number of unordered partitions is asymptotically $ \sim ...
5
votes
0answers
176 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
81 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
107 views

Relative density of images of diophantine polynomials

My current research project involves sampling a sequence along non-constant polynomials with non-negative integer coefficients defined over the natural numbers, and I'd like to be able to say when two ...
5
votes
0answers
217 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
70 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
281 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
115 views

Inverting the Riemann zeta function in $s>1$

Let $s>1$ be a positive real and the Riemann zeta fucntion be defined for $s>1$ as $$ \zeta(s) = \sum_{n=1}^{\infty}\frac{1}{n^s}. $$ I am looking for an inversion formula for the zeta ...
5
votes
0answers
136 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
309 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
122 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
132 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
152 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
118 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
107 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
250 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
176 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
149 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
208 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
138 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
232 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
308 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
180 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
81 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
143 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
395 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
158 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
401 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 ...