Talk:First perfect square in base n with n unique digits: Revision history

7 November 2020

• curprev 13:3513:35, 7 November 2020‎ Thundergnat talk contribs‎ m 40,806 bytes 0‎ Thundergnat moved page Talk:First perfect square in base N with N unique digits to Talk:First perfect square in base n with n unique digits: Follow normal task title capitalization policy

2 March 2020

• curprev 23:1923:19, 2 March 2020‎ Thundergnat talk contribs‎ 40,806 bytes +243‎ →‎Incorrect Example: You're right, it's wrong
• curprev 18:2918:29, 2 March 2020‎ rosettacode>Lambertdw‎ 40,563 bytes +87‎ No edit summary

16 July 2019

• curprev 18:1618:16, 16 July 2019‎ rosettacode>Horst.h‎ m 40,476 bytes +452‎ →‎any ideas of optimizations ?: precheck if last n digits lead do multiple same digits
• curprev 17:4417:44, 16 July 2019‎ rosettacode>Horst.h‎ m 40,024 bytes +871‎ →‎any ideas of optimizations ?: speed up adding to base x <127
• curprev 12:1212:12, 16 July 2019‎ rosettacode>Horst.h‎ m 39,153 bytes −19‎ →‎Finding maximal distances to check if number needs extra digit: how to find the values with formula

20 June 2019

• curprev 08:3008:30, 20 June 2019‎ rosettacode>Horst.h‎ 39,172 bytes +1,761‎ Finding maximal distances to check if number needs extra digit

12 June 2019

• curprev 06:4006:40, 12 June 2019‎ rosettacode>Horst.h‎ m 37,411 bytes +754‎ →‎Minimum start for Pascal version: yes, it was a copy and paste error

9 June 2019

• curprev 23:5923:59, 9 June 2019‎ Enter your username talk contribs‎ 36,657 bytes +983‎ →‎Minimum start for Pascal version: possible correction for base 34

8 June 2019

• curprev 06:2106:21, 8 June 2019‎ rosettacode>Horst.h‎ m 35,674 bytes +95‎ →‎Minimum start for Pascal version

7 June 2019

• curprev 19:5019:50, 7 June 2019‎ Enter your username talk contribs‎ m 35,579 bytes +12‎ →‎Minimum start for Pascal version: noted that base 29 also has an issue
• curprev 19:4019:40, 7 June 2019‎ Enter your username talk contribs‎ 35,567 bytes +4,009‎ →‎Minimum start for Pascal version: some help with the base 17 problem
• curprev 04:1404:14, 7 June 2019‎ rosettacode>Horst.h‎ m 31,558 bytes +400‎ →‎Minimum start for Pascal version: thanks

6 June 2019

• curprev 20:0820:08, 6 June 2019‎ Enter your username talk contribs‎ 31,158 bytes +3,713‎ pointed out correction for pascal version

2 June 2019

• curprev 19:5019:50, 2 June 2019‎ PureFox talk contribs‎ 27,445 bytes +713‎ Added comment about using congruence formula to calculate digital root.
• curprev 14:4214:42, 2 June 2019‎ rosettacode>Horst.h‎ m 26,732 bytes +371‎ →‎Optimization when no extra digit required: possible improve of Digital root GO - Version

29 May 2019

• curprev 10:5810:58, 29 May 2019‎ PureFox talk contribs‎ 26,361 bytes +490‎ Congratulations to Nigel Galloway on his latest optimization!
• curprev 09:0509:05, 29 May 2019‎ rosettacode>Horst.h‎ 25,871 bytes +778‎ →‎Optimization when no extra digit required: clearing for myself
• curprev 08:4608:46, 29 May 2019‎ rosettacode>Horst.h‎ 25,093 bytes −594‎ Undo revision 283127 by Horst.h (talk)
• curprev 08:0908:09, 29 May 2019‎ rosettacode>Horst.h‎ 25,687 bytes +594‎ →‎Optimization when no extra digit required: where is the connection digital sum of start value digital sum solution?

27 May 2019

• curprev 22:5122:51, 27 May 2019‎ Nigel Galloway talk contribs‎ 25,093 bytes 0‎ →‎Optimization when no extra digit required
• curprev 22:4622:46, 27 May 2019‎ Nigel Galloway talk contribs‎ 25,093 bytes +168‎ →‎Optimization when no extra digit required
• curprev 22:0322:03, 27 May 2019‎ Nigel Galloway talk contribs‎ 24,925 bytes +1,222‎ Optimization when no extra digit required
• curprev 16:3516:35, 27 May 2019‎ PureFox talk contribs‎ 23,703 bytes +10‎ →‎Trailing zero: Forgot to add that this only applies for bases > 2.
• curprev 16:2816:28, 27 May 2019‎ PureFox talk contribs‎ 23,693 bytes +557‎ Added section about a minor optimization.

26 May 2019

• curprev 16:4216:42, 26 May 2019‎ Thundergnat talk contribs‎ 23,136 bytes +550‎ →‎analytically determine minimum start value: Ah. My mishandling of square root calculations.
• curprev 15:4215:42, 26 May 2019‎ PureFox talk contribs‎ 22,586 bytes +563‎ →‎analytically determine minimum start value: Added further comment.
• curprev 08:4008:40, 26 May 2019‎ rosettacode>Horst.h‎ m 22,023 bytes +484‎ →‎any ideas of optimizations ?: check runtime for base 22
• curprev 02:3202:32, 26 May 2019‎ Thundergnat talk contribs‎ 21,539 bytes +525‎ →‎analytically determine minimum start value: You are right, I am wrong
• curprev 00:2100:21, 26 May 2019‎ PureFox talk contribs‎ 21,014 bytes +615‎ Added comment about apparent discrepancy in results for base 21.

25 May 2019

• curprev 17:0817:08, 25 May 2019‎ PureFox talk contribs‎ 20,399 bytes +520‎ Responded to comment about repeated digits from Nigel Galloway.
• curprev 17:0217:02, 25 May 2019‎ Nigel Galloway talk contribs‎ 19,879 bytes +507‎ →‎analytically determine minimum start value
• curprev 15:1715:17, 25 May 2019‎ Thundergnat talk contribs‎ m 19,372 bytes +7‎ →‎analytically determine minimum start value: A few more small, mostly cosmetic fixes
• curprev 15:1115:11, 25 May 2019‎ Thundergnat talk contribs‎ 19,365 bytes −34‎ →‎analytically determine minimum start value: Argh. pasted in wrong version. fixed
• curprev 15:0415:04, 25 May 2019‎ Thundergnat talk contribs‎ m 19,399 bytes +1‎ →‎analytically determine minimum start value: doh
• curprev 15:0315:03, 25 May 2019‎ Thundergnat talk contribs‎ m 19,398 bytes +1‎ →‎analytically determine minimum start value: I fail at proofreading
• curprev 15:0315:03, 25 May 2019‎ Thundergnat talk contribs‎ 19,397 bytes +4,805‎ →‎analytically determine minimum start value: new section
• curprev 12:4512:45, 25 May 2019‎ Nigel Galloway talk contribs‎ 14,592 bytes +265‎ →‎Space compression and proof ?: Why 10123456789abcdefg is the smallest candidate

24 May 2019

• curprev 12:4412:44, 24 May 2019‎ Nigel Galloway talk contribs‎ 14,327 bytes +38‎ →‎Space compression and proof ?
• curprev 12:1812:18, 24 May 2019‎ Hout talk contribs‎ 14,289 bytes +183‎ →‎Space compression and proof ?
• curprev 12:0112:01, 24 May 2019‎ Hout talk contribs‎ 14,106 bytes +490‎ →‎Space compression and proof ?: Cases where q=0 ?
• curprev 10:3710:37, 24 May 2019‎ Nigel Galloway talk contribs‎ m 13,616 bytes 0‎ →‎Space compression and proof ?
• curprev 10:3610:36, 24 May 2019‎ Nigel Galloway talk contribs‎ m 13,616 bytes 0‎ →‎Space compression and proof ?
• curprev 10:0810:08, 24 May 2019‎ Nigel Galloway talk contribs‎ 13,616 bytes +608‎ →‎Space compression and proof ?
• curprev 00:0000:00, 24 May 2019‎ Hout talk contribs‎ m 13,008 bytes +8‎ →‎Space compression and proof ?
• curprev 00:0000:00, 24 May 2019‎ Hout talk contribs‎ 13,000 bytes +701‎ →‎Space compression and proof ?

23 May 2019

• curprev 23:1923:19, 23 May 2019‎ Thundergnat talk contribs‎ 12,299 bytes +364‎ →‎Space compression and proof ?: tentative smallest for base 17
• curprev 21:0721:07, 23 May 2019‎ Hout talk contribs‎ 11,935 bytes +149‎ →‎Space compression and proof ?
• curprev 20:4820:48, 23 May 2019‎ Nigel Galloway talk contribs‎ 11,786 bytes +847‎ →‎Space compression and proof ?
• curprev 17:4117:41, 23 May 2019‎ Hout talk contribs‎ 10,939 bytes +1,057‎ →‎Space compression and proof ?
• curprev 14:3214:32, 23 May 2019‎ Thundergnat talk contribs‎ 9,882 bytes +536‎ →‎Proof: Actually, maybe I _can_ prove it.
• curprev 11:4511:45, 23 May 2019‎ Hout talk contribs‎ 9,346 bytes +1,030‎ →‎Space compression and proof ?: Added Python sketch of repeated digit sum function
• curprev 11:3411:34, 23 May 2019‎ Hout talk contribs‎ m 8,316 bytes +1‎ →‎Space compression and proof ?
• curprev 11:3311:33, 23 May 2019‎ Hout talk contribs‎ 8,315 bytes +5‎ →‎Space compression and proof ?
• curprev 11:3311:33, 23 May 2019‎ Hout talk contribs‎ 8,310 bytes +3,057‎ →‎any ideas of optimizations ?
• curprev 05:5805:58, 23 May 2019‎ rosettacode>Horst.h‎ 5,253 bytes +915‎ optimizing suggestions
• curprev 00:0700:07, 23 May 2019‎ Thundergnat talk contribs‎ m 4,338 bytes +17‎ →‎Proof: Only N digits in base N

22 May 2019

• curprev 23:3923:39, 22 May 2019‎ Thundergnat talk contribs‎ m 4,321 bytes +1‎ →‎Proof: Bleah, grammar
• curprev 23:3723:37, 22 May 2019‎ Thundergnat talk contribs‎ 4,320 bytes +3,619‎ Proof: Nope
• curprev 21:3521:35, 22 May 2019‎ Nigel Galloway talk contribs‎ 701 bytes +311‎ No edit summary

21 May 2019

• curprev 01:1801:18, 21 May 2019‎ Thundergnat talk contribs‎ 390 bytes +214‎ →‎Leading zeros ?: Reworded.

20 May 2019

• curprev 23:5423:54, 20 May 2019‎ Hout talk contribs‎ 176 bytes +176‎ Perhaps the 'First perfect square in base 2 with 2 unique digits' is arguably '01' ?