796 reputation
321
bio website
location Zurich, Switzerland
age
visits member for 2 years, 9 months
seen Aug 24 at 8:50

Aug
8
comment Prime Identification easier than Prime Factorization?
I need 100% accuracy and only the running time of the worst case input N matters (ie argmax 2 < i < 10^20 of running time of isPrime(i)).
Aug
8
revised Prime Identification easier than Prime Factorization?
added 392 characters in body
Aug
8
asked Prime Identification easier than Prime Factorization?
Aug
7
accepted Modulus Distributing Over Multiplication?
Aug
7
comment Modulus Distributing Over Multiplication?
I tried to prove the answer and added it to the bottom of my question.
Aug
7
revised Modulus Distributing Over Multiplication?
added 512 characters in body
Aug
3
comment Modulus Distributing Over Multiplication?
So the answer is always. So whats the big deal about having a prime base then? Its just having a modular inverse for everything?
Aug
3
revised Modulus Distributing Over Multiplication?
added 18 characters in body
Aug
3
asked Modulus Distributing Over Multiplication?
Aug
3
comment Count Exclusive Partitionings of Points in Circle, Closing Double Recurrence?
Do you ever get the feeling that its all been done before. These are the Catalan numbers. en.wikipedia.org/wiki/Catalan_number, and the problem I describe is the Noncrossing Partition en.wikipedia.org/wiki/Noncrossing_partition
Aug
2
answered Are the two statements concening number theory correct?
Aug
2
asked Count Exclusive Partitionings of Points in Circle, Closing Double Recurrence?
Aug
2
accepted How many elements $a \in \Bbb{Z}_N$ such that $ax \equiv y \mod N$
Aug
2
comment Efficiently evaluating the Motzkin numbers
@AsafKaragila: sorry typo
Aug
2
comment A closed form for $T_N = 1 + \sum\limits_{k=0}^{N-2}{(N-1-k)T_k}$?
I made a mistake sorry: See here: math.stackexchange.com/questions/177856/…
Aug
2
asked Efficiently evaluating the Motzkin numbers
Aug
2
accepted A closed form for $T_N = 1 + \sum\limits_{k=0}^{N-2}{(N-1-k)T_k}$?
Aug
2
asked A closed form for $T_N = 1 + \sum\limits_{k=0}^{N-2}{(N-1-k)T_k}$?
Jul
30
accepted Probabilistic Sieve of Eratosthenes
Jul
30
accepted P[random x is composite | $2^{x-1}$ mod $x = 1$ ]?