Answer
You can simply write the definition of the block using the definition from my thought:
// assume that there is a function numbers(a, b) that returns numbers from a to b
function checkPasscode(passcode) {
const allPrimeNumbers = numbers(1, passcode).filter(isPrime);
// If the passcode is a number between the 96th and 97th prime number
// and the passcode is 4 numbers ahead of a specific prime number,
// then the passcode is right.
return (
allPrimeNumbers.length === 96 &&
allPrimeNumbers.at(-1) === passcode - 4
);
}
You can see that if the passcode is 4 numbers ahead the 96th prime number.
Therefore, the passcode is 507.
Source
From my thought:
From this site:
The following table lists the first 1,000 primes, with 20 columns of consecutive primes in each of the 50 rows.
| 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 | 10 | 11 | 12 | 13 | 14 | 15 | 16 | 17 | 18 | 19 | 20 | |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
| 1–20 | 2 | 3 | 5 | 7 | 11 | 13 | 17 | 19 | 23 | 29 | 31 | 37 | 41 | 43 | 47 | 53 | 59 | 61 | 67 | 71 |
| 21–40 | 73 | 79 | 83 | 89 | 97 | 101 | 103 | 107 | 109 | 113 | 127 | 131 | 137 | 139 | 149 | 151 | 157 | 163 | 167 | 173 |
| 41–60 | 179 | 181 | 191 | 193 | 197 | 199 | 211 | 223 | 227 | 229 | 233 | 239 | 241 | 251 | 257 | 263 | 269 | 271 | 277 | 281 |
| 61–80 | 283 | 293 | 307 | 311 | 313 | 317 | 331 | 337 | 347 | 349 | 353 | 359 | 367 | 373 | 379 | 383 | 389 | 397 | 401 | 409 |
| 81–100 | 419 | 421 | 431 | 433 | 439 | 443 | 449 | 457 | 461 | 463 | 467 | 479 | 487 | 491 | 499 | 503 | 509 | 521 | 523 | 541 |
nice
You should blue the passcode so then people who want to give it a try don’t see the answer.
Like this:
The passcode it 507
The passcode is [spoiler]insert passcode[/spoiler]
The second one
The hints are encoded using Unicode.
I can’t solve the second passcode, it’s so hard. maybe another person could help
Hint: It is a 6-digit number starting with 6.
An unexpected answer
Please wrap the answer in [spoiler][/spoiler] as to not reveal it to other users
I wrapped it
The third one
when trying to brute force it (srry, but i dont have the mental capacity for solving stuff like this without brute force), i came upon this error
EDIT: it errors at values >= 10
99 doesn’t error
i know how i can brute force it now… thanks!
nvm, i tried inputting large sequences of 9’s and it didn’t work (the highest i tried before giving up was 10048 9’s)
I just made a script that counts up, tries the number, and moves on if it errors or is incorrect
Its still running. It’s at around 136000 right now
ok, that’s what i was trying to do, but the password tester shouldn’t give errors in the first place!
This might be intentional, but you don’t need to split the password just to get a letter. There’s already special blocks for length and letter for strings

