512 reputation
1215
bio website
location Iran
age
visits member for 1 year, 10 months
seen Sep 17 at 14:55

Originally started programming by ACM contests and then learning how to code some HPC in Prime number category.

Then switching to .NET world and C# as a language to express myself.

Plus that, translating CLR via C#, 3rd Ed by Jeffery Ritcher to Persian language were my great moments of coding.

Add to them the wows of MVC 4 and Android experience and you'll get a mixture of all. ;-)


Jul
2
awarded  Curious
May
3
revised Taking Top K Occurrences
added counterpart SO link
May
2
awarded  Nice Question
May
1
asked Taking Top K Occurrences
Dec
23
comment Faster Solve for Fermat 4n+1 conjecture
I've added new findings
Dec
23
revised Faster Solve for Fermat 4n+1 conjecture
New formula
Dec
23
revised Faster Solve for Fermat 4n+1 conjecture
Added PowersRepresentations function
Dec
23
comment Faster Solve for Fermat 4n+1 conjecture
thanks for the solution but the timing in my larger 2K numbers are the same as Solve
Dec
23
comment Faster Solve for Fermat 4n+1 conjecture
@DanielLichtblau, Timing is the same
Dec
23
asked Faster Solve for Fermat 4n+1 conjecture
Dec
21
answered How to detect if a sequence of integers is consecutive
Dec
20
accepted Visualize difference between members of the list
Dec
20
comment Visualize difference between members of the list
I did, but the visual output is not as readable as what @Kuba rendered, how can I force the circular rendering?
Dec
20
comment Visualize difference between members of the list
I just want one path between two nodes. How can I remove the negative ones?
Dec
20
asked Visualize difference between members of the list
Dec
17
comment Memory management and speed for Fast GCD
318 seconds on my test sample. It seems that it reached the limits of speed and performance
Dec
16
comment Memory management and speed for Fast GCD
let us continue this discussion in chat
Dec
16
comment Memory management and speed for Fast GCD
@tchrnois, It's a tradeoff between trial factor and deterministic tests. 100M primes left 38 numbers while 1B primes left 34 numbers, only 4 numbers removed by the additional 14 hours of test while performing long deterministic tests on those 4 numbers would take 4 hours, so there's a waste of 9 hours. There should be a balance.
Dec
16
comment Memory management and speed for Fast GCD
@thchronis, You're correct, actually I if written with Reap and Sow and some parallelizing it would become great
Dec
15
revised Memory management and speed for Fast GCD
Added timing result