#### Filter Results:

#### Publication Year

1994

2016

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

- Miodrag Živković
- 1994

For those n < 5000, for which the factorization of 2 n − 1 is known, the first primitive trinomial (if such exists) and a randomly generated primitive 5– and 7–nomial of degree n in GF(2) are given. A primitive polynomial of degree n over GF(2) is useful for generating a pseudo–random sequence of n–tuples of zeros and ones, see [8]. If the polynomial has a… (More)

- Filip Maric, Miodrag Zivkovic, Bojan Vuckovic
- AISC/MKM/Calculemus
- 2012

The Frankl's conjecture, formulated in 1979. and still open, states that in every family of sets closed for unions there is an element contained in at least half of the sets. FC-families are families for which it is proved that every union-closed family containing them satisfies the Frankl's condition (e.g., in every union-closed family that contains a… (More)

- Miodrag Živković
- 2005

Denote by A n the set of square (0, 1) matrices of order n. The set A n , n ≤ 8, is partitioned into row/column permutation equivalence classes enabling derivation of various facts by simple counting. For example, the number of regular (0, 1) matrices of order 8 is 10160459763342013440. Let D n , S n denote the set of absolute determinant values and Smith… (More)

MiodragŽivkovi´c Let F q denote the finite field of order q = p n , where p is prime and n ≥ 1. The multiplicative group F * q of nonzero elements of F q is cyclic and a generator of F * q is called a primitive element. A monic irreducible polynomial whose roots are primitive elements is called a primitive polynomial. It is known [G] that the binary (over… (More)

- MIODRAG ŽIVKOVIĆ
- 2005

MIODRAGŽIVKOVI´C Abstract. We consider some problems, the solution of which requires a massive computation. One of them is the question: are there infinitely many primes of the form P n i=1 (−1) n−i i!? Another interesting problem is to determine the set of absolute values of (0, 1) determinants of order n, for n as large as possible. The question is… (More)

- Miodrag Zivkovic
- Math. Comput.
- 1999

- Ilene H. Morgan, Gary L. Mullen, Miodrag Zivkovic
- Appl. Algebra Eng. Commun. Comput.
- 1996

- Miodrag Zivković
- Vojnosanitetski pregled
- 2016

- Marko Caric, Miodrag Zivkovic
- ArXiv
- 2016

Let V n be the number of equivalence classes of invertible maps from {0, 1} n to {0, 1} n , under action of permutation of variables on domain and range. So far, the values V n have been known for n 6. This paper describes the procedure by which the values of V n are calculated for n 30.