Journal of Fundamental Mathematics and Applications (JFMA)
Not a member yet
    144 research outputs found

    GENERAL UNCROSSING COVERING PATHS INSIDE THE AXIS-ALIGNED BOUNDING BOX

    Get PDF
    Given the finite set of n_1⋅n_2⋅...⋅n_k points G(n_1,n_2,...,n_k) in R^ such that n_k≥...≥n_2≥n_1∈Z+, we introduce a new algorithm, called MΛI, which returns an uncrossing covering path inside the minimum axis-aligned bounding box [0,n_1−1]×[0,n_2−1]×...×[0,n_k−1], consisting of 3⋅(n_1⋅n_2⋅...⋅n_k−1)−2 links of prescribed length n_k−1 units. Thus, for any n_k≥3, the link length of the covering path provided by our MΛI-algorithm is smaller than the cardinality of the set G(n_1,n_2,...,n_k). Furthermore, assuming k>2, we present an uncrossing covering path for G(3,3,...,3), comprising only 20*3^(k−3)−2 two units long edges, which is constrained by the axis-aligned bounding box [0,4−√3]×[0,4−√3]×[0,2]×...×[0,2]

    CHARACTERIZATION OF WEAKLY PRIME SUBMODULE

    Get PDF
    Let R is a commutative ring with identity and M is a unital R-module. El-bast and Smith (1988) have researched and introduced the multiplication module. Prime submodule has been studied by Ameri (2002). Then Atani and Farzalipour (2007) have extended the prime submodule to weakly prime submodule. Some properties were proved on each paper. This paper will study about characterization of weakly prime submodules

    CONDITIONS ON UNIQUENESS OF LIMIT POINT AND COMPLETENESS IN CONE POLYGONAL METRIC SPACES

    Get PDF
    This paper discusses cone polygonal metric spaces. We analyze some characteristics derived from convergence and Cauchyness of sequences. Our result consists of some conditions on uniqueness of limit point and completeness in cone polygonal metric spaces

    TOPOLOGI DI RUANG METRIK PSEUDO-b_s

    Get PDF
    Dalam tulisan ini dibahas mengenai beberapa sifat metrik pseudo-bsb_s dan topologi dalam ruang metrik pseudo-bsb_s di antaranya kekonvergenan-bsb_s barisan, barisan Cauchy-bsb_s, ruang metrik pseudo-bsb_s lengkap, serta himpunan tertutup-bsb_s

    IMPLEMENTASI KRIPTOGRAFI KURVA ELIPTIK ELGAMAL DI LAPANGAN GALOIS PRIMA PADA PROSES ENKRIPSI DAN DEKRIPSI BERBANTUAN SOFTWARE PYTHON

    Get PDF
    Perkembangan teknologi memberikan dampak terhadap kemajuan di segala bidang kehidupan manusia terutama dalam bidang informasi. Hal ini memberikan dampak positif dan negatif. Salah satu dampak positifnya adalah mudahnya bertukar informasi dari yang bersifat umum atau rahasia melalui internet. Dampak negatifnya adalah data yang bersifat rahasia menjadi kurang aman dan dapat disalahgunakan oleh pihak yang tidak berwenang. Kriptografi kurva eliptik El-Gamal (ECC: Eliptic Curve Cryptosystem) memberikan solusi untuk keamanan suatu informasi. ECC merupakan salah satu metode kriptografi kunci publik yang mempunyai tingkat keamanan tinggi dibandingkan dengan algoritma kunci publik lainnya. Tujuan dari penelitian ini adalah memahami konsep kriptografi kurva eliptik El-Gamal yang akan didefinisikan di Galois field prima. Hasil dari penelitian ini, yaitu penggunaan kurva eliptik El-Gamal di Galois field prima untuk proses pembentukan kunci, proses enkripsi dan proses dekripsi pada suatu data dengan menggunakan Python

    SOME CARTESIAN PRODUCTS OF A PATH AND PRISM RELATED GRAPHS THAT ARE EDGE ODD GRACEFUL

    Get PDF
    Let GG be a connected undirected simple graph of size qq and let kk be the maximum number of its order and its size. Let ff be a bijective edge labeling which codomain is the set of odd integers from 1 up to 2q12q-1. Then ff is called an edge odd graceful on GG if the weights of all vertices are distinct, where the weight of a vertex vv is defined as the sum mod(2k)mod(2k) of all labels of edges incident to vv. Any graph that admits an edge odd graceful labeling is called an edge odd graceful graph. In this paper, some new graph classes that are edge odd graceful are presented, namely some cartesian products of path of length two and some circular related graphs

    NILAI KETAKTERATURAN TOTAL DARI EMPAT COPY GRAF BINTANG

    Get PDF
    Misalkan  adalah suatu graf dan  adalah bilangan bulat positif. Pelabelan-  total pada graf  adalah suatu pemetaan  Bobot titik  dinyatakan  dan bobot sisi  dinyatakan  Suatu pelabelan-  total dikatakan tak teratur total, jika bobot setiap titik berbeda dan bobot setiap sisi berbeda. Nilai ketakteraturan total (totally irregularity strength) dari graf  dinotasikan dengan  adalah nilai  minimum atau label terbesar minimum yang digunakan untuk melabeli graf  dengan pelabelan-k total tak teratur total. Dalam makalah ini diperoleh nilai ketakteraturan total 4 copy graf bintan Sn adalah  dengan  merupakan bilangan bulat positif da

    QUADRATIC POLYNOMIAL OF POWER SUMS AND ALTERNATING POWER SUMS

    Get PDF
    This study aims to construct quadratic polynomials in n for power sums and alternating power sums of consecutive positive integers. In addition, this paper evaluated the said quadratic polynomials under odd and even terms of the series

    PENERAPAN PROGRAM LINIER MENGGUNAKAN METODE DUAL SIMPLEKS DAN METODE QUICK SIMPLEKS UNTUK MEMINIMUMKAN BIAYA (STUDI KASUS: KELOMPOK WANITA TANI (KWT) SENTOSA SANTUL)

    Get PDF
    The Sentosa  Santul Women Farmers Group (KWT) is a group of women farmers in Dusun Santul, Kampar Utara District an is engaged in the field of food crops is chili. The Sentosa Santul Women Farmers group (KWT) uses 4 types of fertilizers for chili plant fertilization, namely hydro complex fertilizer, phonska, NPK Zamrud and goat manure.The KWT wants the minimum fertilizer cost but the nutrients in the plants are met. The method used in this research is the dual simplex method and the quick simplex method. The purpose of this study is to determine the minimum costs that must be incurred by the Womens Farmer Group (KWT) for fertilization using the dual simplex method and the quick simplex method to obtain an optimum and feasible solution. For the dual simplex method, the optimum and feasible solution were obtained using the Gauss Jordanelimination. While the quick simplex method, the solution is illustrated using a matrix to reduce the number of iterations needed to achieve the optimal solution. Based on the research result, it is found that the quick simplex method is more efficient than the dual simplex method. This can be seen from the number of iterations carried out. Dual simplex method iteration there are two iterations and quick simplex one iteration. The dual simplex method and the quick simplex method produce the same value

    KARAKTERISASI DAN BEBERAPA SIFAT RUANG CEC

    Get PDF
    Abstract. In this paper, we define the notion of CEC spaces. We also study about acharacterization and some properties of CEC spaces such as hereditary, topologicalproperty, finite productive, and divisible.Abstrak. Di dalam tulisan ini, didefinisikan ruang CEC. Dibahas pula karakterisasidan beberapa sifat ruang CEC seperti menurun, sifat topologi, produk berhingga, dan terbagi

    0

    full texts

    0

    metadata records
    Updated in last 30 days.
    Journal of Fundamental Mathematics and Applications (JFMA)
    Access Repository Dashboard
    Do you manage Open Research Online? Become a CORE Member to access insider analytics, issue reports and manage access to outputs from your repository in the CORE Repository Dashboard! 👇