Mathematics Problem Archive

Showing 2251-2300 of 3440 problems (Page 46 of 69)

AMR-083-0011
Partially Solved

O10 — Factoring from roots modulo a composite

v1.3 research notes

Let $C_{10}$ find $x$ satisfying $x^e\equiv a\pmod n$ under $\gcd(e,\varphi(n))=\gcd(a,n)=1$. Is complete integer factorization randomized polynomial-...

L3
Graph Theory
AMR-083-0012
Open

O11a — Quadratic residuosity modulo a composite

v1.3 research notes

Can one decide in deterministic polynomial time whether a coprime integer $a$ is a square modulo a composite $n$?...

L3
Graph Theory
AMR-083-0013
Open

O11b — Factoring from composite quadratic residuosity

v1.3 research notes

Is complete integer factorization randomized polynomial-time reducible to deciding quadratic residuosity modulo a composite?...

L3
Graph Theory
AMR-083-0014
Open

O12 — Finding a quadratic nonresidue

v1.3 research notes

Given a prime $p$, can a quadratic nonresidue modulo $p$ be found in deterministic polynomial time?...

L3
Graph Theory
AMR-083-0015
Open

O13 — Realizing a prescribed quadratic signature

v1.3 research notes

Given a sign vector $\varepsilon\in\{-1,1\}^k$, can the least prime $p$ satisfying $(p_i/p)=\varepsilon_i$ for every $i\le k$ be found in deterministi...

L3
Graph Theory
AMR-083-0016
Open

O14 — Square roots modulo a prime

v1.3 research notes

Given a prime $p$ and a quadratic residue $a$, can a square root $x^2\equiv a\pmod p$ be found in deterministic polynomial time?...

L3
Graph Theory
AMR-083-0017
Open

O15 — Polynomial roots modulo a prime

v1.3 research notes

Given a prime $p$ and $f\in(\mathbb{Z}/p\mathbb{Z})[x]$ known to have a root, can a root be found in deterministic polynomial time?...

L3
Graph Theory
AMR-083-0018
Open

O16 — Factoring polynomials modulo a prime

v1.3 research notes

Given a prime $p$ and $f\in(\mathbb{Z}/p\mathbb{Z})[x]$, can the complete irreducible factorization of $f$ be found in deterministic polynomial time?...

L3
Graph Theory
AMR-083-0019
Partially Solved

O17 — Constructing irreducible polynomials over finite fields

v1.3 research notes

Given a prime $p$ and degree $d$, can an irreducible polynomial of degree $d$ over $\mathbb{F}_p$ be constructed in deterministic polynomial time?...

L3
Graph Theory
AMR-083-0020
Open

O18a — Recognizing primitive roots deterministically

v1.3 research notes

Given a prime $p$ and $b$, can one decide in deterministic polynomial time whether $b$ generates $(\mathbb{Z}/p\mathbb{Z})^*$?...

L3
Graph Theory
AMR-083-0021
Open

O18b — Recognizing primitive roots randomly

v1.3 research notes

Is recognition of primitive roots modulo a prime in randomized polynomial time $R$?...

L3
Graph Theory
AMR-083-0022
Open

O19 — Finding a primitive root modulo a prime

v1.3 research notes

Given a prime $p$, can a generator of $(\mathbb{Z}/p\mathbb{Z})^*$ be found in deterministic polynomial time?...

L3
Graph Theory
AMR-083-0023
Open

O20 — Computing multiplicative orders modulo a prime

v1.3 research notes

Given a prime $p$ and $a$ coprime to $p$, can $\operatorname{ord}_p(a)$ be computed in deterministic polynomial time?...

L3
Graph Theory
AMR-083-0024
Open

O21 — Discrete logarithms modulo a prime

v1.3 research notes

Given a prime $p$ and elements $g,b$ with $b$ in the subgroup generated by $g$, can an exponent $x$ satisfying $g^x\equiv b\pmod p$ be found in determ...

L3
Graph Theory
AMR-083-0025
Open

O22a — Discrete logarithms modulo a composite

v1.3 research notes

Given $g,b,n$ such that $g^x\equiv b\pmod n$ has a solution, can such an exponent $x$ be found in deterministic polynomial time?...

L3
Graph Theory
AMR-083-0026
Partially Solved

O22b — Factoring from composite discrete logarithms

v1.3 research notes

Is complete integer factorization deterministically polynomial-time reducible to discrete logarithms modulo composites?...

L3
Graph Theory
AMR-083-0027
Partially Solved

O23 — Factoring from Euler's totient

v1.3 research notes

Is complete integer factorization deterministically polynomial-time reducible to computing $\varphi(n)$?...

L3
Graph Theory
AMR-083-0028
Partially Solved

O24 — Finding a point on an elliptic curve

v1.3 research notes

Given $a,b$ and a prime $p$ with nonsingular curve $y^2=x^3+ax+b$, can a point on the curve modulo $p$ be found in deterministic polynomial time?...

L3
Graph Theory
AMR-083-0029
Open

O25 — Solving binary quadratic congruences

v1.3 research notes

Given $k,m,n$ with odd $n$ and $\gcd(km,n)=1$, can integers $x,y$ satisfying $x^2-ky^2\equiv m\pmod n$ be found in deterministic polynomial time?...

L3
Graph Theory
AMR-083-0031
Open

O27 — Elliptic curves of prescribed order

v1.3 research notes

Given a prime $p$ and $n$, can one construct in deterministic polynomial time an elliptic curve over $\mathbb{F}_p$ having exactly $n$ points whenever...

L3
Graph Theory
AMR-083-0032
Open

O28 — Discrete logarithms in elliptic-curve groups

v1.3 research notes

Given an elliptic curve over $\mathbb{F}_p$ and points $P,Q$ such that $P=nQ$ for some $n$, can such an $n$ be found in deterministic polynomial time?...

L3
Graph Theory
AMR-083-0033
Solved

O29 — NP-hardness of exact shortest vector

v1.3 research notes

For a full-rank integer lattice, is finding a nonzero vector of minimum Euclidean norm NP-hard?...

L3
Graph Theory
AMR-083-0034
Partially Solved

O30 — Polynomial-factor lattice approximation

v1.3 research notes

Does there exist a constant $c$ for which one can find in deterministic polynomial time a nonzero lattice vector of length at most $n^c$ times the min...

L3
Graph Theory
AMR-083-0035
Partially Solved

O31 — Order of a polynomial's Galois group

v1.3 research notes

Given $f\in\mathbb{Q}[x]$, can the degree of its splitting field, equivalently the order of its Galois group, be computed in deterministic polynomial ...

L3
Graph Theory
AMR-083-0036
Partially Solved

O32 — Class numbers of imaginary quadratic orders

v1.3 research notes

Given $d\in\mathbb{N}$, can the class number $h(-d)$ of binary quadratic forms of discriminant $-d$ be computed in deterministic polynomial time?...

L3
Graph Theory
AMR-083-0037
Solved

O33a — NP-hardness of binary quadratic Diophantine solvability

v1.3 research notes

Under the promise that $b^2-4ac$ is not a square, is deciding whether $ax^2+bxy+cy^2+dx+ey+f=0$ has an integral solution NP-hard?...

L3
Graph Theory
AMR-083-0038
Solved

O33b — Randomized NP-hardness of binary quadratic Diophantine solvability

v1.3 research notes

Is the same binary quadratic Diophantine solvability problem NP-hard under randomized reductions?...

L3
Graph Theory
AMR-083-0039
Open

O34 — Solvability of the negative Pell equation

v1.3 research notes

Can one decide in deterministic polynomial time whether $x^2-dy^2=-1$ has an integral solution?...

L3
Graph Theory
AMR-083-0040
Partially Solved

O35 — Greatest common divisors in NC

v1.3 research notes

Can $\gcd(a,b)$ be computed in the parallel complexity class $NC$?...

L3
Graph Theory
AMR-083-0041
Partially Solved

O36 — Integer multiplication in linear bit complexity

v1.3 research notes

Can two positive integers $a,b$ be multiplied using $O(\log(ab))$ bit operations?...

L3
Graph Theory
AMR-084-0002
Open

Exceptional parameters without D(n)-quadruples

v1.3 research notes

For each $n\in\{-3,3,5,8,12,20\}$, prove that no set of four distinct positive integers has property $D(n)$, meaning that every pairwise product plus ...

L3
Graph Theory
AMR-084-0004
Open

Finiteness of D(n)-quadruples for nonsquare n

v1.3 research notes

For every nonzero integer $n$ that is not a square, are there only finitely many $D(n)$-quadruples?...

L3
Graph Theory
AMR-084-0005
Partially Solved

Extremal parameters for D(n)-quintuples

v1.3 research notes

Determine the least positive integer $n_1$ and the greatest negative integer $n_2$ for which a $D(n_i)$-quintuple exists....

L3
Graph Theory
AMR-084-0009
Open

Existence of a strong rational Diophantine quadruple

v1.3 research notes

Does there exist a set of four nonzero rational numbers $\{a_1,a_2,a_3,a_4\}$ such that $a_i a_j+1$ is a rational square for every $1\le i,j\le4$, inc...

L3
Graph Theory
AMR-086-0001
Open

Problem 1.1

v1.3 research notes

Let $f\in\mathbb{Z}[X,Y]$ be a polynomial such that the equation $f(x,y)=0$ has only finitely many solutions $(x,y)\in \mathbb{Z}\times\mathbb{Z}$. Gi...

L3
Graph Theory
AMR-086-0003
Open

Conjecture 1.4 — Shorey

v1.3 research notes

There exists a positive number $C$ which depends only on $L$ and $H$ with the following property. Let $m$, $x$ and $y$ be rational integers with $m\ge...

L3
Graph Theory
AMR-086-0004
Open

Conjecture 1.5

v1.3 research notes

Let $k\ge 2$ be an integer and $\alpha_1,\ldots,\alpha_n$ be non-zero elements in a field $K$ of zero characteristic, such that no quotient $\alpha_i/...

L3
Graph Theory
AMR-086-0006
Open

Conjecture 1.7

v1.3 research notes

If there is no prime in the interval $[n+1,n+k]$, then the product $(n+1)\cdots(n+k)$ has at least $k$ distinct prime divisors....

L3
Graph Theory
AMR-086-0007
Open

Conjecture 1.8 — Langevin

v1.3 research notes

Given an increasing sequence $n_1<n_2<\cdots<n_k$ of positive integers such that $n_1,n_2,\ldots,n_k$ are multiplicatively dependent, there exists a p...

L3
Graph Theory
AMR-086-0008
Open

Conjecture 1.9

v1.3 research notes

Fix a positive integer $m$ for which the equation $$ m^2 + m_1^2 + m_2^2 = 3 mm_1m_2 $$ has a solution in positive integers $(m_1,m_2)$ with $0<m_1\le...

L3
Graph Theory
AMR-086-0011
Partially Solved

Conjecture 2.3 — Erdős–Dressler

v1.3 research notes

If $a$ and $b$ are two positive integers with $a<b$ and $R(a)=R(b)$ then there is a prime $p$ with $a< p< b$....

L3
Graph Theory
AMR-086-0012
Open

Conjecture 2.4 — Philippon

v1.3 research notes

There exist real numbers $\varepsilon$, $\alpha$ and $\beta$ with $0<\varepsilon<1/2$, $\alpha\ge 1$ and $\beta\ge 0$, and a positive integer $B$, suc...

L3
Graph Theory
AMR-086-0013
Open

Conjecture 2.5 — Lang-Waldschmidt

v1.3 research notes

For any $\varepsilon>0$, there exists a constant $C(\varepsilon)>0$ such that, for any nonzero rational integers $a_1,\ldots,a_m$, $b_1,\ldots,b_m$ wi...

L3
Graph Theory
AMR-086-0016
Open

Conjecture 2.12

v1.3 research notes

Let $\theta$ be real algebraic number of degree at least $3$. Then inequality (2.11) has infinitely many solutions in integers $p$ and $q$ with $q>0$ ...

L3
Graph Theory
AMR-086-0017
Open

Conjecture 2.14 — Mahler

v1.3 research notes

There exists an absolute constant $c>0$ such that $$ \Vert \log a\Vert>a^{-c} $$ for all integers $a\ge 2$....

L3
Graph Theory
AMR-086-0020
Open

Conjecture 3.2 — Roy

v1.3 research notes

Let $k$ be a positive integer, $y_1,\ldots,y_k$ complex numbers which are linearly independent over $\mathbb{Q}$, $\alpha_1,\ldots,\alpha_k$ nonzero c...

L3
Graph Theory
AMR-086-0022
Open

Conjecture 3.4 — Strong Four Exponentials Conjecture

v1.3 research notes

Let $x_1,x_2$ be two $\overline{\mathbb{Q}}$-linearly independent complex numbers and $y_1,y_2$ be also two $\overline{\mathbb{Q}}$-linearly independe...

L3
Graph Theory
AMR-086-0023
Open

Conjecture 3.5 — Strong Five Exponentials Conjecture

v1.3 research notes

Let $x_1, x_2$ be two $\mathbb{Q}$-linearly independent complex numbers and $y_1, y_2$ be also two $\mathbb{Q}$-linearly independent complex numbers. ...

L3
Graph Theory
AMR-086-0024
Open

Conjecture 3.6 — Roy

v1.3 research notes

For any $4\times 4$ skew-symmetric matrix $\mathrm{M}$ with entries in $\mathcal{L}$ and rank $\le 2$, either the rows of $\mathrm{M}$ are linearly de...

L3
Graph Theory
AMR-086-0026
Open

Conjecture 3.8 — Gel’fond

v1.3 research notes

The two numbers $$ \log\alpha\quad\text{and}\quad \alpha^\beta $$ are algebraically independent over $\mathbb{Q}$....

L3
Graph Theory