24
votes
Accepted
Are you radical enough to solve this SURDOKU?
Surd-lution (sorry :P):
To start:
Now the step by step:
1:
2:
3:
4:
5:
6:
- 60.6k
14
votes
Accepted
8
votes
Can you make 39 using the numbers 5 4 3 2 1 in that order?
Depending on what the meaning of division is:
regular division
or
division rounds down
- 6,285
7
votes
Fill the grid subject to product, sum and knight move constraints
First find a place for 19:
Then for 17:
Then for 18:
For 11, 12, 13:
For 14, 15, 16:
Continuing:
The completed grid:
- 15.4k
7
votes
Accepted
Why did the general choose this as the exact time of attack?
I think he wanted to attack at:
If we were to put that time on an analog clock:
I'm not entirely satisfied with this answer, but I feel like I'm on the right trail...
- 8,333
5
votes
Fill the triangular grid using the digits 1-9 subject to the constraints provided
Solution:
Solving Path
- 11k
4
votes
General Approach to Solving Cryptarithms
Unless you count things like "use a computer to just try all the possibilities", I don't think there's any really systematic approach. But here are some things I do when solving cryptarithms....
- 120k
4
votes
Accepted
4
votes
Fill the grid subject to product, sum and knight move constraints
You can solve the problem via integer linear programming as follows. For $i,j\in\{1,\dots,5\}$ and $k\in\{1,\dots,20\}$, let binary decision variable $x_{ijk}$ indicate whether cell $(i,j)$ takes ...
- 14.3k
3
votes
Fill the triangular grid using the digits 1-9 subject to the constraints provided
Gave it a try in "hard mode", where the two knowledge-ish diagonals (MCCCXCVIII and Fahrenheit) are not used in the solving process. It turns out that it is indeed possible to find the ...
- 16.3k
2
votes
General Approach to Solving Cryptarithms
As Gareth's post is close to unbeatable and I think it would be nice to have one authoritative comprehensive answer, this cw is for donations which Gareth may or may not choose to incorporate in his ...
Only top scored, non community-wiki answers of a minimum length are eligible