Talk:Steady squares: Difference between revisions

m
Thanks to Pete Lomax
m (Thanks to Pete Lomax)
Line 27:
1000557423423230896109004106619977392256259918212890625^2 = 10011151575673345586...92256259918212890625 (109 digits)
::is a triple-zero-fill, and I've found examples all the way up to (a quite random) 548 digit n with a 1096 digit square. --[[User:Petelomax|Pete Lomax]] ([[User talk:Petelomax|talk]]) 15:49, 21 December 2021 (UTC)
:::Pete you were right.My first thought was, there where only a finite set of steady squares.<br>Thanks for showing, that prepending 1..x zeros ( and increasing Pot10 the same way ) to n, which is generating a stead square, lets n*n still be a steady square.<br>I am happy for not writing "proof" ;-) --[[User:Horst.h|Horst.h]] ([[User talk:Horst.h|talk]]) 10:32, 22 December 2021 (UTC)
Anonymous user