Displaying similar documents to “Mizar Analysis of Algorithms: Algorithms over Integers”

Semantics of MML Query

Grzegorz Bancerek (2012)

Formalized Mathematics

Similarity:

In the paper the semantics of MML Query queries is given. The formalization is done according to [4]

Even partition functions.

Ben Saïd, F., Nicolas, J.-L. (2002)

Séminaire Lotharingien de Combinatoire [electronic only]

Similarity:

A note on codes and kets.

Caragiu, Mihai (2005)

Sibirskie Ehlektronnye Matematicheskie Izvestiya [electronic only]

Similarity:

Bertrand’s Ballot Theorem

Karol Pąk (2014)

Formalized Mathematics

Similarity:

In this article we formalize the Bertrand’s Ballot Theorem based on [17]. Suppose that in an election we have two candidates: A that receives n votes and B that receives k votes, and additionally n ≥ k. Then this theorem states that the probability of the situation where A maintains more votes than B throughout the counting of the ballots is equal to (n − k)/(n + k). This theorem is item #30 from the “Formalizing 100 Theorems” list maintained by Freek Wiedijk at http://www.cs.ru.nl/F.Wiedijk/100/. ...

Jacobi symbols, ambiguous ideals, and continued fractions

R. A. Mollin (1998)

Acta Arithmetica

Similarity:

The purpose of this paper is to generalize some seminal results in the literature concerning the interrelationships between Legendre symbols and continued fractions. We introduce the power of ideal theory into the arena. This allows significant improvements over the existing results via the infrastructure of real quadratic fields.