Problem 603

Convex path in square

Problem 605

Convex path in square

Problem 604

Let be the maximum number of lattice points in an axis-aligned square that the graph of a single strictly convex increasing function can pass through.
You are given that , , , , and .
Below is the graph of a function reaching the maximum 3 for
:
p604_convex3.png
Find .