last day (15 days later) » 

I done solved TPC again
0
Q: Employing chinese remainder theorem to show infinity of diophantine solutions?

Shine On You Crazy DiamondSuppose that $q_i$ is the $i$th odd prime, $q_1 = 3$. Is it possible to simultaneously solve: $x^{2^k} = 1 \pmod{q_i}, i=1..{k+1}$ whilst, $x^{2^k} = $anything but $1 \pmod {q_i}$ for any $k \geq 1$? Can this be done using Chinese remaindering? Doesn't this imply that $x^{2^k} - 1 = q_1 \c...

Can you have them send the million dollars to my house?
Thx
22:01
@shi nice
Let $u=\ln(x)$ and $v=\ln(y).$ Is it correct to conclude that $uv=1,$ in $\log-\log,$ space is a hyperbola, but in $x,y$ space it is not a hyperbola?
Thx
Not sure
I got to edit my post
22:22
@Ultradark wasn't that funny?
I'm still laughing
yeah lol
0
Q: Do $T_s$ and $H_s$ both describe hyperbolic rotation?

UltradarkConsider the following transformation matrix that slides points on the curve along the curve $\ln(x)\ln(y)=1,$ with $s\in \Bbb R,$ and $(x,y)\in \Bbb R\cap(1,\infty).$ $$ T_s = \begin{bmatrix} e^{e^s} & 0 \\\ 0 & e^{e^{-s}} \end{bmatrix}.$$ We can relate $T_s$ to another transformation matrix $...

Upvoted it mon
Damn, what a laugh riot when someone claims to have solved the TPC even oneself

last day (15 days later) »