Original programming method

A programming method with “One times ten thousands Theory”

This puzzle is created to use the Original programming method named “One times ten thousands Theory”

Recently we are able to use a high ability PC (Personal Computer).

Main clock speed is more than a thousand million times par second.

A phenomenon of one times ten thousands is a very rare phenomenon for human being

But it’s happen a hundred thousands times in PC. It’s a frequent occurrence.

However it is impossible to do for human being. If there is a little possibility to do, it is possible for PC. It is able to do in PC.

I created this method about twenty years ago.

When I teach a subject of electricity in high school, many students stumble on Kirchhoff's Theory. This theory is easy to understand but it is very difficult to calculation.

I thought if there are some questions what easy to calculation (For example all solutions are integer), many students are able to understand to Kirchhoff's Theory

So I develop a method to make many questions to easy to calculations automatically what named “One times ten thousands Theory”  

I 'd like to explain this idea concretely.

For example

Make simultaneous equations what example all solutions are integer.

First time.

Define a coefficient of Ｘ，Ｙ，Ｚ to reasonably integer.

　　３Ｘ＋４Ｙ＋５Ｚ＝ａ

　　４Ｘ−２Ｙ＋６Ｚ＝ｂ

　−２Ｘ＋３Ｙ＋２Ｚ＝ｃ

Next is

Define the solution to Integer.

Ｘ＝１，Ｙ＝２，Ｚ＝３

And calculate ａ，ｂ，ｃ

　　ａ＝　３×１＋４×２＋５×３＝２６

　　ｂ＝　４×１−２×２＋６×３＝１８

　　ｃ＝−２×１＋３×２＋２×３＝１０

So simultaneous equation is

　　３Ｘ＋４Ｙ＋５Ｚ＝２６

　　４Ｘ−２Ｙ＋６Ｚ＝１８

　−２Ｘ＋３Ｙ＋２Ｚ＝１０

So first time It’s define a coefficient of Ｘ，Ｙ，Ｚ reasonably integer and next time define solution to Integer  that we can get a one question of simultaneous equations what solution is integer .

This method is very popular to make questions.

But my Original programming method is a little different from them.

I pay attention to a fact to exist a one question of simultaneous equations what all solution is integer and build algorithm of program.

The algorithm of program is All coefficient of Ｘ，Ｙ，Ｚ defined at random and calculate to use determinant and check the solutions. If when all of the solutions are integer then completion.

I don’t know when it’s completion

But so there is a fact to exist a one question of simultaneous equations what all solutions are integer that it’s complete someday.

This is the Original programming method of “One times ten thousands Theory”

A programming method until now is required more quickly response and more shorter code.

But my method is take a roundabout venture and seek the possibility of one times ten thousands to find solutions.

So recently ability of PC is very high that a time of reach the solution is gradually shorter.

So the time is gradually come up our time of life that it became to practical programming method enough.

2006.2.3 Masato.Kanno

　　　　　戻る