Fun puzzle this morning: Suppose you are playing a #wordle-like game where you are trying to guess a three-digit string of numbers (like 318 or 087). What's the maximum number of guesses you would ever need to identify the number string? #math#mathchat
A few people have suggested the maximum number of guesses is 6, but I think you can always do it in 5! (Five, not five factorial.)
First three guesses: 123, 456, 789.
Three hits and you're at most two guesses away by cycling.
Two hits, and a strategically chosen fourth guess involving a hit repeated twice and a 0 will get you there in 5.
Same for one hit.
Zero hits and it's 000.
Funny thing was I had to get green and yellow markers to think this through.
• • •
Missing some Tweet in this thread? You can try to
force a refresh
A short thread about an underappreciated vector: The all 1's vector!
Every vector whose components are all equal is a scalar multiple of the all 1's vector. These vectors form a "subspace", and the all 1's vector is the "basis" vector.
(1/8)
Let's say you have a list of data -- like 4, 7, -3, 6, and 1 -- and you put that data in a vector v. An important question turns out to be "What vector with equal components is most like my vector v?"
(2/8)
To answer that question you can *project* your vector onto the all 1's vector. You can think of this geometrically -- it's kind of like the shadow your vector casts on the all 1's vector. There's also a formula for it that uses dot products.