{"paper":{"title":"Some experiments with Ramanujan-Nagell type Diophantine equations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NT","authors_text":"Maciej Ulas","submitted_at":"2014-09-29T14:24:48Z","abstract_excerpt":"Stiller proved that the Diophantine equation $x^2+119=15\\cdot 2^{n}$ has exactly six solutions in positive integers. Motivated by this result we are interested in constructions of Diophantine equations of Ramanujan-Nagell type $x^2=Ak^{n}+B$ with many solutions. Here, $A,B\\in\\Z$ (thus $A, B$ are not necessarily positive) and $k\\in\\Z_{\\geq 2}$ are given integers. In particular, we prove that for each $k$ there exists an infinite set $\\cal{S}$ containing pairs of integers $(A, B)$ such that for each $(A,B)\\in \\cal{S}$ we have $\\gcd(A,B)$ is square-free and the Diophantine equation $x^2=Ak^n+B$ h"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.8132","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"}