| bio | website | tgtosan.com |
|---|---|---|
| location | Iran | |
| age | 24 | |
| visits | member for | 5 months |
| seen | yesterday | |
| stats | profile views | 53 |
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(http://clrviacsharp.ir/) 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. ;-)
|
May 6 |
awarded | Benefactor |
|
May 6 |
accepted | Montgomery Modular Exponentiation |
|
Apr 30 |
comment |
Montgomery Modular Exponentiation @SimonWoods, thanks for memoizing trick, take a look at my updates |
|
Apr 30 |
revised |
Montgomery Modular Exponentiation Added new timings and plot |
|
Apr 30 |
revised |
Montgomery Modular Exponentiation added 172 characters in body |
|
Apr 30 |
revised |
Montgomery Modular Exponentiation Added timings and plots for the new answer |
|
Apr 29 |
awarded | Promoter |
|
Apr 24 |
comment |
Montgomery Modular Exponentiation I've measured the time only for computing the result using MathLink .NET API, and about GMP I've used this wrapper (emilstefanov.net/Projects/GnuMpDotNet) which its performance is obviously slower than native Mathematica code. Also I wondered when my simple manual Left-To-Right PowerMod implmentation became faster than GMP PowerMod (of course the wrapping may have an effect on this) |
|
Apr 24 |
comment |
Montgomery Modular Exponentiation @OleksandrR., thanks for the suggestion, I tried it now, but Mathlink is roughly 5 times slower than Mathematica itself with the same input, so going further and doing bit manipulation would make it even slower |
|
Apr 23 |
comment |
Montgomery Modular Exponentiation I tied it and because of the "machine-size" integers it's useless for this scenario. |
|
Apr 23 |
revised |
Montgomery Modular Exponentiation added 86 characters in body |
|
Apr 23 |
revised |
Montgomery Modular Exponentiation Added new Timings and updated Version 2 |
|
Apr 22 |
asked | Montgomery Modular Exponentiation |
|
Apr 18 |
awarded | Informed |
|
Mar 1 |
awarded | Fanatic |
|
Jan 12 |
comment |
Faster GCD Implementation @Mr.Wizard I've tried it for Timing[GCD[100000! + 1, 1000000!]] and it is 9 times slower than Mathematica |
|
Jan 10 |
comment |
Nested List Product @Mr.Wizard, it is an iterative computation, as an example when 2*3 => 6 and then 6*35 => 210 I want have access (a simple Print here) to both 6 and 35 in the middle of computation not at the end and using [[]] over the list. |
|
Jan 10 |
comment |
Nested List Product @Mr.Wizard my original version is incomplete so I asked how to combine them at once and also how to have access to them once they're computed not at the end. No answer yet. |
|
Jan 8 |
comment |
How can I highlight the points lying between two lines in a ListPlot? @Hypnotoad, I appreciated your note and revert the question back to the original one. Thanks. |
|
Jan 8 |
revised |
How can I highlight the points lying between two lines in a ListPlot? deleted 241 characters in body |