I dont think anyone even uses answering machines anymore, but back in the day, when they were more popular, they were also hackable. They all had the functionality to listen left voice messages via the phone. This required a 3-digit pin, which you would input during the welcome message and then it would report on how many messages you have and you could select to listen/delete them.
Since it’s only 3 digits, it’s quite easy to brute force. What I did was I just played DTMF signals from 000 to 999 in a row quite fast.
But there is e more efficient way even. Since it needs to be 3 digits, then it can be overlapping in the sequence, meaning for example the sequence 1234567890 actually contains 123, 234, 345, 456, 567, 678, 789 and 890.
[123]4567890
1[234]567890
123[456]7890
1234[567]890
12345[678]90
etc
I have never managed to solve the creation on the most efficient sequence of numbers that contain all 3-digit numbers from 000 to 999. What I have managed to find out is that it is called a ‘de Bruijn sequence’, but im not that savvy to understand the algorithm that is used to generate it. Maybe someone here can solve this, I’d really like to see the sequence, this has been on my mind for 10+ years
Anyway, as I just got the DTMF dolphin on my F0, it brought back those good old memories and I thought it would be a cool addition to the functionality of DTMF dolphin…