{"paper":{"title":"Solving the Hard Problem of Bertrand's Paradox","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math-ph","math.MP","math.PR","quant-ph"],"primary_cat":"physics.hist-ph","authors_text":"Diederik Aerts, Massimiliano Sassoli de Bianchi","submitted_at":"2014-03-08T19:31:30Z","abstract_excerpt":"Bertrand's paradox is a famous problem of probability theory, pointing to a possible inconsistency in Laplace's principle of insufficient reason. In this article we show that Bertrand's paradox contains two different problems: an \"easy\" problem and a \"hard\" problem. The easy problem can be solved by formulating Bertrand's question in sufficiently precise terms, so allowing for a non ambiguous modelization of the entity subjected to the randomization. We then show that once the easy problem is settled, also the hard problem becomes solvable, provided Laplace's principle of insufficient reason i"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1403.4139","kind":"arxiv","version":2},"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"}