IDEAS home Printed from https://ideas.repec.org/a/ajp/edwast/v9y2025i7p835-850id8743.html
   My bibliography  Save this article

Evaluate all order of every element of higher 100, 105 and 107 order of group for multiplication composition

Author

Listed:
  • Md. Abdul Mannan

  • Kanchon Kumar Bishnu

  • Shoma Islam

  • Md. Shafiul Alam Chowdhury

  • Md. Amzad Hossain

  • Md. Shafikul Islam

  • Sahib Jada Eyakub Khan

  • Hashiara Khatun

Abstract

This paper aims at treating a study on the order of every element of higher 100, 105, and 107 orders of group for multiplication composition. But the composition in G is associative; the multiplication composition is very significant in the order of elements of a group. We develop the order of a group o(G), higher order of groups in different types of order and the order of elements o(a) of a group in real numbers. Let G be a group and let a^n ∈ G be of infinite order n, then find Highest Common Factor (i.e., (n, m) denotes H.C.F of n and m). The Highest Common Factor of two numbers is the “smallest non-zero common number” which is a multiple of both the numbers. So o(a^m) = n / H.C.F(n, m), where (n, m) denotes the H.C.F of n and m. If a ∈ G is of order n, then there exists an integer m for which a^m = e if m is a multiple of n, in general we use this. Then we develop orders of elements of a cyclic group and every element of higher order of a group. After that we find out the order of every element of a group for the higher orders of the group for being binary operation.

Suggested Citation

  • Md. Abdul Mannan & Kanchon Kumar Bishnu & Shoma Islam & Md. Shafiul Alam Chowdhury & Md. Amzad Hossain & Md. Shafikul Islam & Sahib Jada Eyakub Khan & Hashiara Khatun, 2025. "Evaluate all order of every element of higher 100, 105 and 107 order of group for multiplication composition," Edelweiss Applied Science and Technology, Learning Gate, vol. 9(7), pages 835-850.
  • Handle: RePEc:ajp:edwast:v:9:y:2025:i:7:p:835-850:id:8743
    as

    Download full text from publisher

    File URL: https://learning-gate.com/index.php/2576-8484/article/view/8743/2926
    Download Restriction: no
    ---><---

    More about this item

    Keywords

    ;
    ;
    ;
    ;
    ;

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:ajp:edwast:v:9:y:2025:i:7:p:835-850:id:8743. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Melissa Fernandes (email available below). General contact details of provider: https://learning-gate.com/index.php/2576-8484/ .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.