bio  website  

location  
age  
visits  member for  4 years, 6 months 
seen  2 hours ago  
stats  profile views  2,888 
2d

comment 
Is the exterior power of a primitive matrix still primitive?
Please include here explicitly for completeness. 
2d

comment 
Is the exterior power of a primitive matrix still primitive?
COuld you please define exterior power of a matrix explicitly? 
Apr 12 
comment 
Your favorite surprising connections in Mathematics
Is this from Rubin's works? 
Apr 11 
comment 
Deciding a quadratic diophantine equation
@Aurel Sorry I missed last comment. What is the final verdict? 
Apr 11 
comment 
Has this strong number theoretic conjecture of Euler been proved, and where could I find such a proof?
could you post the recursion? 
Apr 10 
comment 
Notation for $\log \log \cdots \log n$?
Iterated logarithm en.wikipedia.org/wiki/Iterated_logarithm. 
Apr 10 
comment 
On permutation of elements of two bases of a vector space (Greub´s book)
Included link is broken. 
Apr 7 
comment 
Deciding a quadratic diophantine equation
@Aurel I am looking for better insight into both average and worst case. In light of Emil's comment, is this problem also NPcomplete? 
Apr 7 
comment 
Deciding a quadratic diophantine equation
Looks like it will be exponential time even if $b$ is factorized since both $x,y>0$? 
Apr 7 
comment 
Deciding a quadratic diophantine equation
Thank you very much. Could we say something similar about when given $a,b\in\Bbb Q_+$,$T_{a,b}=\{x,y\in\Bbb Z_+^2:ax^2+by=1\}=\emptyset$along these lines? 
Apr 7 
comment 
Deciding a quadratic diophantine equation
Thank you very much. Could we say something similar about when given $a,b\in\Bbb Q_+$, $T_{a,b}=\{x,y\in\Bbb Z_+^2:ax^2+by=1\}=\emptyset$ along these lines? 
Apr 6 
comment 
How can I effectively compute tetration mod a?
Still would work if $\mathsf{GCD}(m,p)=1$ with some modification (Theorem $1.2$ math.uconn.edu/~kconrad/blurbs/ugradnumthy/eulerthm.pdf). 
Apr 6 
comment 
How can I effectively compute tetration mod a?
$m\uparrow^2 n\bmod p=(m\uparrow((m\uparrow^2(n1))\bmod p))\bmod p$ if $p$ is prime. 
Apr 6 
revised 
Deciding a quadratic diophantine equation
deleted 469 characters in body 
Apr 6 
revised 
Deciding a quadratic diophantine equation
added 89 characters in body 
Apr 6 
comment 
Deciding a quadratic diophantine equation
It seems if $a^{1}c \bmod b$ or $b^{1}c \bmod a$ is a quadratic nonresidue, then we will not have a solution? 
Apr 6 
comment 
Deciding a quadratic diophantine equation
It seems if $a^{1}c \bmod b$ or $b^{1}c \bmod a$ is a quadratic nonresidue, then we will not have a solution? 
Apr 6 
revised 
Deciding a quadratic diophantine equation
added 362 characters in body 
Apr 6 
comment 
Deciding a quadratic diophantine equation
are you thinking about this for principality of ideals mhikari.com/ams/ams2014/ams1411442014/…;? It says polynomial algorithm is known. 
Apr 6 
revised 
Deciding a quadratic diophantine equation
deleted 50 characters in body 