Resolved Question
S is a finite set. f: S->S is a function. Prove that if f is injective then there exists....?
S is a finite set. f: S->S is a function. Prove that if f is injective then there exists a positive integer n such that f^n is the identity.
Let f^n represent f composed with itself n times.
What does the ! notation mean? I'm thinking not factorial in this case..
Let f^n represent f composed with itself n times.
What does the ! notation mean? I'm thinking not factorial in this case..
my ask copy right E-mail:710066@qq.com