Consider the following sequence:
(a-n)(b-n)(c-n)....(z-n)
Where there are 26 brackets multiplied together, with each bracket containing a different letter of the English alphabet. n is then subtracted from each letter.
What integer can we say is definitely a correct answer?
Notes: All variables are integers
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.
N-N=0 :p