Claim Missing Document
Check
Articles

Found 27 Documents
Search

PELATIHAN PEMBUATAN KUIS INTERAKTIF DENGAN APLIKASI QUIZIZZ DALAM PEMBELAJARAN MATEMATIKA Jurnal Pepadu; Ni Wayan Switrayni; I Gede Adhitya Wisnu Wardhana; Irwansyah Irwansyah; Qurratul Aini; Salwa Salwa; Zata Yumni Awanis; Fariz Maulana
Jurnal Pepadu Vol. 4 No. 1 (2023): Jurnal Pepadu
Publisher : LPPM UNIVERSITAS MATARAM

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.29303/pepadu.v4i1.2244

Abstract

Akhir-akhir ini pembelajaran dalam beberapa jenjang pendidikan dilakukan dengan sistem blended learning yaitu memadukan pembelajaran daring dan luring. Dalam kombinasi proses pembelajaran tersebut guru masih kesulitan memberikan materi dan evaluasi pembelajaran matematika yang interaktif dan menyenangkan. Masalah ini dialami pula oleh para guru di Madrasah Aliyah Manhalul Ma’arif. Oleh karena itu, untuk mengatasi masalah tersebut, kegiatan Pengabdian Kepada Masyarakat ini bertujuan untuk mengenalkan para guru Madrasah Aliyah Manhalul Ma’arif khususnya untuk guru matematika dengan pembuatan slide pembelajaran dan kuis interaktif menggunakan aplikasi Quizizz. Adapun metode yang digunakan adalah dalam bentuk pelatihan secara luring. Pelaksanaan Kegiatan Pengabdian Kepada Masyarakat ini sudah berjalan dengan cukup baik dan lancar. Para guru sangat antusias dalam proses pelatihan dan merasakan bahwa kegiatan ini bermanfaat bagi mereka dalam menyusun slide pembelajaran matematika yang interaktif. Dapat disimpulkan bahwa melalui pelatihan ini, para guru Madrasah Aliyah Manhalul Ma’arif sudah mengenal dan mampu menciptakan materi pembelajaran matematika dalam bentuk slide pembelajaran dan quiz interaktif dan menyenangkan bagi para siswa menggunakan aplikasi Quizizz.
Prime submodul of an integer over itself Muhammad Rijal Alfian; Fariz Maulana; Ni Wayan Switrayni; Qurratul Aini; Dwi Noorma Putri; I Gede Adhitya Wisnu Wardhana
Eigen Mathematics Journal Vol. 5 No. 1 Juni 2022
Publisher : University of Mataram

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.29303/emj.v5i1.132

Abstract

One of the sciences used in digital security systems is cryptography. Cryptography is closely related to the integer system, especially prime numbers. Prime numbers themselves have been abstracted a lot. One form of abstraction of prime numbers is the prime ideal. Previous studies have proven that an Ideal  is said to be a prime ideal on  if and only if I is constructed by a prime element. Other studies have also shown how the prime ideal develops. One of them is the research result of Dauns, where the prime ideal form is developed in the form of a prime submodule. A prime submodule is one of the objects in the module, which is an abstraction of prime numbers. Based on these things, it is exciting if the properties of the prime submodule are applied to other module forms, one of which is the integer module.
Some Characteristics of the Prime Graph of Integer Modulo Groups Maulana, Muklas; Wardhana, I Gede Adhitya Wisnu; Switrayni, Ni Wayan; @ Ismail, Ghazali Semil
InPrime: Indonesian Journal of Pure and Applied Mathematics Vol. 5 No. 1 (2023)
Publisher : Department of Mathematics, Faculty of Sciences and Technology, UIN Syarif Hidayatullah

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.15408/inprime.v5i1.29014

Abstract

AbstractThe notion of the prime graph of a ring R was first introduced by Bhavanari, Kuncham, and Dasari in 2010. The prime graph of a ring R, denoted by PG(R) is a graph whose vertices are all elements of the ring, where two distinct vertices x and y are adjacent if and only if xRy = 0 or yRx = 0. In this paper, we study the forms and properties of the prime graph of integer modulo group, and some examples of the number of its spanning trees. In this paper, it is found that for all n, the maximum degree of vertices of PG(Z_n) is n-1 and the minimum degree of its vertices is 1. Then, we show that for all n, PG(Z_n) is neither a Hamiltonian graph nor an Eulerian graph. We also found some examples of the number of its spanning trees.Keywords: prime graph; spanning trees; Hamiltonian graph. AbstrakKonsep mengenai graf prima dari suatu gelanggang R pertama kali diperkenalkan oleh Bhavanari, Kuncham, dan Dasari pada tahun 2010. Graf prima dari suatu gelanggang R, yang dinotasikan dengan PG(R), adalah suatu graf yang simpul-simpulnya merupakan semua elemen dari gelanggang tersebut dengan dua buah simpul x dan y yang berbeda akan bertetangga jika dan hanya jika xRy = 0 atau yRx = 0. Di dalam penelitian ini, dikaji mengenai bentuk-bentuk dan sifat-sifat dari PG(Z_n), dan beberapa contoh dari banyak pohon pembangunnya. Pada penelitian ini, ditemukan hasil bahwa untuk setiap n, derajat maksimal dari simpul-simpul di PG(Z_n) adalah n-1 dan derajat minimum dari simpul-simpulnya adalah 1. Hasil selanjutnya yaitu, untuk setiap n, PG(Z_n) bukan merupakan suatu graf Hamiltonian atau graf Eulerian. Ditemukan juga beberapa contoh dari banyaknya pohon pembangun dari PG(Z_n).Kata Kunci: graf prima; pohon pembangun; graf Hamiltonian. 2020MSC:  05E16, 05C90, 20C05
Submodul Prima Lemah dan Submodul Hampir Prima Pada Z‐modul M_2x2 (Z_9) I Gede Adhitya Wisnu Wardhana; Ni Wayan Switrayni; Qurratul Aini
Eigen Mathematics Journal Vol 1 No 1: Vol 1 No 1 Juni 2018
Publisher : University of Mataram

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (218.633 KB) | DOI: 10.29303/emj.v1i1.6

Abstract

Prime submodule is the abstraction to module theory of prime ideal in ring theory.  A proper submodule N of an R-module M is called prime submodule if for all r in R and m in M such that rm in N implies r in (N:M) or m in N.  Prime submodule also generalized into weakly prime submodule and almost prime submodule.  This study deal with particular cases of both of them in Z-module M_2x2(Z_9), the three submodules are equivalent in case of non-zero submodule.
Analisis Keberhinggaan Matriks Representasi atas Grup Berhingga Muhammad Taufan; Mamika Ujianita Romdhini; Ni Wayan Switrayni
Eigen Mathematics Journal Vol 1 No 1: Vol 1 No 1 Juni 2018
Publisher : University of Mataram

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (364.442 KB) | DOI: 10.29303/emj.v1i1.10

Abstract

Representation of a finite group G over generator linear non singular mxm matrix with entries of field K defined by group homomorphismA : G → GLm(K)Basically, the non singular mxm matrix A(x) which representing the finite group G divided into two, that are the unitary matrix and non unitary matrix . If A(x) is a non unitary matrix, then there exist a unitary matrix which similar to A(x). This research deals to analyze the numbers of one example of a unitary matrix representation over arbitrary finite group G with order n that is permutation matrix, and the number of unitary matrix which is similar to real non unitary matrix representation of arbitrary finite group G order 2. The results showed the numbers of permutation matrix representation is n! and unitary matrix which is similar to non unitary matrix representation is 2.
Analisis Automorfisma Graf Pembagi-nol dari Ring Komutatif dengan Elemen Satuan Kurniawan Sugiarto; Mamika Ujianita Romdhini; Ni Wayan Switrayni
Eigen Mathematics Journal Vol 1 No 1: Vol 1 No 1 Juni 2018
Publisher : University of Mataram

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (332.712 KB) | DOI: 10.29303/emj.v1i1.11

Abstract

Zero-divisor graphs of a commutative ring with identity has 3 specific simple forms, namely star zero-divisor graph, complete zero-divisor graph and complete bipartite zero-divisor graph. Graph automorphism is one of the interesting concepts in graph theory. Automorphism of  graph G is an isomorphism from graph G to itself. In other words, an automorphism of a graph G is a permutation φ of  the set points V(G) which has the property that (x,y) in E(G)  if and only if (φ(x),φ(y)) in E(G), i.e. φ preserves adjacency.This study aims to analyze the form of zero-divisor graph automorphisms of a commutative ring with identity formed. The method used in this study was taking sampel of each zero-divisor graph to represent each graph. Thus, pattern and shape of automorphism of each graph can be determined. Based on the results of this study, a star zero-divisor graph with pattern K_1,(p-1), where p is prime, has (p-1)! automorphisms, a complete zero-divisor graph with pattern K_(p-1), where p is prime, has (p-1)!  automorphisms, and a complete bipartite zero-divisor graph with pattern K_(p-1),(q-1), where p is prime, has (p-1)!(q-1)! automorphisms, when p not equals to q  and 2((p-1)!(q-1)!) automorphisms  when p=q.
Modifikasi Algoritma Kriptografi Hill Chiper dengan Matriks Generalisasi Bilanga Fibonacci dalam Penyandian Pesan Husni Fitroti; Mamika Ujianita Romdhini; Ni Wayan Switrayni
Eigen Mathematics Journal Vol. 4 No. 2 Desember 2021
Publisher : University of Mataram

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.29303/emj.v4i2.107

Abstract

Hill Cipher algorithm is a technique of message encoding by implementing a matrix of order  as a key matrix. The key matrix is a matrix that has a multiplicative inverse. The security of message is measured by the number of processes in encoding. The more processes in encoding the longer time it takes. Consequently, the massage will be more secure. The purpose of this research is to modify the Hill Cipher algorithm by using generalized Fibonacci matrix  whose degree-p  and rank-n . This research showed that for any non-negative integer p and positive integer n, matrix  can be used as a key matrix in Hill Cipher algorithm. The modification of the Hill Cipher algorithm has been done by modifying the former key by making the degree and rank of  as the key used in the encryption and decryption process of data (message).