User contributions for Horst

18 March 2024

• 08:3008:30, 18 March 2024 diff hist +639‎ Smallest square that begins with n ‎ →‎{{trans|Julia}}: last improvement of {{trans|Julia}}

17 March 2024

• 16:2416:24, 17 March 2024 diff hist +307‎ Smallest square that begins with n ‎ →‎{{trans|Julia}}: speed up julia version. Stop searching as early as possible.Minimize divisions. 335 ms -> 71 ms :-)
• 14:0014:00, 17 March 2024 diff hist +1,480‎ Smallest square that begins with n ‎ →‎{{header|Free Pascal}}: Julia version is neglectable slower, but uses a lot of memory and only useful for continious regions of numbers to test.

16 March 2024

• 08:5408:54, 16 March 2024 diff hist +316‎ m Smallest square that begins with n ‎ →‎{{header|Free Pascal}}: already know the power of 10 to divide with.

15 March 2024

• 17:2017:20, 15 March 2024 diff hist +2,721‎ Smallest square that begins with n ‎ →‎{{header|Perl}}: prepend Free Pascal version. Extreme reduced runtime.

9 March 2024

• 13:5913:59, 9 March 2024 diff hist +167‎ m Greatest prime dividing the n-th cubefree number ‎ →‎resursive alternative: with max prime divisor for first 100. more compact.
• 12:3712:37, 9 March 2024 diff hist +4‎ m Greatest prime dividing the n-th cubefree number ‎ →‎resursive alternative: correct max prime factor to test 2,642,246
• 10:2010:20, 9 March 2024 diff hist +1,643‎ Greatest prime dividing the n-th cubefree number ‎ →‎resursive alternative: changed to search for count of cubefree numbers

8 March 2024

• 07:5607:56, 8 March 2024 diff hist +712‎ m Greatest prime dividing the n-th cubefree number ‎ →‎resursive alternative: Using Apéry's Constant

7 March 2024

• 19:3419:34, 7 March 2024 diff hist +4,116‎ Greatest prime dividing the n-th cubefree number ‎ →‎{{header|Free Pascal}}: added recursive version, but only to check.Not tryinge to the limit for cnt = 10^n
• 06:4206:42, 7 March 2024 diff hist −67‎ m Greatest prime dividing the n-th cubefree number ‎ →‎{{header|Free Pascal}}: corrected calculation of highest divisor
• 04:0904:09, 7 March 2024 diff hist −57‎ Talk:Greatest prime dividing the n-th cubefree number ‎ →‎The logic of cubes_before(): legendre Prime countiing

6 March 2024

• 19:2019:20, 6 March 2024 diff hist +347‎ Talk:Greatest prime dividing the n-th cubefree number ‎ →‎The logic of cubes_before(): analog to Totient function?
• 16:0316:03, 6 March 2024 diff hist −2,780‎ Greatest prime dividing the n-th cubefree number ‎ →‎{{header|Free Pascal}}: sieving with cube of primes instead of factoring every numbers. 45-fold speed up
• 09:1709:17, 6 March 2024 diff hist +8,990‎ Greatest prime dividing the n-th cubefree number ‎ →‎{{header|Phix}}: prepand pascal, a little bit lengthy

13 July 2023

• 07:5207:52, 13 July 2023 diff hist +29‎ m Abundant, deficient and perfect number classifications ‎ →‎{{header|Pascal}}: move to sub group ==={{header|Free Pascal}}===

11 July 2023

• 09:1209:12, 11 July 2023 diff hist −3,319‎ Abundant, deficient and perfect number classifications ‎ →‎{{header|Pascal}}: using unit for prime decomposition.Uses less memory, so TIO.RUN can check 524*1000*1000
• 08:4408:44, 11 July 2023 diff hist +18,529‎ Category:PrimTrial ‎No edit summary current

4 July 2023

• 06:0806:08, 4 July 2023 diff hist +4,015‎ Sisyphus sequence ‎ →‎{{header|Perl}}: prepend ==={{header|Free Pascal}=== 36 found in ~16,5 min

29 June 2023

• 05:4205:42, 29 June 2023 diff hist +189‎ m Prime numbers whose neighboring pairs are tetraprimes ‎ →‎{{header|C}}: small improvement for isTetraPrime, to stop earlier. Runtime @home 0.1s -> 0.068 s

27 June 2023

• 07:0907:09, 27 June 2023 diff hist +57‎ m Prime numbers whose neighboring pairs are tetraprimes ‎ →‎{{header|Free Pascal}}: added runtimes for 1E7: 0.033s and 1E8: 0.458s ( 5600G @ 4.4 Ghz )

26 June 2023

• 16:4716:47, 26 June 2023 diff hist +5‎ m Prime numbers whose neighboring pairs are tetraprimes ‎ →‎{{header|Pascal}}: added Free in Free Pascal
• 16:4316:43, 26 June 2023 diff hist +8,499‎ Prime numbers whose neighboring pairs are tetraprimes ‎ →‎{{header|Nim}}: added =={{header|Pascal}}== generating tetraprimes to speed up.Limit 1E9. space for time

23 June 2023

• 08:1308:13, 23 June 2023 diff hist +1,556‎ m Jordan-Pólya numbers ‎ →‎{{header|Free Pascal}}: more comments and commatize

21 June 2023

• 03:5503:55, 21 June 2023 diff hist +1,100‎ Jordan-Pólya numbers ‎ →‎{{header|Free Pascal}}: Convert using Uint64. misinterpretate 2^53 with 1E53 tse tse tse...

18 June 2023

• 06:0806:08, 18 June 2023 diff hist +5‎ m Sudan function ‎ →‎{{header|Pascal}}: forget "Free " in sub- header

17 June 2023

• 11:4411:44, 17 June 2023 diff hist +2,046‎ Sudan function ‎ →‎{{header|OCaml}}: added =={{header|Pascal}}== trans Delphi tested SudanFunction( 2, 2, 2) =15,569,256,417
• 09:4609:46, 17 June 2023 diff hist +5,574‎ N-smooth numbers ‎ →‎{{header|Pascal}}: re_added version for ==={{header|Free Pascal}}=== false interpretation of limit 3000 as index of n-smooth number

14 June 2023

• 07:0107:01, 14 June 2023 diff hist +311‎ m Palindromic gapful numbers ‎ →‎{{header|Delphi}}: inserted missing procedure GetDigits

11 June 2023

• 16:2816:28, 11 June 2023 diff hist +213‎ m Talk:Jordan-Pólya numbers ‎ A false estimate of me.
• 16:1916:19, 11 June 2023 diff hist +6,503‎ Jordan-Pólya numbers ‎ →‎{{header|Nim}}: append ==={{header|Free pascal}}===

9 June 2023

• 08:4808:48, 9 June 2023 diff hist +430‎ N Talk:Jordan-Pólya numbers ‎ →‎Isn't that like N-smooth_numbers using n! instead of primes?: new section

29 May 2023

• 17:4317:43, 29 May 2023 diff hist +4,842‎ Find largest left truncatable prime in a given base ‎ →‎{{header|PARI/GP}}: append =={{header|Pascal}}==

27 May 2023

• 08:1508:15, 27 May 2023 diff hist +3,745‎ Honaker primes ‎ →‎{{header|Nim}}: added {{header|Free Pascal}} checking https://www.numbersaplenty.com/set/Honaker_prime/ for 30000101111

26 May 2023

• 06:2206:22, 26 May 2023 diff hist +10,878‎ Radical of an integer ‎ →‎{{header|Free Pascal}}: added modified fast consecutive factors of integer. Yes, it's lengthy.

25 May 2023

• 14:3714:37, 25 May 2023 diff hist −1‎ m Radical of an integer ‎ →‎{{header|Free Pascal}}: changed Uin64 to Uint32 doubles nearly speed Real time: 0.560 s downto 0.310 s

24 May 2023

• 14:3614:36, 24 May 2023 diff hist +78‎ m Summation of primes ‎ →‎{{header|Pascal}}: uses primsieve instead of primTrial @home limit 1E9 sums to 24739512092254535 in 640ms like https://www.spoj.com/problems/SUMPRIM1/en/
• 13:0313:03, 24 May 2023 diff hist +2,677‎ De Polignac numbers ‎ →‎{{header|Nim}}: append {{header|Pascal}} trans Delphi

23 May 2023

• 17:3617:36, 23 May 2023 diff hist +5,440‎ m Radical of an integer ‎ →‎{{header|Julia}}: append {{header|Free Pascal}}
• 14:5314:53, 23 May 2023 diff hist +770‎ m Blum integer ‎ →‎{{header|Free Pascal}}: changed output format
• 08:5008:50, 23 May 2023 diff hist +4,066‎ Blum integer ‎ →‎{{header|Julia}}: append {{header|Pascal}}

13 May 2023

• 18:0618:06, 13 May 2023 diff hist +499‎ m Prime reciprocal sum ‎ →‎{{header|Free Pascal}}: extend sieve prime to primes upto 1E6. Found 17 in 1h25min
• 07:2007:20, 13 May 2023 diff hist +2,966‎ m Prime reciprocal sum ‎ →‎{{header|Free Pascal}}: using presieving with small primes ( 2..65519)

12 May 2023

• 10:0210:02, 12 May 2023 diff hist −1‎ m Prime reciprocal sum ‎ moved
• 10:0010:00, 12 May 2023 diff hist +2,060‎ Prime reciprocal sum ‎ →‎{{header|J}}: append Free Pascal

11 May 2023

• 15:5215:52, 11 May 2023 diff hist +1,161‎ m Magic 8-ball ‎ →‎{{header|ooRexx}}: appen Free Pascal version
• 14:0114:01, 11 May 2023 diff hist +591‎ CRC-32 ‎ →‎{{header|PARI/GP}}: append Free Pascal . CRC is the unit to use. ala https://forum.lazarus.freepascal.org/index.php/topic,36396.msg242520.html
• 13:4113:41, 11 May 2023 diff hist +241‎ m Ruth-Aaron numbers ‎ →‎{{header|Free Pascal}}: added timings for sub tasks

29 April 2023

• 14:1914:19, 29 April 2023 diff hist −1‎ m Magic constant ‎ →‎{{header|Free Pascal}}: typo
• 14:1514:15, 29 April 2023 diff hist +1,821‎ Magic constant ‎ →‎{{header|Mathematica}}/{{header|Wolfram Language}}: append Pascal