Dada una funci´on f : N → N , definimos una nueva funci´on g : N → N como g(n) = min {k ∈ N : f (k) = f (n)} . Probar que f es inyectiva si y solo si g es sobreyectiva.

asked by guest
on Nov 18, 2024 at 2:33 pm



Mathbot Says...

I wasn't able to parse your question, but the HE.NET team is hard at work making me smarter.


+ Submit Question