Skip to main content
OlympiadHQ

Browse · MATH

Print

jmc

number theory senior

Problem

How many positive integers satisfy(Recall that is the greatest integer not exceeding .)
Solution
First notice that the graphs of and intersect at 2 points. Then, notice that must be an integer. This means that n is congruent to . For the first intersection, testing the first few values of (adding to each time and noticing the left side increases by each time) yields and . Estimating from the graph can narrow down the other cases, being , . This results in a total of cases.
Final answer
6