A relaxing place
Monday, February 23, 2015
Characterizing 2 x 2 matrices squaring to the identity
Saturday, October 18, 2014
Some number theory questions
- For all n > 1, n does not divide
2n−1 .
Proof: Suppose not. Then n is odd as2n−1 is odd. Letp be the smallest prime dividing n. We have(p−1,n)=1 . By division algorithm,n=q(p−1)+k for some integers q and k with0<k<p . By Fermat’s Little Theorem,2p−1≡1 (mod p), so2k≡(2p−1)q2k≡2n≡1 (mod p). This results in a contradiction by infinite descent.
Written with StackEdit.
Sunday, June 15, 2014
Universal enveloping algebra
For a complex Lie algebra
For any complex associative algebra
Theorem (Poincare-Birkhoff-Witt). Let
Sunday, June 8, 2014
Chatting
Last night I had dinner with Brian. We talked about a lot of things, from social issues, politics to love affairs. One interesting question we discussed is why quite some friends in our circles are still single, given that they are very good persons. We didn’t arrive at a definite conclusion, but I believed that one factor is that our circle consists of people who are independent. Anyway, I wish every one of my friends can find his/her Miss/Mr. Right.
Recently Brian is reading a book about the philosophy of travel. The author is Alain de Butoon. It seems that he had written some interesting books. I hope I can find some time to read one.
Saturday, June 7, 2014
Test post
The Lie bracket of
The following is due to Euler:
測試:
There are three crazy guys in mathematics:
- Hilbert
- von Neumann
- Grothendieck
滾滾長江東逝水 浪花淘盡英雄
#include <iostream>
using namespace std;
int main()
{
cout << "Good!!!" << endl;
}
Written with StackEdit.