I did 2 3 5 7 11*13 - 1
Primel 20 6/6 ⬜⬜⬜30029 ⬜⬜⬜⬜12347 ⬜⬜⬜⬜33331 ⬜⬜⬜⬜13337 86539 65839
Primel – guess a 5 digit prime number – each guess must be a prime
81–90 of 139 posts
Re: Primel – guess a 5 digit prime number – each guess must be a prime
#82Re: Primel – guess a 5 digit prime number – each guess must be a prime
#83https://gist.github.com/nickponline/9a3fb1ee5333c52ed195625e...
Re: Primel – guess a 5 digit prime number – each guess must be a prime
#84Anyway, this is a really cool example of that. It's wordle, but with a twist.
Re: Primel – guess a 5 digit prime number – each guess must be a prime
#85My side-project this week has been searching for an optimal Wordle strategy. I figured it would make a great blog post but I haven't got that far yet. Step 1 is to find an optimal starting word. My most insightful finding so far has came from trying to define a cost function for comparing potential starting words. It turns out that "% of potential guesses [not] eliminated" is an excellent loss function. Importantly,…
Re: Primel – guess a 5 digit prime number – each guess must be a prime
#86So are people just really good with numbers? I don't know any 5 digit primes nor do I know a way to calculate them on the fly.
Its a weird thing where in smaller scales, primes numbers that LOOK prime are decent candidates of actually being prime.
This assumes that you can easily identify - multiples of 2 and 5 (by their last digit) - multiples of 3 (the sum of their digits is divisible by 3) - multiples of 11 (for two-digit ones, they have both digits the same: 11, 22, 33, ..., 99) - squares
So the first number that looks prime but isn't is the product of the two smallest primes that aren't "easy", which is 7*13 = 91.
Re: Primel – guess a 5 digit prime number – each guess must be a prime
#87Re: Primel – guess a 5 digit prime number – each guess must be a prime
#88My side-project this week has been searching for an optimal Wordle strategy. I figured it would make a great blog post but I haven't got that far yet. Step 1 is to find an optimal starting word. My most insightful finding so far has came from trying to define a cost function for comparing potential starting words. It turns out that "% of potential guesses [not] eliminated" is an excellent loss function. Importantly,…
But there is a better strategy (similar to what is used in those interview puzzles of "From N weights, find 1 that is different in X measurements of a scale): The fact that you input some vowels and see that they are not in there, tells you that the remaining ones MUST be in the word (treating Y as a vowel as well). So it might be possible to come up with a strategy that uses that negative information as well to minimize the search space.
Re: Primel – guess a 5 digit prime number – each guess must be a prime
#89Can't work out how to play again.
Re: Primel – guess a 5 digit prime number – each guess must be a prime
#90So are people just really good with numbers? I don't know any 5 digit primes nor do I know a way to calculate them on the fly.
primes 10000 99999 | less
Then recall that "less" includes a regex-based search on the / key.This doesn't give you direction as to the best to try, of course, but it's hard to beat it in terms of bang for the buck if you're just going to try a few.