To clarify, I'm talking about digital-signatures, not public key encryption.
When I encrypt something with a private key, then it should be decryptable with a public key, as I've understood how asymetric cryptography works.
654 * 987 * 123 = 79.396.254, there are countless sums that could lead to that 79 million answer, that explains private key encryption to me, and can be applied to superficially explain how digital signing works.
But how do you verify with a public key, that it was signed with their private key?
I'm looking for the simplest mathematical way to explain this, perhaps using a similar mathematical analogy.
I'm not looking for a super in-depth explanation, but a superficial analogy for it.