Skip to main content
MathOverflow
jerr18's user avatar
jerr18's user avatar
jerr18's user avatar
jerr18
  • Member for 13 years, 8 months
Profile Activity
Stats
454
reputation
6k
reached
3
answers
7
questions
Communities
About
Contact: jerry_just @ gmx.com
Badges
View all badges
This user doesn’t have any gold badges yet.
5
silver badges
14
bronze badges
Top tags
View all tags
1
Score
5
Posts
50
Posts %
1
Score
5
Posts
50
Posts %
1
Score
1
Posts
10
Posts %
1
Score
1
Posts
10
Posts %
1
Score
1
Posts
10
Posts %
0
Score
2
Posts
20
Posts %
Top posts
question
24
Can the number of solutions $xy(x-y-1)=n$ for $x,y,n \in\mathbb Z$ be unbounded as $n$ varies?
Dec 27, 2010
question
6
Would an oracle for integral points on elliptic curves be a factoring oracle?
Dec 31, 2010
question
3
Can the number of solutions $x(y^2-x-1)=n$ in $\mathbb{Z}$ (or $\mathbb{Z}[t]$) be unbounded?
Jan 26, 2011
question
2
Second stage of elliptic curve factorization via random walk/Pollard's rho in constant (or low) memory?
Mar 6, 2011
question
1
Can a polynomial size CFG describe the finite language \{$w \pi(w)$ : $\pi(w)$ is fixed string permutation, $|w|=n$ is fixed\} over alphabet \{0,1\}?
Jan 31, 2011
question
1
Rational points on $ \frac{ x^k-y^k }{ x-y } - (x-y)^{k-2} = 0 $ , $k>3$, genus 0
Apr 20, 2011
answer
1
Can the number of solutions $xy(x-y-1)=n$ for $x,y,n \in Z[t]$ be unbounded as n varies?
Jan 8, 2011
answer
1
Longest coinciding pair of integer sequences known
Jan 15, 2011
answer
1
Can a polynomial size CFG describe the finite language \{$w \pi(w)$ : $\pi(w)$ is fixed string permutation, $|w|=n$ is fixed\} over alphabet \{0,1\}?
Feb 5, 2011
question
0
Working in a ring with something similar to elliptic curve factorization?
Mar 12, 2011
Top network posts
View all network posts
13
Can the number of solutions $xy(x-y-1)=n$ for $x,y,n \in Z$ be unbounded as n varies?
10
Fiction "Division by Zero" By Ted Chiang
9
Do there exists polynomial size CFG that describe this finite language?
5
Can a polynomial size CFG over large alphabet describe a language, where each terminal appears even number of times?