# Can I ask this question about the effectiveness of a mathematical programming concept?

I'm thinking of doing an experiment with a JS program to utilize Japanese Multiplication, and I want to ask whether or not a software math shortcut is actually a shortcut at all.

To be clear, I'm contemplating writing a program to get benchmarks for the comparison of normal multiplication and Japanese Multiplication via programming, and I'd like to ask whether or not this makes sense to do before spending time to build the experiment.

Remember, this is a question of whether or not this question is appropriate for this site. Any additional thoughts on the topic should be described either in the comments or answers to the actual question.

I've also asked whether or not this question would be appropriate on Stack Overflow, Programmers SE, and Computer Science SE:

Theoretically, the question would look like this:

## Japanese Multiplication simulation - is a program actually capable of improving calculation speed? Or am I doomed from the start?

On SuperUser, I asked a (possibly silly) question about processors using mathematical shortcuts and would like to have a look at the possibility at the software application of that concept.

I'd like to write a JS simulation of Japanese Multiplication to get benchmarks on large calculations utilizing the shortcut vs traditional CPU multiplication. I'm curious as to whether it makes sense to do this.

My Question: I'd like to know whether or not a software math shortcut, as described above is actually a shortcut at all.

This is a question of programming concept. By utilizing the simulation of Japanese Multiplication, is my program actually capable of improving calculation speed? Or am I doomed from the start?

My theory is that since addition is computed faster than multiplication, a simulation of Japanese multiplication may actually allow a program to multiply (large) numbers faster than the CPU arithmetic unit can. I think this would be a very interesting finding, if it proves to be true.

• /an offtopic note: I, personally, find it hard to believe that any program could perform multiplication on native types (e.g. 64-bit integers) faster than the ALU. But, that doesn't really answer your question here. – apnorton May 18 '14 at 3:40
• That's a fair idea. I'm interested in possibly testing it out on the premise that a well written (very efficiently programmed) calculation might actually succeed since this method of multiplication utilizes addition, which obviously computes a bit faster than multiplication. I think it's plausible that the shortcut might be able to beat default multiplication in speed when large numbers are calculated. Of course, that's the purpose of wanting to ask this question; to make sure I'm not simply wasting my time. @anorton – user151684 May 18 '14 at 3:51
• Either way, I'd be interested to see properly formatted answers from math experts here. We'll see if your answer is received well. @anorton – user151684 May 18 '14 at 4:27

N.B: I'm really tired right now, so I'll have to check back in the morning to make sure that this post is remotely coherent. :)