Versioni i datës 17 qershor 2011 13:33 redakto Armend (diskuto \| kontribute) Përdorues automatikisht të kontrolluar 5.001 edits →‎Compositions of natural numbers over arithmetic progressions ← Redaktim më i vjetër		Versioni i datës 15 korrik 2011 18:38 redakto zhbëje Armend (diskuto \| kontribute) Përdorues automatikisht të kontrolluar 5.001 edits →‎generating function Ndryshimi më pas →
Rreshti 90: that <math>k\in\{pm,pm+s,pm+2s,...\},</math> ==trace of sequences== Trace of sequence Denote by the set of natural numbers and by the set of natural numbers lesser than given natural number m. Lets a m-sequence of natural numbers and the greatest term of sequence c then the sequence where denote number of terms of sequence c thats are equal at j, is called trace of c. Is clear that terms of trace fulfills the conditions Denote by 1. The set of sequences is called bracelet of sequences and for each sequence c from B holds Because 2. The set of sequences is called ring of sequences and for each sequence c from R holds Because The set is called black hole because for each finite sequence a of natural numbers exists natural number n such that in other words each sequence converges to H. Sequence a is of type B if its converge to H from B for example sequence (2,3) is of type B because And sequences that converges to H from R are of type R for example the sequence (0) is of type R because We can see that all sequences thats follow (0) are of type R. My question is how to decide of which type is any given finite sequence of natural numbers, can be done any programme or algorithme. Thanks

Përdoruesi:Armend/nënfaqe: Dallime mes rishikimesh