We show that the alternating sum of the floor function of , with ranging from 1 to , has an easy evaluation for all odd integers . This is in contrast to known non-alternating sums of the same type that hold only for a class of primes. The proof is elementary and was suggested by an AI model. To put this result in perspective, we also prove an asymptotic expression for the analogous sum without the floor function.