[calcmogul]

It now uses tighter bounds based on the dynamics.

main:

Searching N ∈ [8, 250] for minimum fuel use
        N ∈ [8, 250] -> N = 158: feasible, cost = 620.366713731573
        N ∈ [8, 250] -> N = 101: feasible, cost = 432.2009483032653
        N ∈ [8, 158] -> N = 65: infeasible
        N ∈ [65, 158] -> N = 123: feasible, cost = 496.55269957821685
        N ∈ [65, 123] -> N = 87: feasible, cost = 431.17773996895164
        N ∈ [65, 101] -> N = 79: infeasible
        N ∈ [79, 101] -> N = 92: feasible, cost = 423.38940879405976
        N ∈ [87, 101] -> N = 95: feasible, cost = 424.4409362788282
        N ∈ [87, 95] -> N = 90: feasible, cost = 424.4710704510087
        N ∈ [90, 95] -> N = 93: feasible, cost = 423.42746165831375
        N ∈ [90, 93] -> N = 91: feasible, cost = 423.70121982647333
N = 92: feasible, cost = 423.38940879405976

this PR:

Searching N ∈ [83, 168] for minimum fuel use
        N ∈ [83, 168] -> N = 136: feasible, cost = 541.7492605963527
        N ∈ [83, 168] -> N = 116: feasible, cost = 473.05718635338076
        N ∈ [83, 136] -> N = 103: feasible, cost = 435.7829475630767
        N ∈ [83, 116] -> N = 95: feasible, cost = 424.4409362788282
        N ∈ [83, 103] -> N = 90: feasible, cost = 424.4710704510087
        N ∈ [90, 103] -> N = 98: feasible, cost = 427.6379984789491
        N ∈ [90, 98] -> N = 93: feasible, cost = 423.42746165831375
        N ∈ [90, 95] -> N = 92: feasible, cost = 423.38940879405976
        N ∈ [90, 93] -> N = 91: feasible, cost = 423.70121982647333
N = 92: feasible, cost = 423.38940879405976