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
140 views

Number of primefactors in $ f(n,W) = \prod_{k=1}^W (p_k^n -1) \text{ where } p_k=Prime(k) $

I'm reviving an old fiddling, although I do not yet really see its benefit. Beginning with the eulerproduct for the zeta-function in the representation $\small \zeta(n)=\prod {1\over 1-p^{-n} } = ...
6
votes
0answers
317 views

Certain permutations of the set of all Pythagorean triples

The fact that the set of all primitive Pythagorean triples naturally has the structure of a ternary rooted tree may have first been published in 1970: http://www.jstor.org/stable/3613860 I learned ...
6
votes
0answers
256 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 ...
6
votes
0answers
353 views

On the equation $m^3-m^2+1 = n^2$

(i) How can I find all positive integers $m$ such that $m\equiv 4 \pmod 7$ and $m^3-m^2+1$ is a perfect square? (ii) Is there a method to solve this equation over positive integers: $$m^3-m^2+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
53 views

What primes were “pending” at the time of Wiles's proof of FLT?

I would like to know what instances of Fermat's Last Theorem were pending at the time of Wiles's proof. More specifically: what families of irregular primes had been discarded as possible ...
5
votes
0answers
182 views

One-to-one correspondance between zeta zeros and the prime powers?

I have noticed an interesting property related to the Gibbs phenomenon for the Fourier transform of the zeta zeros in Riemann's explicit formula, namely that the rate at which $r\rightarrow 2 $ in the ...
5
votes
0answers
35 views

Why are there palindromic subsequences at random among this sequence?

So I was thinking about the Goldbach conjecture and I rephrased it to myself as the following: Prove that every number lies halfway between two primes (or is itself prime.) Which is equivalent. ...
5
votes
0answers
166 views

Summation of a function 2

Let $n$ is a positive integer. $n = p_1^{e_1}p_2^{e_2}\cdots 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}\cdots p_k^{c_k}$ where ...
5
votes
0answers
71 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
43 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
91 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
48 views

Is there any elegant formalization of fractional numbers?

The question is just what is on the title, but I'll describe the context for completion: Natural numbers can be encoded quite elegantly on the Lambda Calculus as church numbers, that is, a function ...
5
votes
0answers
196 views

Proving $11! + 1$ is prime

Prove that: $$11! + 1$$ is a prime number. Without computing the number (or factorial). Obviously, from Wilson's theorem, a number $n$ is prime if, $$(n-1)! + 1 \equiv 0 \pmod{n}$$ Since $n = ...
5
votes
0answers
48 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
166 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
148 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
100 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
230 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
65 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
105 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
193 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
121 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
161 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
376 views

Can $\sigma_4(n)$ be a square number?

Denote $\sigma_k(n)=\sum_{d\mid n}d^k,$ then $$\sigma_1(3)=2^2,\sigma_2(42)=50^2,\sigma_3(2)=3^2,$$ and both $\sigma_1(345)$ and $\sigma_3(345)$ are square numbers: ...
5
votes
0answers
276 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
108 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
220 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
175 views

Understanding Newman's proof of the prime number theorem

I am trying to understand D.J. Newman's proof of the prime number theorem, as presented by D. Zagier. I am not too familiar with analysis, and so there are some things I don't understand. In (III), ...
5
votes
0answers
285 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
116 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
138 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
316 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
123 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
134 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
138 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
254 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
177 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
151 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 ...