You are not logged in.
Hi thickhead;
I saw the factorial answer first and then checked it with the same diagonal method as yours.
From there I extracted the primes as , checked that against my factorial answer, and then applied (a+1)(b+1)(c+1)(...+1) to the exponents to get 770515200.And I also tried it in M, in various ways:
M gave an error message that I don't understand, but otherwise it all works.
Hi thickhead;
I get 770515200, based on the same product as Bobby's, which I got from:
Another perspective...
Hi thickhead;
patchy1 wrote:Numbers can't repeat in any given row or column (like sudoku).
That would only apply to the eight odd-lettered/numbered rows and columns, I suppose.
Yes that's right
Row F is one of the six even-lettered/numbered rows and columns, so repeats in that row are allowed.
'4' is also repeated in column 6 of post #12's solution, but as that column is even-numbered, it is allowed too.
Hi all;
This formula works (it's based on the one given by noelevans in post #2 of the other thread for this puzzle):
Mod(Mod(n,n-r),9)
n = a 3-digit number
r = n's row number (first row = 0)
eg,
Table 1, row 0:
Mod(Mod(856,856-0),9) = 0
Table 2, row 8:
Mod(Mod(539,539-8),9) = 8
Table 3, row 9:
Mod(Mod(273,273-9),9) = 0
My Excel table, with the 1-digit entries being results using my formula:
I had tried to solve it with base 9, but couldn't do it. However, that inspired the Mod 9 addition to noelevans' formula.
This puzzle was posted by patchy1 way back on 8 July 2012, here.
From that thread's first post:
In the 18 examples in the first two boxes below, a simple arithmetic operation on the 3-digit numbers leaves you with the 1-digit numbers. I need to figure out the required simple operation, and translate the ten numbers in the third box into the lettered solutions.
Clues:
A giveaway clue - there can be no 9's in the solution.
The arithmetic operation has two parameters - the given number and another number that is not the same for every case
- and you are looking at it.
Ditto! You know how tight my BASIC programming was because of my poor little Sharp PC-1500 with its 8KB memory that I squeezed everything into but the kitchen sink!! It ran red hot!
0*1*2+3+4-5+6+7*8*9 = 512
Have to go now...catch you later.
Time for a new new one already, then, if it struggles with tidbits!
0*1-2+3+4-5+6+7*8*9 = 510
Hi Bobby;
Correct!
I knew you'd get it. I tried to give you a bit more to do with this one, though. Did I?
0*1+2-3+4-5+6+7*8*9 = 508
Yes, I realise that the remainders (their given figures) are set in concrete...and their given order probably is too.
I wonder, though, if the dividends must also retain their given order. Maybe pairings can be reordered: eg, {752,452} mod 1 then has a common remainder 0. But that approach might upset plans for finding a common rule that can also be applied to table 3.
All numbers except {751,452} agree.
All pairings other than {751,452} have single-digit remainders. That pairing's smallest common remainder (other than for mod 1) is 10, for mod 13.
I can find a listed pairing for each remainder, other than for remainder 5. And it's not possible for all the other remainders to be from different single-digit divisors (though it's not a stated condition), as one of the divisors must be double-digit.
Hi thickhead;
I had done something similar when I first looked at this problem and drew up two tables in Excel with 143 columns each (143 being the smallest number seemed to be as good a reason as any to stop there). There are 9 rows, as in the OP's first two tables.
My first table was for identical divisors in each column...which gave a jumbled-looking mess of results.
My second table was the one I mentioned in my previous post (incremented by 1 per row), but stretched out to 143 columns. That gave me the result I posted, which was the one that gave the most hope of containing something meaningful.
Your results appear in my second table.
That table also gave a bit of a sequence in column 6:
{343,143} mod 8 = 7;
{652,985} mod 9 = 4;
{977,327} mod 10 = 7;
{447,678} mod 11 = 7.
But I can't make anything of it, nor of anything else in my two tables.
It works well!
0*1+2+3-4-5+6+7*8*9 = 506
A puzzle:
Each letter in the sum stands for a different single-digit number from 0 to 9.
Find the letter values. The puzzle has a unique solution.
Hi Bobby;
Correct!
Does your code solve the whole thing, including the square root and factorial components?
0*123456+7*8*9 = 504
But that one's not the puzzle...the one underneath it is, starting with a square root.
I've now changed the first equation to numeric form, as it doesn't need to be in word form. I had it in word form because that's how I did the other puzzle in post #486, and my mind was still back there when I was making the new puzzle.
0*1-2+3-4-5+6+7*8*9 = 502
2*9+6-7-5*1*0+483 = 500
A puzzle:
Correct!
How would you have worded the section that stumped you? It made sense to me, but familiarity no doubt was my enemy.
Compared to my others, this one had an extra little trick up its sleeve that I'd hoped would foil the unwary for a bit. Excluding you, of course!
0+1+2-3-4*5+6+7*8*9 = 490
0-1+2-3-4*5+6+7*8*9 = 488
Hi Bobby;
There are 19 letters in the five words of my sum: ONE, TWO, FIVE, SEVEN and NINE.
Just add up all 19 values of each of the several options you haven't weeded out yet, and the total of one of them will be a factor of 486...and that one's your answer.
Have to go back outside again, into the mud. Fixing a very old retaining wall and also redirecting stormwater. May not be back till dark.
Why does the title mention modular arithmetic?
In my tables 1, 2 and 3, the second column ('Me') shows the result of modular division on the first column ('3-digit') by the corresponding number in the 'Posn' list, with the results in the second column of tables 1 and 2 giving a reasonable success rate of 13 answers (out of a possible 18) that are the same as those of the OP's. So it seems to me that this modular rule will feature somehow in the solution.
I suppose we need to find a rule that applies to tables 1 and 2 and by which we can solve table 3's letter values...which may not necessarily bear any resemblance to the respective values in tables 1 and 2. Table 3 lists 1 more item than the other tables, but the modular rule caters for that.
| 1 | 2 | 3
--------------------------------------------------------------
| 3-digit 1-digit | 3-digit 1-digit | 3-digit 1-digit
Posn | Me OP | Me OP | Me OP
--------------------------------------------------------------
1 | 856 0 0 | 215 0 0 | 561 0 A
2 | 176 0 1 | 785 1 1 | 381 1 B
3 | 751 1 2 | 452 2 2 | 937 1 C
4 | 343 3 3 | 143 3 3 | 334 2 D
5 | 652 2 4 | 985 0 4 | 716 1 F
6 | 977 5 5 | 327 3 5 | 890 2 G
7 | 447 6 6 | 678 6 6 | 414 1 H
8 | 583 7 7 | 831 7 7 | 106 2 J
9 | 296 8 8 | 539 8 8 | 677 2 K
10 | | 273 3 L
0!+ONE+TWO+3-FIVE+SEVEN-NINE+486 = 486
Substituting numbers for the corresponding words (of which there are 5) yields the post number.
A puzzle:
Each letter in the above sum stands for a different single-digit number from 0 to 9 (excluding the number 2).
The sum of the values of all 19 letters is a factor of 486.
Find the letter values. The puzzle has a unique solution.
Edit: My apologies to anyone who started solving the previous puzzle in this post, but this one's much better.
0*1*2-3-45+6+7*8*9 = 462
0-1+2-3+456+7-8+9 = 462
0+1-2-3+456-7+8+9 = 462
0-1+2-3+456+7-8+9 = 462
0+12-345+6+789 = 462
0+1+2+345+6*7+8*9 = 462
0-1-2-3+4+56*7+8*9 = 462
0+1-2+3-4+56*7+8*9 = 462
0*1-23+4+56*7+89 = 462
0+123*4-5-6*7+8+9 = 462
0+12-3-45-6+7*8*9 = 462
0*1-2+3+4-56+7*8*9 = 453
0*1+2-3+4-5+6+7*8*9 = 450