Using sona to calculate the greatest common divisor of two integers

Author(s):  
Pedro Henrique Alves Barros ◽  
Patrícia Nunes da Silva
2014 ◽  
Vol 66 (3) ◽  
pp. 479-485 ◽  
Author(s):  
A. M. Romaniv ◽  
V. P. Shchedryk

MATEMATIKA ◽  
2019 ◽  
Vol 35 (3) ◽  
Author(s):  
Nurfarah Zulkifli ◽  
Nor Muhainiah Mohd Ali

Let G be a finite group. The probability of a random pair of elements in G are said to be co-prime when the greatest common divisor of order x and y, where x and y in G, is equal to one. Meanwhile the co-prime graph of a group is defined as a graph whose vertices are elements of G and two distinct vertices are adjacent if and only if the greatest common divisor of order x and y is equal to one. In this paper, the co-prime probability and its graph such as the type and the properties of the graph are determined.


Complexity ◽  
2021 ◽  
Vol 2021 ◽  
pp. 1-15
Author(s):  
Eric Goles ◽  
Ivan Slapničar ◽  
Marco A. Lardies

Real-world examples of periodical species range from cicadas, whose life cycles are large prime numbers, like 13 or 17, to bamboos, whose periods are large multiples of small primes, like 40 or even 120. The periodicity is caused by interaction of species, be it a predator-prey relationship, symbiosis, commensalism, or competition exclusion principle. We propose a simple mathematical model, which explains and models all those principles, including listed extremal cases. This rather universal, qualitative model is based on the concept of a local fitness function, where a randomly chosen new period is selected if the value of the global fitness function of the species increases. Arithmetically speaking, the different interactions are related to only four principles: given a couple of integer periods either (1) their greatest common divisor is one, (2) one of the periods is prime, (3) both periods are equal, or (4) one period is an integer multiple of the other.


Sign in / Sign up

Export Citation Format

Share Document