1,791 reputation
210
bio website
location
age
visits member for 1 year, 7 months
seen Apr 6 at 23:18

Mar
17
answered Factorization of a list with composite integers to a combined list of all prime factors
Mar
8
answered Using IntegerPartitions for distinct integers
Mar
2
answered Complex LogIntegral error
Feb
25
answered Counting and extracting hit circles/triangles for randomly chosen points
Feb
22
answered About an elementary limit
Feb
16
awarded  Nice Answer
Jan
31
comment Semi prime numbers
@halirutan "Semi-Primes Assemble!"
Jan
28
awarded  Nice Answer
Jan
27
answered Plot counting function semi primes
Jan
27
answered Semi prime numbers
Jan
27
answered Application on systems of equations
Jan
22
revised Law of Cosines to determine angle change along spiral
added 357 characters in body
Jan
20
answered Law of Cosines to determine angle change along spiral
Jan
19
comment Faster Solve for Fermat 4n+1 conjecture
@DanielLichtblau Thanks! Your PowerMod formulation is compact and much, much faster than the awkward JacobiSymbol equivalent I was using in another non-Cornacchia approach.
Jan
15
answered Problem on Consecutive Sequence Sums that are Squares
Jan
7
revised Determing two Nonlinear model fits with 95% confidence bands from one data set
added 883 characters in body
Jan
7
answered Determing two Nonlinear model fits with 95% confidence bands from one data set
Dec
23
comment Faster Solve for Fermat 4n+1 conjecture
My machine still runs Cornacchia faster than Solve on the larger numbers but, as I said, your timings may vary. The FactorInteger method of @DanielLichtblau should not be dismissed so quickly; it is significantly faster than all so far. Perhaps if you could optimize the Cornacchia algorithm, since its inner workings are visible and not a black box like Solve, then we would all benefit.
Dec
23
answered Faster Solve for Fermat 4n+1 conjecture
Dec
20
answered Generate PrimePower counting function