[From ab initio] the expansion of the 194th number system and the introduction of complex numbers

plot summary:
[Machine Xiao Wei] in the [engineer Ah Wei] accompanied by the [nine turn elixir] of the five-turn of the cultivation.
This is to be studied [the expansion of the number system and the introduction of complex numbers].

Drama Start:

Star Calendar April 25, 2016 08:42:55, the Milky Way Galaxy Earles the Chinese Empire Jiangnan Line province.
[Engineer Ah Wei] is working with [machine Xiao Wei] to study [the expansion of the number system and the introduction of complex numbers].

<span style= "FONT-SIZE:18PX;" > #复数的虚部必须是数字 + ' j ' format, otherwise error DEF TMP ():    a = (5-6j) + ( -2-1j)-(3+4j);    Print (a);>>> -11j</span>

both CD and OE are the results:

<span style= "FONT-SIZE:18PX;"                    >if (1) {var r = 20;                      Config.setsector (1,1,1,1);                    Config.graphpaper2d (0, 0, R);                                      Config.axis2d (0, 0,190);                  Axis set var ScaleX = 2*r, ScaleY = 2*r;                   var SpaceX = 3, SpaceY = 3;                  var XS = -15, XE = 15;                  var YS = -15, YE = 15;                    Config.axisspacing (XS, XE, SpaceX, ScaleX, ' X ');                       Config.axisspacing (YS, YE, SpaceY, ScaleY, ' Y ');                            var array2d = [[0, 0], [5,-6], [ -2,-1],[3, 4], [3,-7], [0,-11]];            Remove duplicate point var Pointarray = Removeduplicatedpoint (array2d);                        Number of non-repeating points var points = pointarray.length;            Get the distance array//format as [[Point 1 ordinal, point 2 ordinal, distance value], ...]            var Distancearray = Distancesort (Pointarray); The number of sides var edges = distancearray.length;                        Store the side var linkedarray = [] that need to be connected;                        Number of connected edges var links = 0;                        The set of edges associated with each vertex var edgeofvertex = []; for (var i = 0; i < points; i++) {//Gets a collection of vertex-related edges edgeofve                Rtex = [];                        for (var j = 0; J < edges; J + +) {if (distancearray[j][0] = = I | |                    DISTANCEARRAY[J][1] = = i) {Edgeofvertex.push (distancearray[j]);                    }}//Based on the starting point, look for the shortest length of two edges edgeofvertex.sort (function (A, b) {                return a[2]-b[2];                                });                var choice = 3;                if (Edgeofvertex.length > Choice) {edgeofvertex = Edgeofvertex.slice (0, choice); } Linkedarray = Linkedarray.concat (edGeofvertex);            }//document.write (Linkedarray.join (', ') + ' <br/> ');            Linkedarray = Removeduplicatedpoint (Linkedarray);                        Links = linkedarray.length;                            document.write (Linkedarray.join (', ') + ' <br/> ');            var startPoint, EndPoint, x1, y1, x2, y2;                        Scaled var scale = Scalex/spacex;                for (var i = 0; i < links; i++) {startPoint = linkedarray[i][0];                EndPoint = linkedarray[i][1];                x1 = pointarray[startpoint][0];                y1 = pointarray[startpoint][1];                x2 = pointarray[endpoint][0];                                y2 = pointarray[endpoint][1];            Shape.vectordraw ([[X1,y1], [X2, Y2]], ' red ', scale);                } shape.pointdraw (Pointarray, ' blue ', scale, 1, ' oabcdefghijklmn '); }</span>

<span style= "FONT-SIZE:18PX;" >>>> (3+4j) * (3-4j);(25+0j) >>> (1+1j) **22j</span>

Results OC:

Result OB:

Results OC:

Conjugate plural:

<span style= "FONT-SIZE:18PX;" >>>> complex.conjugate (1+2j);(1-2j) </span>

OA and OB conjugate.

The end of this section, to know how to funeral, please see tell.

[From ab initio] the expansion of the 194th number system and the introduction of complex numbers