We consider a generalized version of Knuth’s parking problem, in which caravans consisting of a random number of cars arrive at random on the unit circle. Then each car turns clockwise until it finds a free lot to park. Extending a recent work by Chassaing and Louchard [9], we relate the asymptotics for the sizes of blocks formed by occupied lots with the dynamics of the additive coalescent. Ac...

Excel 2007, like its predecessors, fails a standard set of intermediate-level accuracy tests in three areas: statistical distributions, random number generation, and estimation. Additional errors in specific Excel procedures are discussed.Microsoft’s continuing inability to correctly fix errors is discussed. No statistical procedure in Excel should be used until Microsoft documents that the pro...

Recall that a rng is a ring which is possibly non-unital. In this note, we address the problem whether every finitely generated idempotent rng (abbreviated as irng) is singly generated as an ideal. It is well-known that it is the case for a commutative irng. We prove here it is also the case for a free rng on finitely many idempotents and for a finite irng. A relation to the Wiegold problem for...

The combination generator, first proposed by Wichmann and Hill (1982), is constructed by taking the fractional part of the sum of several random number generators. It is probably one of the most popular random number generators used. Its empirical performance is superior to the classical Lehmer congruential generator. However, its theoretical justification is somewhat primitive. In this paper, ...

Arabic Numerals are one of the major aspects to be considered in Arabic language processing. In this paper, we present an approach for developing a numeral checker application for the Arabic language, called “Arabic Numerals Checker”. Arabic Numerals Checker is intended to help users achieve competence in writing according to the Arabic numeral rules. It is supported by an explanation facility ...

We adopt the following convention: i, j, m, n denote natural numbers, K denotes a field, and a denotes an element of K. Next we state several propositions: (1) Let A, B be matrices over K, n1 be an element of Nn, and m1 be an element of Nm. If rng n1 × rngm1 ⊆ the indices of A, then Segm(A + B,n1,m1) = Segm(A,n1,m1) + Segm(B,n1,m1). (2) For every without zero finite subset P of N such that P ⊆ ...

Random numbers are arranged in a circle. At each time step, the lowest number, and the numbers at its two neighbors, are each replaced by new random numbers. That’s all! This step is repeated again and again. What could be simpler than replacing some random numbers with some other random numbers? Who says that complexity cannot be simple? This simple scheme leads to rich behavior beyond what we...

Suppose that a geometrically distributed number of observations are available from an absolutely continuous distribution function F , within this set of observations denote the random number of records by M . This is called geometric random record model. In this paper, characterizations of F are provided in terms of the subsequences entropies of records conditional on events {M ≥ n} or {M = n} ...