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

    COPRIME GRAPH OF INTEGERS MODULO n GROUP AND ITS SUBGROUPS

    Get PDF
    Coprime Graph is a geometric representation of a group in the form of undirectedgraph. The coprime graph of a group G, denoted by ΓG\Gamma_G is a graph whose vertices are all elements of group G; and two distinct vertices a and b are adjacent if and only if (a,b)=1(|a|,|b|)=1. In this paper, we study coprime graph of integers modulo n group and its subgroups. One of the results is if n is a prime number, then coprime graph of integers modulo n group is a bipartite graph

    ANALISIS TARIF PREMI DAN ASUMSI LOADING PADA PRODUK ASURANSI DWIGUNA BEASISWA

    Get PDF
    Based on data from Badan Pusat Statistik (BPS), the number of Indonesia's population has consistently increased every year. This will cause several problems, one of them is public health. Health problems that occur cause some risks that cause losses. Therefore, one way to reduce the impact of these risks is insurance. This study analyzes how the process of forming premium prices with loading assumptions that are in accordance with existing assumptions in order to meet the criteria of equitable to the client, deliverable by the agent, and profitable to the company. This research uses a quantitative research approach. The population in this study was all Sum Insured (SI) while the sample was 1000 SI male sex. The data used in this study are secondary data that is data from an ABC insurance company in Indonesia, literature study through books, journal references, and previous research. The results of this study are the calculation of premiums by the methods used by the company more efficiently when compared with formulas in accordance with the theory. Although the price of a premium is more expensive using the company method, it is not significantly different. If using the company method, the sum insured used is the sum insured from death benefit whereas the theory is the average of claims incurred at that age. The fees charged are still fairly reasonable in accordance with the rules of setting the price of insurance premiums. In addition, the use of CSO 80 tables and Reinsurance Rates that have been adjusted to the company's interest rate of 5% in accordance with the expected cash value desired by the company

    NEW COUNTING FORMULA FOR DOMINATING SETS IN PATH AND CYCLE GRAPHS

    Get PDF
    Let G=(V(G), E(G)) be a path or cycle graph. A subset D of V(G) is a dominating set of G if for every u element of V(G)\D, there exists v element of D such that uv element of E(G), that is, N[D]=V(G). The domination number of G, denoted by gamma(G), is the smallest cardinality of a dominating set of G. A set D_1 subset of V(G) is a set containing dominating vertices of degree 2, that is, each vertex is internally stable. A set D_2 subset of V(G) is a set containing dominating vertices where one of the element say a element of D_2,  and the rest are of degree 2. A set  D_3 subset of V(G) is a set containing dominating vertices in which two of the elements say b, c element of D_3, deg(b)=deg(c)=1. This paper developed a new combinatorial formula that determines the number of ways of putting a dominating set in a path and cycle graphs of order n>=1 and n>=3, respectively. Further, a combinatorial function P^1_G(n),  P^2_G(n) and P^3_G(n) that determines the probability of getting the set D_1, D_2, and D_3, respectively in graph G of order n were constructed

    SOLVING THE 106 YEARS OLD 3^k POINTS PROBLEM WITH THE CLOCKWISE-ALGORITHM

    Get PDF
    In this paper, we present the clockwise-algorithm that solves the extension in -dimensions of the infamous nine-dot problem, the well known two-dimensional thinking outside the box puzzle. We describe a general strategy that constructively produces minimum length covering trails, for any ∈ N−{0}, solving the NP-complete (3×3×⋯×3)-points problem inside a 3×3×⋯×3 hypercube. In particular, using our algorithm, we explicitly draw different covering trails of minimal length h() = (3^ − 1)/2, for = 3, 4, 5. Furthermore, we conjecture that, for every ≥ 1, it is possible to solve the 3^-points problem with h() lines starting from any of the 3^ nodes, except from the central one. Finally, we cover 3×3×3 points with a tree of size 12

    ANALISIS REGRESI LOGISTIK ORDINAL MENGENAI FAKTOR-FAKTOR YANG MEMPENGARUHI TINGKAT PENDIKAN ANAK DI DESA SAYANG-SAYANG

    Get PDF
    The economic condition of the parents and their level of education are the determining factors for the level of education of the children. The purpose of this study was to analyze the factors affecting the level of education of children (socioeconomic status of parents and parents' latest education). The subjects in this study were 100 people of Sayang-Sayang Village who were determined by simple random sampling technique. Data collection was carried out online using a survey sheet or questionnaire developed with the help of Google Form. The method in analyzing this causal relationship uses ordinal logistic regression analysis. The results showed that the ordinal logistic regression analysis provided two logit models, in which socioeconomic status had a significant effect on the child's education level, while the parents' last education level did not have a significant effect on the child's education level. The first logit model is a logit model that explains the causal relationship between socioeconomic status and the last level of education of high-category children, while the second model is for the middle category level. Research is expected to be one of the references both in the use of ordinal logistic regression and in observing the factors that affect the level of children's education

    PENGEMBANGAN MODEL EPIDEMIK SIRA UNTUK PENYEBARAN VIRUS PADA JARINGAN KOMPUTER

    Get PDF
    This paper is addressed to discuss the development of epidemic model of SIRA (Susceptible-Infected-Removed-Antidotal) for virus spread analysis purposes on a computer network. We have developed the existing model by adding a possibility of antidotal computer returned to susceptible computer. Based on the results, there are two virus-free equilibrium points and one endemic equilibrium point. These equilibrium points were analyzed for stability issues using basic reproduction number and Routh-Hurwitz Method

    NORMA OPERATOR PADA RUANG FUNGSI TERINTEGRAL DUNFORD

    Get PDF
    We are discussed operator norms on spce of Dunford integral function. We show that for a function which Dunford integral, operator from dual space into space of Lebesgue integral  is a bounded linear operator. Furthermore, sets of all bounded linear operator is a linear space and it is a normed space by norm certain. Finally, the distance function generated by the norm is metrix space

    BEBERAPA KARAKTERISTIK BARU PADA FUNGSI TERDEKATI

    Get PDF
    In this paper, discuss the relationship between approachable function with bounded variations, measurement, and absolute continuity. Futhermore, If f is approachable function of interval [a, b] then f is a bounded variation function and f is a measurable function of interval [a, b]. In relation with absolute continuity, if f is an absolute continuous of interval [a, b] then f is approachable function of [a, b]

    A SECRET SHARING SCHEME BASED ON MULTIVARIATE POLYNOMIALS

    Get PDF
    A Secret sharing scheme is a method for dividing a secret into several partialinformation. The secret can be reconstructed if a certain number of partial information is collected. One of the known secret sharing schemes is the Shamir’s secret sharing scheme. It uses Lagrange interpolation (with one indeterminate) for reconstructing the secret. In this paper, we present a secret sharing scheme using multivariate polynomials with the secret reconstruction process using the multivariate interpolation formula derived by Saniee (2007). The resulted scheme can be considered as a generalization of the Shamir’s secret sharing scheme

    RADIKAL SUPERNILPOTENT BERTINGKAT

    Get PDF
    The development of Ring Theory motivates the existence of the development of the Radical Theory of Rings. This condition is motivated since there are rings which have properties other than those owned by the set ring of all integers. These rings are collected so that they fulfill certain properties and they are called radical classes of rings. As the development of science about how to separate the properties of radical classes of rings motivates the existence of supernilpotent radical classes. On the other hand, there exists the concept of graded rings. This concept can be generalized into the Radical Theory of Rings. Thus, the properties of the graded supernilpotent radical classes are very interesting to investigate. In this paper, some graded supernilpotent radical of rings are given and their construction will be described. It follows from this construction that the graded Jacobson radical is a graded supernilpotent radical

    125

    full texts

    144

    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! 👇