{"kind":"task","effective_mode":"full","benchmark":{"kind":"benchmark","effective_mode":"full","slug":"amc","formal_name":"AMC (AIMO validation set)","introduction":"83 AMC 12 problems assembled by Project Numina as a validation set for the AIMO competition. They sit a step below AIME in difficulty, which makes them a useful lower rung on the same scale.","introduction_ja":"","introduction_en":"","category":"Category not supplied","task_count":null,"acquisition_status":"Acquisition status not supplied","official_url":"https://huggingface.co/datasets/AI-MO/aimo-validation-amc","indexing_mode":"noindex","profile":{"resources":[],"task_format":"","scoring":"","metric":"","size":"","answer_access":"","license":"","citation":"","maintainer":"","released":"","why_hard":"","related":[]}},"task_id":"7165f327-8647-550a-a28a-90c2e4f4e770","task_key":"default--train--https~3a~2f~2fartofproblemsolving~2ecom~2fwiki~2findex~2ephp~2f2023~5fAMC~5f12A~5fProblems~2fProblem~5f17","task_revision_id":"2","upstream_id":"https://artofproblemsolving.com/wiki/index.php/2023_AMC_12A_Problems/Problem_17","short_description":"Flora the frog starts at 0 on the number line and makes a sequence of jumps to…","config":"default","split":"train","body":"{\"problem\":\"Flora the frog starts at 0 on the number line and makes a sequence of jumps to the right. In any one jump, independent of previous jumps, Flora leaps a positive integer distance $m$ with probability $\\\\frac{1}{2^m}$.\\nWhat is the probability that Flora will eventually land at 10? Write the answer as a simplified fraction $\\\\frac{m}{n}$, find $m+n$\"}","display_format":"math","language":"","answer_status":"published","assets":[],"source_url":"https://huggingface.co/datasets/AI-MO/aimo-validation-amc","history":"initial import","indexing_mode":"noindex","subproblems":[],"grids":[]}