JPS62154054A - Electronic calculator - Google Patents

Abstract

PURPOSE:To execute the factorization in a short time by obtaining the degree of respective items of an inputted polynomial, executing the factorization with a factor coincident to the obtained degree and inputting the algebraic expression. CONSTITUTION:The degree of respective items of an inputted polynomial is obtained, and by using the factor coincident to the obtained degree, factorization is executed. A data memory part 15 is composed of fine registers to store the data at the time of the factorization action, namely, an A register 15a, a B register 15b, a C register 15c, a D register 15d, an E register 15e, an F register 15f, a G register 15g, an H register 15h and an I register 15i, an address latch circuit 19 executes the address designation of a factorizing table part 22 in accordance with the data sent through a data bus 20 by a latch signal from a control part 12, and the data stored in a factorizing table part 22 are read.

Description

DETAILED DESCRIPTION OF THE INVENTION [Technical Field of the Invention] The present invention relates to a small electronic calculator having a factorization function.

[Prior art and its problems] There is no small electronic calculator that memorizes mathematical formulas using a simpler program than before, and then performs calculations on the mathematical formulas by substituting corresponding numerical values into the variables of the stored formula. Ta.

However, the above-mentioned small electronic calculators only process mathematical expressions using numerical data, and there is no one that processes mathematical expressions with variables intact, such as expanding or factorizing polynomial algebraic expressions. . therefore,
For example, when performing factorization, the user must perform calculations by himself using formulas for solving quadratic equations, etc., and then perform the factorization, which is very troublesome.

[Object of the invention] This invention was made in view of the above-mentioned circumstances.
It is an object of the present invention to provide a small electronic calculator that can perform factorization in a shorter time by inputting algebraic expressions.

[Summary of the Invention] In the present invention, the degree of each term of an input polynomial is determined, and factorization is performed using a factor that matches the determined degree.

[Embodiment 1 of the Invention] An embodiment of the present invention for factorizing a quadratic polynomial using variables A and B will be described below with reference to the drawings.

First, the circuit configuration will be explained with reference to FIG.

In the figure, 11 is a key human power section. In addition to normal numerical keys (represented as rNKj in the figure) 11a and function keys (represented as rFll in the figure) 11b, this key manual section 11 has rAJ key tic, rBJ key lid, and order key for inputting equations. rA to input
(Power)] key 11e and factor key (r in the figure)
FcTRJ) 11f is provided. The key human power signal accompanying the key operation of the key human power section 11 from this machine is sent to the control section 1.
Sent to 2.

This control section 12 controls each of the other circuits according to the key human power signal from the key human power section 11! It performs the 1lII control operation, and connects the register section 14, data memory section 15, stack pointer (represented as rsPJ in the figure) 16, prime number table section 17, and address pointer 1 via the address bus 13.
While outputting an address designation signal to the address latch circuit 8, a latch signal is sent to the address latch circuit 19. The register section 14
consists of an X register 14a and a Y register 14b, and is connected to the data bus 20.

This data bus 20 includes the data memory section 15, stack memory section 21, prime number table section 17, address latch circuit 19, factorization table section 22, and input buffer 2.
3. Connected to the calculation section 24 and display buffer 25. The stack pointer 16 increases or decreases the stored content in accordance with an address designation signal sent from the control unit 12 via the address bus 13, and sends the stored content to the stack memory unit 21 as address designation data. As shown in FIG. 2, the data memory section 15 includes nine registers for storing data during the factorization operation, namely, an A register 15a, a B register 15b, a C register 15c,
D register 15d, E register 15e, F register 15
f, Q register 15Q, H register 15h and 1. It consists of a register 151. Address latch circuit 1 above
9 specifies the address of the factorization table section 22 in accordance with the data sent via the data bus 20 by the latch signal from the control section 12, and reads out the data stored in the factorization table section 22.

The address pointer 18 uses an address designation signal from the address bus 13 to designate the address of the input buffer 23 in order to sequentially store key manual data. The display buffer 25 holds the data sent via the data bus 20 as display data, and also sends the held data to the display section 26 for display.

Next, the operation of the above embodiment will be explained.

Here, the second-order polynomial %formula% Let us factorize.

First, as shown in FIG. 3(1), in order to input a polynomial, the numerical keys 11a1, the function keys 11b, the rAJ keys 11c, rBJ
"A" [△] key 11d and "8" key 11e
J r2J r+J r2J rxJ rAJrxJ
rBJ r+J r9J rxJ rAJ r+JN
When you manually press the key J rBJ rxj rBJ, the control unit 1
2 sequentially sends addressing data to the address pointer 18 and causes the input buffer 23 to store the formula data. The data stored in the input buffer 23 is sent as display data to the display buffer 25 via the data bus 20, and displayed on the display section 26 as "A""ΔJ r2J r+J r2J r tree" as shown in FIG. 3 (1).
“A” “Tree J rBJ r+J r9J rTree”
``A''``+''``1''``8''``*''``B'' are displayed. Note that the symbol "tree" is replaced by the multiplication symbol "×
”, the 24th letter of the alphabet rXJ
This is to distinguish between At this point, the input buffer 23 contains the data "A" displayed on the display section 26.
AJ "Tree J rBJ r+J r9J rTree J rAJ
r+JNJ rBJ r tree""B" and the end code "/" following this are stored.

Next, as shown in FIG. 3(2), when the factor key 11f for specifying execution of factorization is operated, the process shown in FIG. 4 is performed.

In the figure, first, as shown in step 801, the coefficient data "1" of "A2" and the coefficient data "1" of "A1" in the formula data stored in the input buffer 23 are shown.
The coefficient data "18 trees B" of "2 trees B 9" and "AO" are stored in the A register 15a, the B register 15b, and the C register 15G of the data memory section 15, respectively. Next, the process proceeds to step 302, where r is stored in the C register 15G.
The numerical value part "18" of the coefficient data "18 tree 8" of Ao J is read out and decomposed into prime numbers using the prime number data stored in the prime number table section 11 to become r2X32 J. As the divisor data of the numerical value "18" obtained from this r2x32J, "1", "2", "3", "6", "9" and "18" are sequentially stacked according to the address specification of the stack pointer 16. Start address of memory section 21 “0”
is written to "5". At this point, the value of the stack pointer 16 becomes r6J.

Next, in step 303, the coefficient data "2 tree B+9" of "A1" stored in the B register 15b is transferred to the X register 14a. Then, in the following step SO4,
The data newly stored in the register 14a is ``2 tree B + 9''.
”, the order “1” for the variable “8” is the same jister part 1.
4 is stored in the Y register 14b. After that, the process proceeds to step SO5, and the stored data in the Y register 14b is "1".
is then transferred to the D register 15d of the data memory section 15. In the next step 806, the rAo J coefficient data "18 tree B" stored in the C register 15c is transferred to the X register 14a. Then in step SO7
Data rl newly stored in register t4a 8*8
The order "1" for the variable rBJ of J is the same jister part 1
4 is stored in the Y register 14b. After that, the process advances to step 308, and the stored data "1" in the Y register 14b
is then transferred to the E register 15e of the data memory section 15. Then, in the next step 809, according to the numerical data "1" of the D register 15d and the numerical data "1" of the E register 15e, the position is set at the coordinate "1°1" of the factorization table section 22 as shown in the figure. The stored order data rOJ is read out and F register 15fG:I is determined. Then, in the next step 810, it is determined whether this order data is "15". In this case, the numerical data of the F register 15f is "0", so the judgment result is N
0, and the process then proceeds to step S11. Note that if the determination result here is YES, it is determined that factorization is not possible. In the following step S11,
It is determined whether the numerical data of the F register 15f is "0" or "1".

Since the F register 15f is "0" here, the process proceeds to step S12, and numerical data "1" is set in the H register 151-1. Also, the F register 15f is “1”
If it is determined that this is the case, the process proceeds to step 313, and the data stored in the 8 register 15b is transferred to the H register 15h. H in step 812 or step 813
Once the data has been set to the register 15h, the process proceeds to step 314, where the value of the stack pointer 16 is set to "-1".
In addition to updating the value to "5", the numerical data written in the stack memory section 21 according to this value r5J is
18'' and set it in the I register 15i. Next, the process proceeds to step 815, where 18*1 is multiplied by the numerical data "18" in the register 5i and the numerical data "1" in the H register 5h, and the product "18" is newly set in the X register 14a. After that, in step 816, the numerical data "18" of this X register 4a, the B register 15b
Coefficient data of rAI J stored in [2 trees B + 9 J,
Coefficient data “1” of “AO” stored in C register 5G
8 tree B", the operation 182 + (2 tree B + 9) tree 18 + 18 tree B is performed,
It is determined whether the calculation result is "0" or not. In this case, the calculation result is ``r54B+486'', so the judgment result is No, and the process proceeds to step 817, where the calculation 182-(2*B+9) tree 18+18 tree B is performed using the same data as in step S16. Then, it is determined whether the calculation result is rOJ. In this case, the calculation result is "r18B+162", so the determination result here is also No, and the process then proceeds to step 818, where it is determined whether the value of the stack pointer 16 is "o". If it is determined to be "0", it will be impossible to perform factorization, but here the value of stack pointer 16 is "5", so it is determined that it is not "O". , the process returns to step 814 above.

Then, in step 814, the value of the stack pointer 16 is updated by "-1" to "4", and this value "4" is updated.
”, the numerical data “9” written in the stack memory section 21 is read out and set in the I register 15i.

Next, the process proceeds to step 815, where a multiplication 9 tree 1 is performed using the numerical data "9" in the I register 15i and the numerical data "1" in the H register 15h, and the product "9" is newly set in the X register 14a. Thereafter, in step 816, the numerical data r9J of the X register 14a, the coefficient data "2 tree B+9j" of "A1" stored in the B register 15b, and the coefficient data "18 tree B" of rAo J stored in the C register 15C are used. Then, the operation 92 + (2 trees B + 9) trees 9 + 18 trees B is performed,
It is determined whether the calculation result is rOJ or not. In this case, the calculation result is "r36B+162", so the judgment result is No, and the process proceeds to step 817, where the calculation 92- (2 tree B + 9) tree 9 + 18 tree B is performed using the same data as in step 816. Then, it is determined whether the calculation result is rOJ. In this case, since the calculation result is rOJ, the judgment result is YES, and the process proceeds to step S19. In step 819,
Coefficient data “1” of “AO” stored in the C register 15c
8 tree B” and the data “9” in the X register 14a,
Division (18 trees B) ÷ 9 is performed, and the quotient data “2 trees B” is stored in C register 15.
It is set to C. Finally, in step $20, the display buffer 25 displays r (A+9)(A+28)J using the data "9" stored in the X register 14a and the data "2 tree 8" stored in the C register 15C. The data is sent out, the display unit 26 displays a display as shown in FIG. 3(2), and the operation ends.

In this case, the data stored in the C register 15C is
The multiplication symbol "tree j" in "2 tree B" is processed so as to omit its display.

Further, although an explanation using specific data will not be given here, in step 816, the numerical data of the X register 14a, the coefficient data of "A!" stored in the B register 15b, and the "A!" stored in the C register 15c are obtained. The calculation X2 +BX+C is performed using the coefficient data of "AO", and if it is determined that the calculation result is rOJ, the process proceeds to step 321, and the step 31 described above is performed.
Similarly to 9, the division C÷X is performed using the coefficient data of rAoJ stored in the C register 15c and the data in the X register 14a, and the quotient data is set in the C register 15C. Finally, in step 822, display data r(A-X) (A-G)J is sent to the display buffer 25 using the data stored in the X register 4a and the data stored in the G register 5G. Display on the display unit 26,
This operation ends.

[Effects of the Invention] As detailed above, according to the present invention, the degree of each term of the input polynomial is determined and factorization is performed using a factor that matches the determined degree, so that algebraic expressions can be By inputting the information, it is possible to provide a small electronic calculator that can perform factorization in a shorter time.

[Brief explanation of drawings]

The drawings show one embodiment of the present invention, and FIG. 1 is a block diagram showing the circuit configuration, FIG. 2 is a diagram showing the detailed configuration of the data memory section, and FIG. 3 is a diagram showing the key operation. FIG. 4, which is a diagram showing the display state corresponding to this, is a flowchart showing the processing contents of the operation in response to the factor key operation. 11...Key human power department, 11a...Numeric key, 11b
...Function key, 11c...rAJ key,
11d...rBJ key, 11e..."HJ key, 1
1f...factor key (FCTR), 12...I
IJ Z section, 13...Address bus, 14...Register section, 14a...X register, 14b...Y register, 15...Data memory section, 15a...A register, 15b...・B register, 15c...C register, 15d...D register, 15e...E register, 15f...F register, 15g...C register,
15h...H register, 15i...I register, 1
6... Stack pointer, 17... Prime number table section, 18... Address pointer, 19... Address latch circuit, 20... Data bus, 21... Stack memory section, 22... Factor Disassembly table part, 23...
Input buffer, 24... calculation section, 25... display buffer, 26... display section.

Claims (1)

[Claims] an expression input means for key-inputting polynomial data; a storage means for storing the polynomial data obtained by the expression input means; an order determination means for determining the degree of each term of the polynomial data stored in the storage means; 1. A small electronic calculator comprising: factorization processing means for performing factorization using factors based on a determination result of the means.