This challenge is quite simple to conceptualise, but likely a lot harder to execute.
In this challenge, the program will have to detect the number N of its characters that have been randomly changed (at least half of the program will always remain). Then, it will have to output the Nth prime number.
A 'change' can only be the replacement of a character. You can assume it will always be replaced by something within your own language's alphabet.
- Only half of your program (rounded down to fewer changes, if necessary) will ever be hit by radiation.
- Standard output formats apply.
- The prime number must always be correct. Regarding the 'Nth' prime, N can be 1- or 0-indexed.
- 1 is not a prime number!
- If nothing (or only 1 character, if you choose to make N 1-indexed) is changed, output 0/null/any falsey value.
- This is code-golf, so shortest answer in bytes wins.
- Standard loopholes apply.