by stupidityismygam » Wed May 05, 2010 5:47 am
A permutation of the set of positive integers [unparseable or potentially dangerous latex formula] is a sequence [unparseable or potentially dangerous latex formula] such that each element of [unparseable or potentially dangerous latex formula] appears precisely one time as a term of the sequence. Let [unparseable or potentially dangerous latex formula] be the number of permutations of [unparseable or potentially dangerous latex formula] for which [unparseable or potentially dangerous latex formula] is a perfect square for all [unparseable or potentially dangerous latex formula] Find with proof the smallest [unparseable or potentially dangerous latex formula] such that [unparseable or potentially dangerous latex formula] is a multiple of 2010.
my avatar is pretty awesome
tytia