3,489 problems

  • 0 votes0 replies2 views

    Explicit presentation of the 22-adic absolute Galois group

    Give an explicit profinite presentation of the absolute Galois group Gal(Q2/Q2)\operatorname{Gal}(\overline{\mathbb{Q}}_2/\mathbb{Q}_2).

    Problemsolvednumber-theory
  • 0 votes0 replies5 views

    Erdős Problem #768 — Sylow divisor condition

    If A(x)A(x) counts integers satisfying the Sylow divisor condition, determine the constant cc in A(x)/x=exp((c+o(1))logxloglogx)A(x)/x=\exp(-(c+o(1))\sqrt{\log x}\log\log x).

    Problemsolvednumber-theory
  • 0 votes0 replies5 views

    Erdős Problem #320 — distinct unit-fraction subset sums

    Estimate the number S(N)S(N) of distinct reciprocal subset sums nA1/n\sum_{n\in A}1/n with A{1,,N}A\subseteq\{1,\ldots,N\}.

    Problemopennumber-theory
  • 0 votes0 replies2 views

    Divisibility set for a generalized Euler totient

    Define φk(n)=1an,(a,n)=1ak\varphi_k(n)=\sum_{1\leq a\leq n,(a,n)=1}a^k and Ds={ks:φs(n)φk(n) for every n}\mathcal D_s=\{k\geq s:\varphi_s(n)\mid\varphi_k(n)\text{ for every }n\}. Is D1={1,3,15}\mathcal D_1=\{1,3,15\}?

    Problemsolvednumber-theory
  • 0 votes0 replies2 views

    Erdős Problem #1217

    Let A={a1<a2<}A=\{a_1<a_2<\cdots\} have positive lower logarithmic density. Must it contain a divisibility chain aniani+1a_{n_i}\mid a_{n_{i+1}} such that …

    Problemsolvednumber-theory
  • 0 votes0 replies2 views

    Erdős Problem #1202

    Given ϵ,η>0\epsilon,\eta>0, does some kk force the following? For any primes p1<<pk<n1ϵp_1<\cdots<p_k<n^{1-\epsilon} and any choice of (pj1)/2(p_j-1)/2 residue classes modulo each pjp_j, fewer th…

    Problemopennumber-theory
  • 0 votes0 replies3 views

    Erdős Problem #1148

    Can every sufficiently large integer nn be represented as x2+y2z2x^2+y^2-z^2 with each of x2,y2,z2x^2,y^2,z^2 at most nn?

    Problemsolvednumber-theory
  • 0 votes0 replies1 view

    Erdős Problem #1141

    Are there infinitely many nn such that nk2n-k^2 is prime for every kk coprime to nn with k2<nk^2<n?

    Problemsolvednumber-theory
  • 0 votes0 replies2 views

    Erdős Problem #1138

    Let x/2<y<xx/2<y<x, C>1C>1, and let dd be the largest prime gap below xx. Must π(y+Cd)π(y)Cd/logy\pi(y+Cd)-\pi(y)\sim Cd/\log y?

    Problemopennumber-theory
  • 0 votes0 replies1 view

    Erdős Problem #948

    Can one choose a function ff and a number of colours kk so that every kk-colouring of the integers contains a slowly growing sequence whose finite subset sums omit at least one…

    Problemopennumber-theory
  • 0 votes0 replies1 view

    Erdős Problem #897

    If an additive function satisfies lim supp,kf(pk)/logpk=\limsup_{p,k}f(p^k)/\log p^k=\infty, must lim supn(f(n+1)f(n))/logn=\limsup_n(f(n+1)-f(n))/\log n=\infty? Or even lim supnf(n+1)/f(n)=\limsup_n f(n+1)/f(n)=\infty?

    Problemopennumber-theory
  • 0 votes0 replies1 view

    Erdős Problem #896

    For A,B[1,N]A,B\subseteq[1,N], how many integers can have exactly one factorization m=abm=ab with aAa\in A and bBb\in B?

    Problemopennumber-theory
  • 0 votes0 replies2 views

    Erdős Problem #888

    How large can A[1,n]A\subseteq[1,n] be if every ordered quadruple abcda\leq b\leq c\leq d in AA with abcdabcd a square must satisfy ad=bcad=bc?

    Problemopennumber-theory
  • 0 votes0 replies1 view

    Erdős Problem #871

    If AA is an additive basis of order 2 and its representation count tends to infinity, can AA be partitioned into two disjoint additive bases of order 2?

    Problemopennumber-theory
  • 0 votes0 replies3 views

    Erdős Problem #858

    How large can 1logNnA1/n\frac1{\log N}\sum_{n\in A}1/n be when A[1,N]A\subseteq[1,N] contains no relation at=bat=b whose multiplier tt has least prime factor greater than aa?

    Problemopennumber-theory
  • 0 votes0 replies1 view

    Erdős Problem #851

    For every ϵ>0\epsilon>0, is there a bounded rr such that integers of the form 2k+n2^k+n, with nn having at most rr prime factors, have density at least 1ϵ1-\epsilon?

    Problemopennumber-theory
  • 0 votes0 replies1 view

    Erdős Problem #848

    Is the largest subset A[1,N]A\subseteq[1,N] for which ab+1ab+1 is never squarefree attained by the residue class 7(mod25)7\pmod{25}?

    Problemopennumber-theory
  • 0 votes0 replies1 view

    Erdős Problem #729

    For each constant C>0C>0, are there infinitely many a,b,na,b,n with a+b>n+Clogna+b>n+C\log n such that the denominator of n!/(a!b!)n!/(a!b!) has only bounded prime factors?

    Problemsolvednumber-theory
  • 0 votes0 replies1 view

    Erdős Problem #694

    If fmax(n)f_{\max}(n) and fmin(n)f_{\min}(n) are the largest and smallest solutions of ϕ(m)=n\phi(m)=n, how large can fmax(n)/fmin(n)f_{\max}(n)/f_{\min}(n) be for nxn\leq x?

    Problemopennumber-theory
  • 0 votes0 replies1 view

    Erdős Problem #690

    For fixed kk, is the density dk(p)d_k(p) of integers whose kkth-smallest prime factor is pp unimodal as pp ranges over the primes?

    Problemopennumber-theory
  • 0 votes0 replies1 view

    Erdős Problem #543

    For a finite abelian group GG of order NN, let f(N)f(N) be the smallest size of a random subset that generates every element as a subset sum with probability at least 1/2. Is…

    Problemsolvednumber-theory
  • 0 votes0 replies2 views

    Erdős Problem #457

    Is there ϵ>0\epsilon>0 such that infinitely many nn have every prime p(2+ϵ)lognp\leq(2+\epsilon)\log n dividing 1ilogn(n+i)\prod_{1\leq i\leq\log n}(n+i)?

    Problemopennumber-theory
  • 0 votes0 replies1 view

    Erdős Problem #401

    Can one find a function f(r)f(r)\to\infty such that infinitely many nn admit a1+a2>n+f(r)logna_1+a_2>n+f(r)\log n while a1!a2!a_1!a_2! divides n!2n3nprnn!2^n3^n\cdots p_r^n?

    Problemsolvednumber-theory
  • 0 votes0 replies1 view

    Erdős Problem #397

    Are there only finitely many identities i(2mimi)=j(2njnj)\prod_i {2m_i\choose m_i}=\prod_j {2n_j\choose n_j} when all the mim_i and njn_j are distinct?

    Problemsolvednumber-theory
  • 0 votes0 replies1 view

    Erdős Problem #380

    Call [u,v][u,v] bad when the greatest prime factor of umvm\prod_{u\leq m\leq v}m occurs with exponent greater than 1. Is the count of integers up to xx lying in a bad interval asymptot…

    Problemsolvednumber-theory