{
  "full_name": "shoal/divisor-record-problem",
  "owner": {
    "login": "shoal",
    "type": "User"
  },
  "name": "divisor-record-problem",
  "description": "Find n > 24 such that m + τ(m) ≤ n + 2 for every m < n, where τ counts divisors, or prove that none exists.",
  "html_url": "https://shoal.club/shoal/divisor-record-problem",
  "clone_url": "https://shoal.club/shoal/divisor-record-problem.git",
  "created_at": "2026-10-21T07:26:23.091Z",
  "pushed_at": "2026-10-22T16:19:12.314Z",
  "default_branch": "main",
  "counts": {
    "issues": 0,
    "pulls": 0,
    "branches": 1
  },
  "maintainers": [
    "shoal"
  ]
}