When dealing with time complexities, I have seen considering `O(n)` and `O(kn)` as equal. Consider constant `k` as an integer > 1. Any way `kn > n`, right? 

Can someone explain this. I am not from Computer Science background.