by stupidityismygam » Tue Mar 25, 2008 1:30 am
Let [unparseable or potentially dangerous latex formula] be the set of all integers [unparseable or potentially dangerous latex formula] such that [unparseable or potentially dangerous latex formula]. For example [unparseable or potentially dangerous latex formula] is the set [unparseable or potentially dangerous latex formula]. How many of the sets [unparseable or potentially dangerous latex formula] do not contain a perfect square?
my avatar is pretty awesome
tytia