The ability to calculate sequences defined with mathematical notation. In particular, to calculate the n-th element of a linear sequence a polynomial sequence a geometric sequence a sequence defined ...
We define a discrete ω-sequence of index sets to be a sequence {θ An}n ≥ 0 of index sets of classes of recursively enumerable sets, such that for each n, θ An + 1 is an immediate successor of θ An in ...
Discrete mathematics required for Computer Science, including the basics of logic, number theory, methods of proof, sequences, mathematical induction, set theory, counting, and functions. Discrete ...
remove-circle Internet Archive's in-browser bookreader "theater" requires JavaScript to be enabled. It appears your browser does not have it turned on. Please see ...
In this paper we present combinatorial interpretations and polynomials generalizations for sequences including the Fibonacci numbers, the Pell numbers and the Jacobsthal numbers in terms of partitions ...
ABSTRACT: By extending both arithmetical operations into finite sets of natural numbers, from the entire set of natural numbers successively deleting some residue classes modulo a prime, we invented a ...
Compositions are conceptualized as non alternating sequences of blocks of non-decreasing and strictly decreasing partitions. We find the generating function F(x, y, q) where x marks the size of the ...
On the algorithms for the computation of even discrete cosine transform-2 (EDCT-2) of real sequences
Abstract: An algorithm based on O/sup 2/DFT (odd-time odd-frequency discrete Fourier transform) is presented for the computation of the EDCT-2 of purely real sequences. Comparison of this algorithm ...
Results that may be inaccessible to you are currently showing.
Hide inaccessible results
Feedback