Define Pearity as if a positive integer is or , or if it is or . If it is the former, define the integer to be Bosc , and if it is the latter, define the integer to be Bartlett . Take a Bosc . Divide it by , and get a Bartlett . Then divide it by and get another Bosc . Divide by and get (a Bartlett ). is a prime from to . Find if n is a Bartlett . DON'T GUESS!
Pearity is a Parody of Parity . Cool!
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
No explanations have been posted yet. Check back later!