# Tagged Questions

Prime numbers, diophantine equations, analytic or algebraic number theory, arithmetic geometry, Galois theory, transcendental number theory, continued fractions

110 views

96 views

### Computational number theory

Suppose that $p$ is prime and $q$ is an even number divides $p-1$, such that $q<\frac{p-1}{q}$ and $u$ has order $q$ modulo $p$. Let $S$ be the subgroup of $Z^*_p$ consisting of the powers of $u$. ...
139 views

### Exceptional isomorphisms between finite simple Chevalley groups

Steinberg's "Lectures on Chevalley Groups" https://math.depaul.edu/cdrupies/research/papers/chevalleygroups.pdf contain a complete list of isomorphisms" among the various finite simple Chevalley ...
96 views

### Combinatorial splitting in number rings

The goal of this problem is to see if there is a structured way to factor numbers constructed from a set of distinct odd primes $p_1$ through $p_n$ in a number ring. Take an arbitrary non empty ...
68 views

### Considering a matrix with integrer entries over $\mathbb{Z}/p \mathbb{Z}$, does it remain full rank? [on hold]

Suppose I have an $m \times n$ matrix $M$ with integer coefficients, and suppose it has full rank. Let $p$ be a prime and now consider the matrix $\bar{M}$ over $\mathbb{Z}/p \mathbb{Z}$. Is it true ...
299 views

### Jacobi's theorem on sums of two squares (reference request)

One of Jacobi's theorems states that the number of representations of a positive integer $n$ as a sum of two squares of integers equals $$4(d_1(n)-d_3(n)),$$ where the function $d_i$ counts the number ...
114 views

### Hilbert modular forms twist-equivalent to their conjugates

Let $L / K$ be a solvable (or cyclic) Galois extension of totally real fields, and let $f$ be a Hilbert modular newform over $L$. Suppose that, for every $\sigma \in Gal(L / K)$, the conjugate ...
54 views

629 views

### Smallest solution to $x^2 \equiv x\pmod{n}$

Given $n$, is it possible to upper bound the smallest $x > 1$ that satisfies the congruence $x^2 \equiv x\pmod{n}$? Obviously when $n$ is a prime power $x = n$, and we are in the worst situation. ...
97 views

### How to count fixed-sized subsets of pairwise co-prime numbers less than a prime, satisfying an additional ‎constraint‎?

In part of my research, I need to count (or find a sharp bound for) the number of all possible ‎selections of $n$ distinct integers less than the prime $p$, say $r_1, r_2, …, r_n$, which are pairwise ...
The following observation makes me quite confused when I am trying to count the number of solutions of the equation: $$\sum_{k=0}^{M}{M \choose k}^2x^k=0$$ on finite fields $\mathbb{F}_p$ with the ...