Timeline for Digit summation of squared numbers
Current License: CC BY-SA 4.0
11 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Mar 6, 2020 at 19:19 | comment | added | Shahrooz | @Robert Israel I did not find relevant thing! | |
| Mar 6, 2020 at 17:24 | comment | added | Robert Israel | @ShahroozJanbaz You didn't find the links or you didn't find anything relevant in them? | |
| Mar 6, 2020 at 15:35 | comment | added | Shahrooz | Wow, I was not born 45 years ago. Anyway, thank you for your comment. I found some references for this conjecture. | |
| Mar 6, 2020 at 15:28 | comment | added | user6976 | I do not know reference. I tried to solve the problem 45 years ago. | |
| Mar 6, 2020 at 15:23 | comment | added | Shahrooz | Dear Mark Sapir, you are right. Is there any chances that for large $n$ we can assume identical distribution for digits in the squared numbers? Would you give any references for your claim and also for your conjecture? | |
| Mar 6, 2020 at 14:49 | comment | added | user6976 | Digits of squares are very difficult to control. That is why it is easy to formulate such problems and hard to solve them. For example an old unsolved (as far as I know) problem asks if there are squares which are not powers of 10 and whose digits are 1 and 0. | |
| Mar 6, 2020 at 7:34 | comment | added | Shahrooz | Dear Israel, I did not find something there. Am I did wrong search? | |
| Mar 6, 2020 at 7:30 | comment | added | Shahrooz | Dear Mark, I am familiar with that method which you mentioned. But, I can not see how we can use it for this question! | |
| Mar 6, 2020 at 7:19 | comment | added | Mark Schultz-Wu | This is loosely related to an early proposed (by Von Neumann) pseudo-random number generator the Middle square method, which would square an $n$ digit number (producing a $2n$ digit number), extract the middle $n$ digits, then iterate. Some cryptanalysis of this could theoretically be based on understanding the digits of the square of a number, but I'm unfamiliar with it. | |
| Mar 6, 2020 at 2:58 | comment | added | Robert Israel | You might start by looking at the links at OEIS sequence A004159. | |
| Mar 5, 2020 at 23:38 | history | asked | Shahrooz | CC BY-SA 4.0 |