290 reputation
312
bio website
location Iran
age
visits member for 1 year, 9 months
seen Aug 27 at 5:29

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. ;-)


Dec
11
comment Fundamental Period of sequence modulo N
I know that it becomes a PRP only, but it is the first step in any deterministic test.
Dec
11
awarded  Commentator
Dec
11
comment Fundamental Period of sequence modulo N
@AndréNicolas, your'true about composites.I'm looking to reduce the exponent for primility test. If I know $N$ is prime, then $N-1$ is an obvious member of the sequence
Dec
11
asked Fundamental Period of sequence modulo N
Dec
10
revised Estimation on Primorial Influence
edited body
Dec
10
comment Estimation on Primorial Influence
@sunflower, you're true, I forgot to add $n\# + 1$ and $n\# - 1$ special cases. Question updated.
Dec
10
revised Estimation on Primorial Influence
Added n#+1, n#-1 exceptions
Dec
9
asked Estimation on Primorial Influence
Dec
6
comment Approaching Euler totient for arbitrary n
Look at here math.stackexchange.com/questions/249982/…
Dec
6
revised How to calculate Euler totient from nearby values?
added 861 characters in body
Dec
6
comment Approaching Euler totient for arbitrary n
@GerryMyerson, every mathematics mystery has been solved by a conjecture and then proving, extending and correcting that.. The visual appearance of tree seems interesting so I asked to extend the idea
Dec
5
comment Approaching Euler totient for arbitrary n
Useful for small numbers but not for thousand digits numbers
Dec
5
asked Approaching Euler totient for arbitrary n
Dec
4
asked Fermat's Little Theorem and Polynomial Congruence Relation
Dec
3
awarded  Supporter
Dec
3
asked How to calculate Euler totient from nearby values?
Dec
3
comment Fastest Primality test using $N-1$ Factorization?
@Arthur, but the computation time doubled as I splited the exponentiation to factors !!!
Dec
3
comment Fastest Primality test using $N-1$ Factorization?
@TonyK can you please explain more. The modular exponentiation can't be parallelized. How do you mean? I was already working on parallel modular exponentiation mathematica.stackexchange.com/questions/15062/parallel-powermod and your note seems very interesting
Dec
3
awarded  Teacher
Dec
3
awarded  Editor