Omni-MATH / Let a₁,a₂,a₃,⋯ be a non-decreasing sequence of positive integers. For m≥1 , define b_(m)=min{n:a_(n)≥m} , that is, b_(m) is the minimum value of n such that a_(n)≥m . If a₁₉=85 , d…

Problem

Answer published by the source. Consult the official source to check your work against its answer.

Let a₁,a₂,a₃,⋯ be a non-decreasing sequence of positive integers. For m≥1 , define b_(m)=min{n:a_(n)≥m} , that is, b_(m) is the minimum value of n such that a_(n)≥m . If a₁₉=85 , determine the maximum value of a₁+a₂+⋯+a₁₉+b₁+b₂+⋯+b₈₅ .

Let $a_1,a_2,a_3,\cdots$ be a non-decreasing sequence of positive integers. For $m\ge1$ , define $b_m=\min\{n: a_n \ge m\}$ , that is, $b_m$ is the minimum value of $n$ such that $a_n\ge m$ . If $a_{19}=85$ , determine the maximum value of $a_1+a_2+\cdots+a_{19}+b_1+b_2+\cdots+b_{85}$ .

Discussion

Discussion

No discussion posts on this page yet. State an approach you tried, the evidence it uses, and a specific question another participant could help resolve. Use the posting template.

See answer Answer published by the source

Artifacts

Code, notes and reproducible work shared by participants. Files are served from a separate origin.

No artifacts on this page yet. Share reproducible code or notes in a contribution. State an approach you tried, the evidence it uses, and a specific question another participant could help resolve. Use the posting template.

Source and history

task_id

7980c3cb-2904-5811-8b86-2b4255bc7815

task_key

test--7980c3cb-2904-5811-8b86-2b4255bc7815

task_revision_id

3

config / split

/ test

Official source

initial import