3 + 0 + 0 + 8 + 2 = 13

]]>I asked this problem long time back when I was young.

Oh really? Actually I heard this problem from my friend.

]]>On the bitcointalk form: https://bitcointalk.org/index.php?topic=2346692

In summary:

Step 1: Convert the Chinese symbols to closest sounding letters + convert the Greek characters directly.

Step 2: Convert each character to its position in the alphabet.

(The spelling of 'crypto' was a red herring. The Greek character Kappa needed to remain K for the sums to work, but it would have been tempting to use 'c' and therefore 3 in the sums rather than 11.)

Step 2b: Sum the three intersecting rows and columns to get 68, 45 + ?, 90.

Step 3: Identify the mathematical sequence 68, 79, 90. Steps of 11. (Prime number) OR use the hint of 45 = 90/2 that ? = 68/2. Either way, ? = 34 mathematically.

Step 4: The numbers used in the sums must be converted FROM some algebraic form. Of the many possibilities, the only one that involved an operation with a 2 (a prime and the only number used in the original puzzle) and another prime number (in fact, the first clearly visible prime on the other side of the coin, 17) was 2Q.

Thanks to anyone who went over to the bitcointalk forum and participated.

iQCash will do more contests in the future, but the focus for the next few months will be the launch of the iQCash puzzles Round 1.

Round 1 will present 8 million super easy puzzles.

Round 2 will present 4 million slightly harder puzzles, and so forth until there's only a small number of super difficult puzzles/problems left.

iQCash is a long term cryptocurrency project. It will take time and a huge collective amount of human brain power to solve the bulk of the puzzles. If people value that (and the later problems it will potentially solve) maybe it will be valued on equal or better terms than Bitcoin and its massive expenditure of electrical power.

]]>I only found 13 solutions to your alternative puzzle.

A unique solution exists with the constraint, "The value of the sum's first letter ('D') is a prime number".

Another alternative puzzle, ALPHA - BETA - GAMMA = DELTA, has 4 solutions. A unique solution exists with the constraint, "The value of the sum's first letter ('D') is an odd prime number".

]]>Welcome to the forum.

There is an entire "family" of straight lines where 7x+ 11y = something.

They are all parallel and as N gets bigger the lines move away from the origin. Joining (11,0) to (0,7) will produce one. What is N for this case?

That should give you a starting point.

Bob

]]>Tommy opens his bottle and begins drinking the soda. But when I open my bottle, it was frozen solid. I complained.

What happened?

]]>You've posted this as an exercise, but you've made it seem more like a help me problem. There's a difference: If it's an exercise, then members have a go for fun and maybe just post an answer. If it's a help me, then much more explanation would be provided and the 'student' encouraged to do some / most of the working themselves. Please clarify.

Bob

]]>Of course, I could be wrong... but it's a place to start. Let me know if you find it.. I will be unlikely to get to Beijing again to try it.

]]>its cool but just a bit confusing at first.

I was wondering if I should put some explanatory text or something showing how to play. thank you very much for your feedback

]]>ONE:

400:

169,196,961:

9+0:

9-8:

10-9:

81-0:

6^0, 8^0, 9^0, 10^0:

6/6:

8/8:

9/9:

Here are two options that, by making one change to the puzzle in post #6, converts it from unsolvable to one that has a unique solution:

```
Option 1: C1 empty Option 2: G1 empty
1 2 3 4 5 6 7 8 9 1 2 3 4 5 6 7 8 9
A | _ 2 _ | 1 5 _ | _ _ _ | A | _ 2 _ | 1 5 _ | _ _ _ |
B | _ _ 5 | 2 _ _ | _ _ 9 | B | _ _ 5 | 2 _ _ | _ _ 9 |
C | _ _ _ | _ _ 4 | _ 2 5 | C | 3 _ _ | _ _ 4 | _ 2 5 |
|-------+-------+-------| |-------+-------+-------|
D | _ 8 7 | _ _ 2 | 5 _ _ | D | _ 8 7 | _ _ 2 | 5 _ _ |
E | _ 4 _ | _ 1 7 | _ _ _ | E | _ 4 _ | _ 1 7 | _ _ _ |
F | _ _ _ | _ _ 3 | 1 _ 7 | F | _ _ _ | _ _ 3 | 1 _ 7 |
|-------+-------+-------| |-------+-------+-------|
G | 2 _ 4 | 6 _ _ | _ _ _ | G | _ _ 4 | 6 _ _ | _ _ _ |
H | 6 _ _ | _ 9 _ | _ 3 _ | H | 6 _ _ | _ 9 _ | _ 3 _ |
I | _ 5 _ | _ _ _ | 9 6 8 | I | _ 5 _ | _ _ _ | 9 6 8 |
```

Both solutions are easy to find, and are different from each other.

]]>computer runs at about 140,000,000 steps/second, that would take something like 10^18 years. However the constraints reduce this dramatically, so that the whole process only took 470 seconds !

I just use visual basic in Excel, so lower level languages like C++ would no doubt be even faster. The trick is to pick your blank cell loops so that you can use a 30ish cell sum constraint as soon as possible.

I first came across this type of puzzle in a Sudoku forum that I am in, where someone could not solve one of these problems with the first and last rows being completely specified (in addition to the nine 30ish cells).

Well I just love a programming challenge and I looped through the 28 unspecified cells, and found the unique solution in less than perceptible time.

To find other similar puzzles I just did a google search and eventually found this thread, which naturally suggested the 40 blank cell problem which obviously would have multiple solutions.

]]>