Message board for the users of flat assembler.
> Heap > number based riddle
Goto page Previous 1, 2
I think it's correct. I just have one trivia to add.
It comes from the number 10101 being divisible by 7, that any pair of digits repeated three times will give you a number divisible by 7. And thus any pair of digits repeated 3*n times will also give you a number divisible by 7.
Factorization of the number 131313:
|19 Feb 2012, 16:56||
Coming back to the original puzzle. Its interesting how differently people approach a problem.
Actually the solution to this and similar puzzles (i.e. number-crossword puzzle) goes like this:
6666, 9999, 0000 are all 4 so 0, 6 or a 9 equals 1.
8809 = 6 so x+x+1+1=6, x = 2
2171 = 0 so 1, 2, 7 are all equal to 0.
5555 = 0, ergo 5 = 0
2581 = 0+0+2+0 = 2
The answer is 2
|20 Feb 2012, 12:01||
Madis731: Why did you assume a simple addition operator? And why only taking symbols singly at a time? Perhaps some symbols are negative values?
There are actually an infinite number of possible solutions. Although most of them will be incredibly complex they would still be valid solutions.
|20 Feb 2012, 12:04||
|Goto page Previous 1, 2
< Last Thread | Next Thread >
Copyright © 1999-2020, Tomasz Grysztar. Also on YouTube, Twitter.
Website powered by rwasa.