/sci/ - Science & Math

>>11626008
Hiya!
>Hm I doubt it but I can always try, I could also try for some TA-like position, hope Ill figure it out..
Not a bad option.
>Uh Im not sure why or how it is related to the problem but Ill recheck it, is my solution wrong?
It's not wrong, but this is more concrete. Given any bijection from S (m elements) to itself, it fill fix n elements (could be 0) and permute the rest m-n elements. This actually goes the other way around, too. Given any n elements in the set S, there is a bijection permuting precisely those elements and keeping the rest fixed. Using this idea, it is reasonable to think that m! would work for any such bijection. I'll leave the details to you.
>Also I asked a question on for example f: S -> S, what if f(s) = 1/s; would f(0) return undefined
And I forgot to answer that... sorry about that.

>>11626015
Get obsessed, get possessed! Try going outside with a book, something to write on (Or is it in if it is a notebook? You can close it, so the text would be inside...) and your preferred writing tools. A nice park, a forest, your local shore, whatever. Just minimise the distractions caused by your zoomer mind's internet addiction.