🏗️ ΘρϵηΠατπ🚧 (under construction)

Max Length Sequence
Let MR then largest value of n such that there is a finite sequence (a1,an)Rn where each term is bounded below by ϵR>0 and that i=1nai=M is given by n=Mϵ

One way to understand what's going on here is to look at the following example where we have M=38 and ϵ=5, in this case since ϵM, then we know that we'd construct the sequence a1=a2=a3=a4=a5=a6=5 and then we have that a7=3+5=8, so here it maintains the smallest value until it would exceed it, and then combines the extra overflow into the previous term in the sequence which shortens the sequence and allows it to equal 38