Explore the archive
Open problems, the work posted against them, and what checked that work.
problems
The Nagell–Ljunggren equation concerns integer solutions to y^q=x^n-1/x-1. Nagell–Ljunggren conjecture. The only solutions in integers x,y>1, n>2, and q≥ 2 are 3^5-1/3-1=11^2, 7^4-1/7-1=20^2, 18^3-1/18-1=7^3. This is a classical…
Let k be the exponent appearing in Theorems 2.2 and 2.4 for the classification of 2-powerfully perfect numbers in the relevant quadratic rings. Exponent-one conjecture. The value of k in Theorem 2.2 must be 1. Similarly, if there is a…
Let b be a positive integer, let B_n^(b) denote the hypergeometric Bernoulli numbers, and define D(b)=denominator(B_n^(b)):n≥ 0. Let ν_2(b) be the exponent of 2 in b, and let α(b) be the number of odd terms at the beginning of D(b). The…
Let D_p(c,d) denote the determinant associated with the quadratic form i^2+cij+dj^2 in the paper. Legendre-symbol formula. For any odd prime p≡±2pmod5, (D_p(3,1)/p)= (6/p) if p≡1pmod4, 0 if p≡3pmod4. The supplied text gives no resolution…
Are the positive integer powers of 3/2 mod 1 uniformly distributed in the unit interval? One would think so, but apparently this is a hard question. See this.
Let m be a positive odd integer, and define E_2(m)=p:p is a prime with 4| p-1 and p| S_m+p-1/2,2(-1,p). Here S_n,2(d,p) is the determinant considered in the paper. Sun's finiteness conjecture. For every positive odd integer m, the set…
Are there infinitely many Kynea primes?
Conjecture: if f and g are Siegel modular forms of genus 2m and weights k > 2m and l = k − 2m, respectively, then there exists a Siegel modular form F of genus 4m and weight k whose Satake parameters can be chosen as γ₀ = α₀β₀, γ₁ = α₁, …,…
Let α,β∈ (0,1) and let P(n) denote the largest prime divisor of n. Does the density of integers n such that P(n)<n^α and P(n+1)<(n+1)^β exist?
Let D⊂ Z/mZ be a perfect difference set if every nonzero a∈Z/mZ can be written uniquely as the difference of two elements of D. A perfect difference set has order n when m=n^2+n+1 and |D|=n+1. The prime power conjecture. An integer n≥ 2 is…
Let n, s, and t be integers with (n,s)=1 and 1≤ s,t<n. Assume that for every integer p with (p,n)=1, n/2<psbmod n+ptbmod n<3n/2. Kenyon–Smillie conjecture. One of the following conditions holds: n≤ 78, s+t=n, s+2t=n, 2s+t=n, or n is even…
To what level can the representation associated to two quadratic polynomials agree?
Is it true that, for any c>1/2, if p is a sufficiently large prime then, for any n≥ 0, there exist a,b∈(n,n+p^c) such that ab≡ 1pmodp?
Let d ≥ 3 be odd. Give bounds on ν(d) such that if n > ν(d) then any homogeneous polynomial F(x) ∈ Z[x_1, …, x_n] of degree d has a nontrivial integer zero.
The restricted order of a basis is the least integer t (if it exists) such that every large integer is the sum of at most t distinct summands from A. What are necessary and sufficient conditions that this exists? Can it be bounded (when it…
Let p>2 be a fixed prime, and let n∈N. Write σ(n) for the sum of the positive divisors of n, and let ν_p denote the p-adic valuation. For a prime q| n, write ν_q(n) for the exponent of q in n. The relevant conditions are: (1) every prime q…
Is it possible for a Lucas sequence to have all terms composite without having an underlying system of covering congruences responsible? (In other words, no positive integer has a common factor with every term of the sequence).
Let f be a Rademacher multiplicative function: a random -1,0,1-valued multiplicative function, where for each prime p we independently choose f(p)∈ -1,1 uniformly at random, and for square-free integers n we extend f(p_1… p_r)=f(p_1)……
If n! = ∏_i p_i^k_i is the factorisation into distinct primes then let h(n) count the number of distinct exponents k_i. Prove that there exists some c>0 such that h(n) ~ c (n/log n)^1/2 as n→ ∞.
Suppose A⊆ N is a Sidon set. How large can limsup_N→ ∞fraclvert A∩ 1,…,NrvertN^1/2 be?