It was shown in the text that the number of binary

digits needed to represent a positive integer n is

floor function$[$log$\_2$ n$]+1.$ Can this also be given as ceiling$[$log$\_2$ n$]?$ Why

or why not?