Results 1 to 10 of about 63,567 (182)
Adjoint divisors and free divisors [PDF]
We describe two situations where adding the adjoint divisor to a divisor D with smooth normalization yields a free divisor. Both also involve stability or versality.
Mond, David, Schulze, Mathias
core +2 more sources
A novel approach to explore common prime divisor graphs and their degree based topological descriptor. [PDF]
For the construction of a common prime divisor graph, we consider an integer [Formula: see text] with its prime factorization, where [Formula: see text] are distinct primes and [Formula: see text] are fixed positive integers. Every divisor of the integer
Ali N A Koam +3 more
doaj +2 more sources
The mean value of the function d(n)/d*(n) in arithmetic progressions [PDF]
Let d(n) and d*(n) be, respectively, the number of divisors and the number of unitary divisors of an integer n≥1. A divisor d of an integer is to be said unitary if it is prime over n/d.
Ouarda Bouakkaz, Abdallah Derbal
doaj +1 more source
New properties of divisors of natural number [PDF]
The divisors of a natural number are very important for several areas of mathematics, representing a promising field in number theory. This work sought to analyze new relations involving the divisors of natural numbers, extending them to prime numbers ...
Hamilton Brito da Silva
doaj +1 more source
Families of Ramanujan-Type Congruences Modulo 4 for the Number of Divisors
In this paper, we explore Ramanujan-type congruences modulo 4 for the function σ0(n), counting the positive divisors of n. We consider relations of the form σ08(αn+β)+r≡0(mod4), with (α,β)∈N2 and r∈{1,3,5,7}.
Mircea Merca
doaj +1 more source
Alternatif Bir Kakuro Oyunu ile Doğal Sayıların Çarpanları Konusunun Öğretimi: Çarpanlar Oyunu
Zekâ oyunu öğrencilerin çeşitli zihinsel becerilerini işe koştuğu, problemlerin oyunlaştırılmış hali olarak tanımlanmaktadır. Ülkemizde zekâ oyunları 2013 yılından itibaren okullarda seçmeli ders olarak okutulmakta, bu derslerde öğrencilere farklı türden
Gonca İnceoğlu +2 more
doaj +1 more source
Zero-divisor graphs and zero-divisor functors
Inspired by a very recent work of A. Đurić, S. Jevđenić and N. Stopar, we introduce a new definition of zero-divisor graphs attached to rings that includes all of the classical definitions already known in the literature. We provide an interpretation of such graphs by means of a functor that we call zero-divisor functor and which is associated with a ...
Enrico Sbarra, Maurizio Zanardo
openaire +3 more sources
Ramanujan-type congruences modulo 4 for partitions into distinct parts
In this paper, we consider the partition function Q(n) counting the partitions of n into distinct parts and investigate congruence identities of the form Q(p⋅n+p2-124)≡0 (mod4),Q\left( {p \cdot n + {{{p^2} - 1} \over {24}}} \right) \equiv 0\,\,\,\left(
Merca Mircea
doaj +1 more source
Plane Partitions and a Problem of Josephus
The Josephus Problem is a mathematical counting-out problem with a grim description: given a group of n persons arranged in a circle under the edict that every kth person will be executed going around the circle until only one remains, find the position ...
Mircea Merca
doaj +1 more source
On odd integers and their couples of divisors
A composite odd integer can be expressed as product of two odd integers. Possibly this decomposition is not unique. From 2n + 1 = (2i + 1)(2j + 1) it follows that n = i + j + 2ij. This form of n characterizes the composite odd integers.
Giuseppe Buffoni
doaj +1 more source

