CD, what function does the # symbol represent? Is there a theorem / hypothesis yet which states 1571 is the only prime of that form? or disprove it?
The # sign is like ! except that n! means multiply all numbers less than or equal to n, while n# means multiply all
prime numbers less than or equal to n. So 1571, in plain English, is equal to all composite numbers less than 1571 multiplied together, added to 1, and then divided again by 1571. As for whether this is proven, I doubt it... the wording seems to imply that it isn't proven. It may not even be a conjecture.