Lupa

Iskanje po repozitoriju Pomoč

A- | A+ | Natisni
Iskalni niz: išči po
išči po
išči po
išči po
* po starem in bolonjskem študiju

Opcije:
  Ponastavi


1 - 10 / 15
Na začetekNa prejšnjo stran12Na naslednjo stranNa konec
1.
On the asymptotic density of fermat pseudoprimes to a fixed base
Slobodan Filipovski, 2026, izvirni znanstveni članek

Opis: Fermat's little theorem provides a classical and widely used test for primality: if $n$ is prime and $\gcd(a,n)=1$, then \[ a^{n-1}\equiv 1 \pmod n. \] Composite integers satisfying this congruence are called Fermat pseudoprimes to base $a$, and they represent a fundamental obstruction to Fermat-type primality tests. A classical result of Erd\H{o}s shows that, for each fixed base $a\geq 2$, the set of such numbers has asymptotic density zero. In this note we give a short and elementary proof of this density-zero property for Fermat pseudoprimes, based on ideas of Erd\H{o}s and Niven.
Ključne besede: Fermat pseudoprimes, asymptotic density, primality testing
Objavljeno v RUP: 21.09.2026; Ogledov: 285; Prenosov: 13
.pdf Celotno besedilo (530,46 KB)
Gradivo ima več datotek! Več...

2.
Some results on ▫$\sigma_t$▫-irregularity
Slobodan Filipovski, Darko Dimitrov, Martin Knor, Riste Škrekovski, 2026, izvirni znanstveni članek

Opis: The (\sigma_t)-irregularity (or sigma total index) is a graph invariant defined as [ \sigma_t(G)=\sum_{{u,v}\subseteq V(G)}(d(u)-d(v))^2, ] where (d(z)) denotes the degree of a vertex (z). This irregularity measure was proposed by Réti in 2019 and recently rediscovered by Dimitrov and Stevanović in 2023. In this paper, we remark that (\sigma_t(G)=n^2\operatorname{Var}(G)), where (\operatorname{Var}(G)) is the degree variance of the graph. We show that among all complete bipartite graphs on (n) vertices, one of the corresponding complete bipartite graphs whose part sizes are closest to (n(2-\sqrt{2})/4) and (n(2+\sqrt{2})/4) has the maximum sigma total index. Moreover, various upper and lower bounds for (\sigma_t)-irregularity are provided. In this direction, we establish a relation between the graph energy (\mathcal{E}(G)) and (\sigma_t)-irregularity and derive bounds related to the Laplacian eigenvalues of the graph.
Ključne besede: irregularity, total irregularity, energy of graphs, Laplacian eigenvalues
Objavljeno v RUP: 14.08.2026; Ogledov: 422; Prenosov: 7
.pdf Celotno besedilo (335,30 KB)
Gradivo ima več datotek! Več...

3.
A Collection of Math Competition Problems : Mathematics, undergraduate study programme 2023/2024
Slobodan Filipovski, 2024, drugo učno gradivo

Opis: The International Mathematics Competition (IMC) for university students is an annual mathematics competition open to all undergraduate students of mathematics. The IMC is primarily a competition for individuals, although most participating universities select and send one or more teams of students.
Ključne besede: competition, IMC, mathematics
Objavljeno v RUP: 23.07.2024; Ogledov: 2299; Prenosov: 96
.pdf Celotno besedilo (2,64 MB)

4.
5.
A connection between a question of Bermond and Bollobás and Ramanujan graphs
Slobodan Filipovski, Robert Jajcay, 2021, izvirni znanstveni članek

Ključne besede: cages, Ramanujan graphs, Moore bound
Objavljeno v RUP: 18.10.2021; Ogledov: 14171; Prenosov: 87
URL Povezava na celotno besedilo

6.
Bounds for the energy of graphs
Slobodan Filipovski, Robert Jajcay, 2021, izvirni znanstveni članek

Ključne besede: energy of graphs, conjecture, new bounds
Objavljeno v RUP: 30.07.2021; Ogledov: 4290; Prenosov: 32
URL Povezava na celotno besedilo

7.
Extremal edge-girth-regular graphs
Ajda Zavrtanik Drglin, Slobodan Filipovski, Robert Jajcay, Tom Raiman, 2021, izvirni znanstveni članek

Ključne besede: regular graph, girth, vertex-transitive graph
Objavljeno v RUP: 16.07.2021; Ogledov: 5560; Prenosov: 32
URL Povezava na celotno besedilo

8.
An alternate proof of the monotonicity of the number of positive entries in nonnegative matrix powers
Slobodan Filipovski, 2021, izvirni znanstveni članek

Ključne besede: digraphs, monotonicity, adjacency matrix
Objavljeno v RUP: 04.02.2021; Ogledov: 2853; Prenosov: 33
.pdf Celotno besedilo (265,78 KB)

9.
10.
On a conjecture of Victor Guo
Slobodan Filipovski, Martin Mačaj, 2020, izvirni znanstveni članek

Ključne besede: binomial coefficient, greatest common divisor, primes
Objavljeno v RUP: 10.11.2020; Ogledov: 3341; Prenosov: 73
.pdf Celotno besedilo (223,45 KB)
Gradivo ima več datotek! Več...

Iskanje izvedeno v 0.03 sek.
Na vrh
Logotipi partnerjev Univerza v Mariboru Univerza v Ljubljani Univerza na Primorskem Univerza v Novi Gorici