|
|
| Line 1: |
Line 1: |
| {{numeral systems}}
| | It is time to address the slow computer issues even if we do not understand how. Just because a computer is working so slow or keeps freezing up; does not indicate to not address the problem and fix it. You may or may not be aware which any computer owner must recognize which there are certain factors which the computer needs to keep the number one performance. The sad fact is that numerous individuals that own a system have no idea that it needs routine repair only like their cars.<br><br>Document files let the consumer to input information, images, tables and other elements to enhance the presentation. The only issue with this structure compared to additional file types including .pdf for illustration is its ability to be readily editable. This means that anyone viewing the file could change it by accident. Additionally, this file structure is opened by other programs but it refuses to guarantee that what you see in the Microsoft Word application may still become the same whenever we view it utilizing another program. However, it's still preferred by most computer users for its ease of utilize and attributes.<br><br>Registry cleaning is significant considering the registry will get crowded and messy whenever it happens to be left unchecked. False entries send the running program shopping for files and directories which have long ago been deleted. This takes time plus uses valuable resources. So, a slowdown inevitably occurs. It is incredibly noticeable whenever you multitask.<br><br>Handling intermittent errors - whenever there is a message to the impact which "memory or hard disk is malfunctioning", you can put inside fresh hardware to replace the faulty piece till the actual issue is found out. There are h/w diagnostic programs to identify the faulty portions.<br><br>Another thing we should check is whether or not the [http://bestregistrycleanerfix.com/registry-reviver registry reviver] system you are considering has the ability to detect files and programs which are advantageous. One of the registry cleaner programs we could try is RegCure. It is helpful for speeding up plus cleaning up issues on the computer.<br><br>Another key element whenever you compare registry products is having a center to manage a start-up tasks. This just signifies which you can select what programs you want to begin when you start your PC. If you have unnecessary programs starting whenever we boot up your PC this usually cause a slow running computer.<br><br>It is important that you remove obsolete registry entries from a program on a regular basis, if you would like a program to run quicker, which is. If you don't keep a registry clean, a time can come whenever your program might stop functioning altogether. Next, the only option will be to reformat the hard drive and begin over!<br><br>A system and registry cleaner is downloaded from the internet. It's user friendly plus the task does not take long. All it does is scan plus then when it finds mistakes, it can fix plus clean those mistakes. An error free registry can safeguard the computer from errors plus provide we a slow PC fix. |
| The '''quater-imaginary''' [[numeral system]] was first proposed by [[Donald Knuth]] in 1955, in a submission to a high-school science talent search. It is a [[Non-standard positional numeral systems|non-standard positional numeral system]] which uses the [[imaginary number]] 2''i'' as its [[base (exponentiation)|base]]. It is able to ([[#Converting into quater-imaginary|almost]]) uniquely represent every [[complex number]] using only the digits 0, 1, 2, and 3.<ref name="knuth1960">{{cite journal|title=An imaginary number system|journal=Communications of the ACM|volume=3|issue=4|date=April 1960|author=Donald Knuth|authorlink1=Donald Knuth }}</ref> (Numbers less than zero, which are ordinarily represented with a minus sign, are representable as digit strings in quater-imaginary; for example, the number −1 is represented as "103" in quater-imaginary notation.)
| |
| | |
| ==Decompose the quater-imaginary==
| |
| <math>\ldots d_3d_2d_1d_0.d_{-1}d_{-2}d_{-3}\ldots</math> means
| |
| :<math>\ldots + d_3\cdot b^3+d_2\cdot b^2+d_1\cdot b+d_0+d_{-1}\cdot b^{-1}+d_{-2}\cdot b^{-2}+d_{-3}\cdot b^{-3}\ldots</math>
| |
| | |
| :<math>b = 2i</math>.
| |
| | |
| as we know,
| |
| | |
| :<math>(2i)^2=-4</math>.
| |
| | |
| so,
| |
| | |
| :<math>\ldots + d_3\cdot (2i)^3+d_2\cdot (2i)^2+d_1\cdot (2i)+d_0+d_{-1}\cdot (2i)^{-1}+d_{-2}\cdot (2i)^{-2}+d_{-3}\cdot (2i)^{-3}\ldots</math>
| |
| :<math>=[...d_4\cdot(-4)^2+d_2\cdot(-4)^1+d_0+d_{-2}\cdot(-4)^{-1}+\ldots ]+2i\cdot[...+d_5\cdot(-4)^2+d_3\cdot(-4)^1+d_1+d_{-1}\cdot (-4)^{-1}+d_{-3}\cdot (-4)^{-2}+\ldots]</math>.
| |
| | |
| The real and imaginary parts of this complex number are thus readily expressed in base −4 as <math>\ldots d_4d_2d_0.d_{-2}\ldots</math> and <math>\ldots d_5d_3d_1.d_{-1}d_{-3}\ldots</math> respectively.
| |
| | |
| ==Converting from quater-imaginary==
| |
| <div class="thumb tright"><div style="width:14em;">
| |
| {|class="wikitable" style="width:100%; margin:0;"
| |
| !''k''
| |
| !(2''i'')<sup>''k''</sup>
| |
| |-
| |
| |align="center"| -5 ||align="center"| −1/32''i''
| |
| |-
| |
| |align="center"| -4 ||align="center"| 1/16
| |
| |-
| |
| |align="center"| -3 ||align="center"| 1/8''i''
| |
| |-
| |
| |align="center"| -2 ||align="center"| −1/4
| |
| |-
| |
| |align="center"| -1 ||align="center"| −1/2''i''
| |
| |-
| |
| |align="center"| 0 ||align="center"| 1
| |
| |-
| |
| |align="center"| 1 ||align="center"| 2''i''
| |
| |-
| |
| |align="center"| 2 ||align="center"| −4
| |
| |-
| |
| |align="center"| 3 ||align="center"| −8''i''
| |
| |-
| |
| |align="center"| 4 ||align="center"| 16
| |
| |-
| |
| |align="center"| 5 ||align="center"| 32''i''
| |
| |-
| |
| |align="center"| 6 ||align="center"| −64
| |
| |-
| |
| |align="center"| 7 ||align="center"| −128''i''
| |
| |-
| |
| |align="center"| 8 ||align="center"| 256
| |
| |}
| |
| {{caption|Powers of 2''i''}}
| |
| </div></div>
| |
| | |
| To convert a digit string from the quater-imaginary system to the decimal system, the standard formula for positional number systems can be used. This says that a digit string <math>\ldots d_3d_2d_1d_0</math> in base ''b'' can be converted to a decimal number using the formula
| |
| :<math>\cdots + d_3\cdot b^3+d_2\cdot b^2+d_1\cdot b+d_0</math>
| |
| For the quater-imaginary system, <math>b = 2i</math>.
| |
| | |
| ===Example===
| |
| To convert the string <math>1101_{2i}</math> to a decimal number, fill in the formula above:
| |
| :<math>1\cdot(2i)^3 + 1\cdot(2i)^2 + 0\cdot(2i)^1 + 1\cdot(2i)^0 = -8i - 4 + 0 + 1 = -3 - 8i</math>
| |
| | |
| Another, longer example: <math>1030003_{2i}</math> in base 10 is
| |
| :<math>1\cdot(2i)^6 + 3\cdot(2i)^4 + 3\cdot(2i)^0 = -64 + 3\cdot 16 + 3 = -13</math>
| |
| | |
| ==Converting into quater-imaginary==
| |
| It is also possible to convert a decimal number to a number in the quater-imaginary system. Every [[complex number]] (every number of the form ''a''+''bi'') has a quater-imaginary representation. Most numbers have a unique quater-imaginary representation, but just as 1 has the two representations [[0.999...|1 = 0.999...]] in decimal notation, so <sup>1</sup>/<sub>5</sub> has the two quater-imaginary representations 1.(0300)…<sub>2''i''</sub> = 0.(0003)…<sub>2''i''</sub>.
| |
| | |
| To convert an arbitrary complex number to quater-imaginary, it is sufficient to split the number into its real and imaginary components, convert each of those separately, and then add the results by interleaving the digits. For example, since –1+4''i'' is equal to –1 plus 4''i'', the quater-imaginary representation of –1+4''i'' is the quater-imaginary representation of –1 (namely, 103) plus the quater-imaginary representation of 4''i'' (namely, 20), which gives a final result of –1+4''i'' = 123<sub>2''i''</sub>.
| |
| | |
| To find the quater-imaginary representation of the imaginary component, it suffices to multiply that component by 2''i'', which gives a real number; then find the quater-imaginary representation of that real number, and finally shift the representation by one place to the right (thus dividing by 2''i''). For example, the quater-imaginary representation of 6''i'' is calculated by multiplying 6''i'' • 2''i'' = –12, which is expressed as 300<sub>2''i''</sub>, and then shifting by one place to the right, yielding: 6''i'' = 30<sub>2''i''</sub>.
| |
| | |
| Finding the quater-imaginary representation of an arbitrary real number can be done manually by solving a system of [[simultaneous equations]], as shown below.
| |
| | |
| ===Example: Real number===
| |
| As an example of a real number we can try to find the quater-imaginary counterpart of the decimal number 7 (or 7<sub>10</sub> since the [[base (exponentiation)|base]] of the decimal system is 10). Since it is hard to predict exactly how long the digit string will be for a given decimal number, it is safe to assume a fairly large string. In this case, a string of six digits can be chosen. When an initial guess at the size of the string eventually turns out to be insufficient, a larger string can be used.
| |
| | |
| To find the representation, first write out the general formula, and group terms:
| |
| :<math>
| |
| \begin{align}
| |
| 7_{10}& = d_{0}+d_{1}\cdot b+d_{2}\cdot b^{2}+d_{3}\cdot b^{3}+d_{4}\cdot b^{4}+d_{5}\cdot b^{5} \\
| |
| & = d_{0}+2id_{1}-4d_{2}-8id_{3}+16d_{4}+32id_{5} \\
| |
| & = d_{0}-4d_{2}+16d_{4}+i(2d_{1}-8d_{3}+32d_{5}) \\
| |
| \end{align}
| |
| </math>
| |
| | |
| Since 7 is a real number, it is allowed to conclude that ''d<sub>1</sub>'', ''d<sub>3</sub>'' and ''d<sub>5</sub>'' should be zero. Now the value of the coefficients ''d<sub>0</sub>'', ''d<sub>2</sub>'' and ''d<sub>4</sub>'', must be found. Because d<sub>0</sub> − 4 d<sub>2</sub> + 16 d<sub>4</sub> = 7 and because—by the nature of the quater-imaginary system—the coefficients can only be 0, 1, 2 or 3 the value of the coefficients can be found. A possible configuration could be: ''d<sub>0</sub>'' = 3, ''d<sub>2</sub>'' = 3 and ''d<sub>4</sub>'' = 1. This configuration gives the resulting digit string for 7<sub>10</sub>.
| |
| | |
| :<math>\begin{align} 7_{10} = 010303_{2i} = 10303_{2i}.\end{align}</math>
| |
| | |
| ===Example: Imaginary number===
| |
| Finding a quater-imaginary representation of a purely complex number is analogous to the method described above for a real number. For example, to find the representation of 6''i'', it is possible to use the general formula. Then all coefficients of the real part have to be zero and the complex part should make 6. However, for 6''i'' it is easily seen by looking at the formula that if ''d<sub>1</sub>'' = 3 and all other coefficients are zero, we get the desired string for 6''i''. That is:
| |
| | |
| :<math>\begin{align}6i_{10} = 30_{2i}\end{align}</math>
| |
| | |
| ===Another conversion method===
| |
| For real numbers the quater-imaginary representation is the same as negative quaternary (base −4). A complex number ''x''+''iy'' can be converted to quater-imaginary by converting ''x'' and ''y''/2 separately to negative quaternary.
| |
| | |
| For example: 35+23i=121003.2<sub>2i</sub>
| |
| | |
| 35 23i÷2i=11.5 11=12-0.5
| |
| 35÷(-4)=-8, remainder 3 12÷(-4)=-3, remainder 0 (-0.5)*(-4)=2
| |
| -8÷(-4)= 2, remainder 0 -3÷(-4)= 1, remainder 1
| |
| 2÷(-4)= 0, remainder 2 1÷(-4)= 0, remainder 1
| |
| 2<small>0</small>0<small>0</small>3 + 1<small>0</small>1<small>0</small>0<small>0</small> + 0.2 = 121003.2
| |
| 32i+16*2-8i-4*0+2i*0+1*3-2*i/2=35+23i
| |
| | |
| ==Radix point "."==
| |
| A [[radix point]] in the decimal system is the usual '''.''' (dot) which marks the separation between the [[integer|integral]] part and the [[fraction (mathematics)|fraction]]al part of the number.
| |
| In the quater-imaginary system a radix point can also be used. For a digit string <math>...d_{5}d_{4}d_{3}d_{2}d_{1}d_{0} . d_{-1}d_{-2}d_{-3}...</math> the radix point marks the separation between positive and negative powers of ''b''. Using the radix point the general formula becomes:
| |
| | |
| :<math>d_5 b^5 + d_4 b^4 + d_3 b^3 + d_2 b^2 + d_1 b + d_0 + d_{-1} b^{-1} + d_{-2} b^{-2} + d_{-3} b^{-3}</math>
| |
| or
| |
| :<math>
| |
| 32id_{5}+16d_{4}-8id_{3}-4d_{2}+2id_{1}+d_{0}+\frac{1}{2i}d_{-1}+\frac{1}{-4}d_{-2}+\frac{1}{-8i}d_{-3}</math>
| |
| <math>=32id_{5}+16d_{4}-8id_{3}-4d_{2}+2id_{1}+d_{0}-\frac{i}{2}d_{-1}-\frac{1}{4}d_{-2}+\frac{i}{8}d_{-3}</math>
| |
| | |
| ===Example===
| |
| If the quater-imaginary representation of the complex unit ''i'' has to be found, the formula without radix point will not suffice. Therefore the above formula should be used. Hence:
| |
| | |
| :<math>
| |
| \begin{align}i & = 32id_{5}+16d_{4}-8id_{3}-4d_{2}+2id_{1}+d_{0}+\frac{1}{2i}d_{-1}+\frac{1}{-4}d_{-2}+\frac{1}{-8i}d_{-3}\\
| |
| & = i(32d_{5}-8d_{3}+2d_{1}-\frac{1}{2}d_{-1}+\frac{1}{8}d_{-3})+16d_{4}-4d_{2}+d_{0}-\frac{1}{4}d_{-2}\\
| |
| \end{align}
| |
| </math>
| |
| | |
| For certain coefficients ''d<sub>k</sub>''. Then because the real part has to be zero: ''d<sub>4</sub> = d<sub>2</sub> = d<sub>0</sub> = d<sub>-2</sub> = 0''.
| |
| For the imaginary part, if ''d<sub>5</sub> = d<sub>3</sub> = d<sub> -3</sub> = 0'' and when ''d<sub>1</sub>=1'' and ''d<sub>-1</sub>=2'' the digit string can be found. Using the above coefficients in the digit string the result is:
| |
| | |
| :<math>\begin{align}i = 10.2_{2i}\end{align}</math>.
| |
| | |
| ==Addition and subtraction==
| |
| It is possible to [[addition|add]] and [[subtraction|subtract]] numbers in the quater-imaginary system. In doing this, there are two basic rules that have to be kept in mind: | |
| | |
| # Whenever a number exceeds 3, ''subtract'' 4 and "carry" −1 two places to the left.
| |
| # Whenever a number drops below 0, ''add'' 4 and "carry" +1 two places to the left.
| |
| | |
| Or for short: "If you '''add''' four, carry '''+1'''. If you '''subtract''' four, carry '''-1'''". This is the opposite of normal long addition, in which a "carry" in the current column requires ''adding'' 1 to the next column to the left, and a "borrow" requires subtracting. In quater-imaginary arithmetic, a "carry" ''subtracts'' from the next-but-one column, and a "borrow" ''adds''.
| |
| | |
| ===Example: Addition===
| |
| Below are two examples of adding in the quater-imaginary system:
| |
| | |
| :<pre>
| |
| | |
| 1 - 2i 1031 3 - 4i 1023
| |
| 1 - 2i 1031 1 - 8i 1001
| |
| ------- + <=> ----- + ------- + <=> ----- +
| |
| 2 - 4i 1022 4 - 12i 12320
| |
| | |
| </pre>
| |
| | |
| In the first example we start by adding the two 1s in the first column (the "ones' column"), giving 2. Then we add the two 3s in the second column (the "2''i''s column"), giving 6; 6 is greater than 3, so we subtract 4 (giving 2 as the result in the second column) and carry −1 into the fourth column. Adding the 0s in the third column gives 0; and finally adding the two 1s and the carried −1 in the fourth column gives 1.
| |
| | |
| In the second example we first add 3+1, giving 4; 4 is greater than 3, so we subtract 4 (giving 0) and carry −1 into the third column (the "−4s column"). Then we add 2+0 in the second column, giving 2. In the third column, we have 0+0+(−1), because of the carry; −1 is less than 0, so we add 4 (giving 3 as the result in the third column) and "borrow" +1 into the fifth column. In the fourth column, 1+1 is 2; and the carry in the fifth column gives 1, for a result of <math>12320_{2i}</math>.
| |
| | |
| ===Example: Subtraction===
| |
| Subtraction is analogous to addition in that it uses the same two rules described above. Below is an example:
| |
| | |
| :<pre>
| |
| - 2 - 8i 1102
| |
| 1 - 6i 1011
| |
| ------- - <=> ----- -
| |
| - 3 - 2i 1131
| |
| </pre>
| |
| | |
| In this example we have to subtract <math>1011_{2i}</math> from <math>1102_{2i}</math>. The rightmost digit is 2−1 = 1. The second digit from the right would become −1, so add 4 to give 3 and then carry +1 two places to the left. The third digit from the right is 1−0 = 1. Then the leftmost digit is 1−1 plus 1 from the carry, giving 1. This gives a final answer of <math>1131_{2i}</math>.
| |
| | |
| ==Multiplication==
| |
| For [[long multiplication]] in the quater-imaginary system, the two rules stated above are used as well. When multiplying numbers, multiply the first string by each digit in the second string consecutively and add the resulting strings. With every multiplication, a digit in the second string is multiplied with the first string. The multiplication starts with the rightmost digit in the second string and then moves leftward by one digit, multiplying each digit with the first string.
| |
| Then the resulting partial products are added where each is shifted to the left by one digit. An example:
| |
| | |
| :<pre>
| |
| 11201
| |
| 20121 x
| |
| --------
| |
| 11201 <--- 1 x 11201
| |
| 12002 <--- 2 x 11201
| |
| 11201 <--- 1 x 11201
| |
| 00000 <--- 0 x 11201
| |
| 12002 + <--- 2 x 11201
| |
| ------------
| |
| 120231321
| |
| </pre>
| |
| | |
| This corresponds to a multiplication of <math>(9-8i)\cdot(29+4i) = 293-196i</math>.
| |
| | |
| ==Tabulated conversions==
| |
| Below is a table of some decimal and complex numbers and their quater-imaginary counterparts.
| |
| | |
| {{col-begin}}
| |
| {{col-break}}
| |
| {| class="wikitable" style="text-align:right"
| |
| |-
| |
| !Base 10!!Base 2''i''
| |
| |-
| |
| |1||'' ''1 <!-- Note: '' '' required for proper vertical spacing -->
| |
| |-
| |
| |2||'' ''2
| |
| |-
| |
| |3||'' ''3
| |
| |-
| |
| |4||'' ''10300
| |
| |-
| |
| |5||'' ''10301
| |
| |-
| |
| |6||'' ''10302
| |
| |-
| |
| |7||'' ''10303
| |
| |-
| |
| |8||'' ''10200
| |
| |-
| |
| |9||'' ''10201
| |
| |-
| |
| |10||'' ''10202
| |
| |-
| |
| |11||'' ''10203
| |
| |-
| |
| |12||'' ''10100
| |
| |-
| |
| |13||'' ''10101
| |
| |-
| |
| |14||'' ''10102
| |
| |-
| |
| |15||'' ''10103
| |
| |-
| |
| |16||'' ''10000
| |
| |}
| |
| {{col-break}}
| |
| {| class="wikitable" style="text-align:right"
| |
| |-
| |
| !Base 10!!Base 2''i''
| |
| |-
| |
| |−1||'' ''103
| |
| |-
| |
| |−2||'' ''102
| |
| |-
| |
| |−3||'' ''101
| |
| |-
| |
| |−4||'' ''100
| |
| |-
| |
| |−5||'' ''203
| |
| |-
| |
| |−6||'' ''202
| |
| |-
| |
| |−7||'' ''201
| |
| |-
| |
| |−8||'' ''200
| |
| |-
| |
| |−9||'' ''303
| |
| |-
| |
| |−10||'' ''302
| |
| |-
| |
| |−11||'' ''301
| |
| |-
| |
| |−12||'' ''300
| |
| |-
| |
| |−13||'' ''1030003
| |
| |-
| |
| |−14||'' ''1030002
| |
| |-
| |
| |−15||'' ''1030001
| |
| |-
| |
| |−16||'' ''1030000
| |
| |}
| |
| {{col-break}}
| |
| {| class="wikitable" style="text-align:right"
| |
| |-
| |
| !Base 10!!Base 2''i''
| |
| |-
| |
| |1''i''||10.2
| |
| |-
| |
| |2''i''||10.0
| |
| |-
| |
| |3''i''||20.2
| |
| |-
| |
| |4''i''||20.0
| |
| |-
| |
| |5''i''||30.2
| |
| |-
| |
| |6''i''||30.0
| |
| |-
| |
| |7''i''||103000.2
| |
| |-
| |
| |8''i''||103000.0
| |
| |-
| |
| |9''i''||103010.2
| |
| |-
| |
| |10''i''||103010.0
| |
| |-
| |
| |11''i''||103020.2
| |
| |-
| |
| |12''i''||103020.0
| |
| |-
| |
| |13''i''||103030.2
| |
| |-
| |
| |14''i''||103030.0
| |
| |-
| |
| |15''i''||102000.2
| |
| |-
| |
| |16''i''||102000.0
| |
| |}
| |
| {{col-break}}
| |
| {| class="wikitable" style="text-align:right"
| |
| |-
| |
| !Base 10!!Base 2''i''
| |
| |-
| |
| |−1''i''||0.2
| |
| |-
| |
| |−2''i''||1030.0
| |
| |-
| |
| |−3''i''||1030.2
| |
| |-
| |
| |−4''i''||1020.0
| |
| |-
| |
| |−5''i''||1020.2
| |
| |-
| |
| |−6''i''||1010.0
| |
| |-
| |
| |−7''i''||1010.2
| |
| |-
| |
| |−8''i''||1000.0
| |
| |-
| |
| |−9''i''||1000.2
| |
| |-
| |
| |−10''i''||2030.0
| |
| |-
| |
| |−11''i''||2030.2
| |
| |-
| |
| |−12''i''||2020.0
| |
| |-
| |
| |−13''i''||2020.2
| |
| |-
| |
| |−14''i''||2010.0
| |
| |-
| |
| |−15''i''||2010.2
| |
| |-
| |
| |−16''i''||2000.0
| |
| |}
| |
| {{col-end}}
| |
| | |
| ==Examples==
| |
| Below are some other examples of conversions from decimal numbers to quater-imaginary numbers.
| |
| | |
| :<math>5 = 16 + (3\cdot-4) + 1 = 10301_{2i}</math>
| |
| | |
| :<math>i = 2i + 2\left(-\frac{1}{2}i\right) = 10.2_{2i}</math>
| |
| | |
| :<math>7 \frac{3}{4} - 7 \frac{1}{2}i = 1(16) + 1(-8i) + 2(-4) + 1(2i) + 3\left(-\frac{1}{2}i\right) + 1\left(-\frac{1}{4}\right) = 11210.31_{2i}</math>
| |
| | |
| ==See also==
| |
| * [[Quaternary numeral system]]
| |
| * [[Complex base systems]]
| |
| * [[Negative base]]
| |
| | |
| ==References==
| |
| *D. Knuth. ''The Art of Computer Programming''. Volume 2, 3rd Edition. Addison-Wesley. pp. 205, "Positional Number Systems"
| |
| | |
| {{Reflist}}
| |
| | |
| {{Donald Knuth navbox}}
| |
| | |
| [[Category:Non-standard positional numeral systems]]
| |
| [[Category:Donald Knuth]]
| |