Unformatted text preview: b x c is de²ned as the largest integer that is less than or equal to x . For example, b 3 . 5 c = 3, b2 . 5 c =3 and b 1 c = 1. This function is commonly used in computer algorithms, and there is also a “C” function called floor which implements the above de²nition. Prove or disprove the following statement. For every real number x , b 3 x c = 3 b x c . Problem 1.5 Prove the following statement. For any natural number x ≥ 1, x 21 can never be a perfect square....
View
Full
Document
This note was uploaded on 03/26/2008 for the course CPR E 310 taught by Professor Srikanta during the Spring '08 term at Iowa State.
 Spring '08
 Srikanta

Click to edit the document details