This challenge is as follows.
(Uhoh no! Now everyone is going to use reciprocal division. Now all the answers are going to look the same and lose originality, ugh!)
Given two integers multiply them, ... but you can't use the multiplication symbols "*" and "x". As you probably know multiplication is just an extension of successive additions, so this challenge is definitely feasible, as for instance the product of 8 and 5 is five sums of 8 or eight sums of 5:
8 * 5 = 5 + 5 + 5 + 5 + 5 + 5 + 5 + 5, & also ...
= 8 + 8 + 8 + 8 + 8 = 40
1) The two numbers are allowed to be any two integers.
2) The calculation should work on both positive and negative integers.
3) The multiplication product should be correct no matter the order in which the two integer factors are presented.
4) You cannot import any installable modules/libraries not native to the base functions of your programming language.
5) There is no need to worry about expanding the scope of either of the integer sizes as it is highly unlikely that either of the integers would overload your system memory.
6) You cannot use either of the operators "*" or "x" as multiplication operators.
7) In case anybody asks, this is multiplication in base 10, exclusively.
8) New Restriction: One multiplication function/operators are now banned. Sorry Jonathon. Creating a new operator is fine, but using any built in one function multiplication operators are banned.
Desired output is the following:
a x b=c
Again, "x" here is not to be used as an operator, just a character.
So if a is 5 and b is 8, then c should be 40, and vice-versa.
This is code-golf, so the shortest code in bytes wins! Good luck!
Finally, if you could give a brief description of how your program works, everyone will appreciate that, I'm sure. Thanks.