PROOF OF ALGEBRAIC STRUCTURES (RINGS AND FIELDS) WITH JAVA PROGRAMMING
Many branches of algebraic structures, such as rings and fields, are difficult to comprehend and undesirable due to their abstract character. The testing of algebraic structures can be aided by a computer software application, which makes it simpler and more fun to learn algebraic structures. This p...
Saved in:
| Published in: | EPSILON: JURNAL MATEMATIKA MURNI DAN TERAPAN Vol. 17; no. 1; p. 30 |
|---|---|
| Main Authors: | , |
| Format: | Journal Article |
| Language: | English |
| Published: |
03.06.2023
|
| ISSN: | 1978-4422, 2656-7660 |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | Many branches of algebraic structures, such as rings and fields, are difficult to comprehend and undesirable due to their abstract character. The testing of algebraic structures can be aided by a computer software application, which makes it simpler and more fun to learn algebraic structures. This program is expected to make algebraic structural proofing easier, faster, and more accurate than manual proof. Users and the software in the application are connected through the Cayley table. The Java programming is just used to demonstrate the algebraic structures of rings and fields. The application program's proof results for the subject showed correct results with a quick processing time when compared to manual processing. |
|---|---|
| ISSN: | 1978-4422 2656-7660 |
| DOI: | 10.20527/epsilon.v17i1.8580 |