current community
chat
blog
MathOverflow
MathOverflow Meta
your communities
Sign up
or
log in
to customize your list.
more stack exchange communities
Stack Exchange
sign up
log in
tour
help
Tour
Start here for a quick overview of the site
Help Center
Detailed answers to any questions you might have
Meta
Discuss the workings and policies of this site
MathOverflow
Questions
Tags
Users
Badges
Unanswered
Ask Question
M.S.
less info
network profile
109
reputation
7
bio
website
location
age
visits
member for
5 years, 1 month
seen
Jan 14 '14 at 0:09
stats
profile views
153
109
reputation
bio
website
visits
member for
5 years, 1 month
7
badges
location
seen
Jan 14 '14 at 0:09
summary
answers
questions
tags
badges
favorites
bounties
reputation
all actions
27
Actions
suggestions
reviews
revisions
comments
badges
posts
accepts
all
Oct
9
awarded
Popular Question
Oct
8
awarded
Nice Question
May
27
awarded
Critic
May
25
comment
Is integer factorization harder than RSA ($n=pq$) factorization?
@KotelKanim If $n$ is not decomposable into a product $pq$ of two primes, then RSA oracle will terminate (in polytime) with the answer NONE (or 'false' if you wish).
May
25
comment
Is integer factorization harder than RSA ($n=pq$) factorization?
@François: Well, fair enough.
May
25
asked
Is integer factorization harder than RSA ($n=pq$) factorization?
Apr
16
accepted
Fast algorithms for computing nullspace of a positive semidefinite matrix over Z
Apr
15
revised
Fast algorithms for computing nullspace of a positive semidefinite matrix over Z
Clarity.; added 3 characters in body; edited tags
Apr
15
asked
Fast algorithms for computing nullspace of a positive semidefinite matrix over Z
Jan
6
accepted
Smallest prime that does not divide the Vandermonde determinant
Jan
6
comment
Smallest prime that does not divide the Vandermonde determinant
Yes. Consider the primes in the range [2 .. d]. Some of them will divide V, other won't. I want the smallest prime p that does not divide V.
Jan
6
comment
Smallest prime that does not divide the Vandermonde determinant
I'm looking for a prime $p < n$ such that $p \nmid V$. It is the case that a_1 = 1 (actually, 1 = a_1 < .. < a_n = d and d >> n).
Jan
6
revised
Smallest prime that does not divide the Vandermonde determinant
Clearance.
Jan
5
revised
Smallest prime that does not divide the Vandermonde determinant
Typ: < instead of <=
Jan
5
asked
Smallest prime that does not divide the Vandermonde determinant
Dec
11
accepted
Matrix version of Berlekamp Massey algorithm
Dec
10
asked
Matrix version of Berlekamp Massey algorithm
Oct
20
awarded
Supporter
Jul
14
comment
Does “Algebraic numbers coloured by degree” form a fractal?
Fair enough. Thanks for the clarification.
Jul
13
asked
Does “Algebraic numbers coloured by degree” form a fractal?
MathOverflow works best with JavaScript enabled