Talk:First perfect square in base n with n unique digits: Difference between revisions
Content added Content deleted
(→Optimization when no extra digit required: where is the connection digital sum of start value digital sum solution?) |
|||
Line 365: | Line 365: | ||
val it : int = 1026753849 |
val it : int = 1026753849 |
||
</pre><br>which seems to save the expected two thirds time. This is a little trickier when an extra digit is required because you would have to check each extra digit separately (they would have different Digital Roots).<br>The sequence 1 4 9 7 7 9 4 1 9 1 4 9 7 7 9 4 1 9 1 4 can be produced as (n*n)%9 -> 1 4 0 7 7 0 4 1 0 1 4 0 7 7 0 4 1 0 1 4 for n = 1 to 10 with the usual 0 means 9.--[[User:Nigel Galloway|Nigel Galloway]] ([[User talk:Nigel Galloway|talk]]) 22:03, 27 May 2019 (UTC) |
</pre><br>which seems to save the expected two thirds time. This is a little trickier when an extra digit is required because you would have to check each extra digit separately (they would have different Digital Roots).<br>The sequence 1 4 9 7 7 9 4 1 9 1 4 9 7 7 9 4 1 9 1 4 can be produced as (n*n)%9 -> 1 4 0 7 7 0 4 1 0 1 4 0 7 7 0 4 1 0 1 4 for n = 1 to 10 with the usual 0 means 9.--[[User:Nigel Galloway|Nigel Galloway]] ([[User talk:Nigel Galloway|talk]]) 22:03, 27 May 2019 (UTC) |
||
: ???<BR> |
|||
Is the minimal start value of the square search really decisive / crucial and therefor its digital root?<Br> |
|||
Digital root 1023456789 Base10 is 9. Ok, but the squareroot is not an integer: 31991.5112.. <Br> |
|||
Next integer is 31992. I think the digital root of 31992 is, casting out 9=>base-1 , 3+1+2 = 6 == 31992 % 9 = 6<Br> |
|||
So the start value is 31992**2 = 1023488064.<Br> |
|||
The dgt root should be dgt_root(31992)**2= (6*6) = 36 = 9 , that is true.<Br> |
|||
If there is a connection between the start value and the solution by its digital root, where is it.<Br>--[[User:Horst_h|Horst.h]] |