Possible letter combinations of a dial pad in linear time using a recursive approach
What is your purpose in writing this code? 

If the entire task is enumerate the combinations, it's not possible to do less work than going through all combinations. An \$ n \$ digit number will have between \$ 3^n \$ and \$ 4^n \$ possible combinations, depending on how many of those digits are 7s and 9s. 

On the other hand, additional knowledge about the purpose of the function could guide the search for something more useful. For example, I imagine this function might then be the input to a filter which narrows them down it to dictionary words. In that case, you could preemptively stop searching if there are no words in the dictionary that start with a given prefix. (The trie data structure is a classic option for keeping track of this sort of thing.)



Assorted other comments on the code


Because what you are passing is fundamentally a sequence of keypresses rather than a number per se, consider having remp take a string instead of a number.
Set is probably unnecessary expense and complexity if all you want is to enumerate a few characters. Whatever data type you use, consider sharing an object for all usages of a given digit's letters.
all_possable isn't a particularly descriptive name for that function. I also have no idea what remp means.
Although it doesn't affect the code, the correct spelling is possible.