New upper and lower bounds for the unweighted Čebyšev functional involving two n−tuples of real numbers are developed and applications for guessing mappings are given.