Testability of positive integers
The present research is devoted to representations of arbitrary positive integers.\N\NAn introduction contains a brief note on the integer partition theory and some topics of the integer splitting estimation, as well as on advantages of the multi-valued logic system and some its applications.\N\NThe main attention is given to the following:\N\N-- to prove that the testability \(\tau (n)\) of the set \(N_n=\{1,2, \dots , n\}\) is equal to \(\lceil \log_3(2n+1)\rceil\);\N\N-- to present ``an algorithm to output the representation of an arbitrary positive integer by the form\N\[\N\sum_{i\in X} 3^i- \sum_{j\in Y} 3^j,\N\]\Nwhere \(X\) and \(Y\) are two disjoint sets of some non-negative integers not exceeding \(\tau (n)\).\N\NThe notions of testable and untestable numbers, the testability are explained, some auxiliary examples are noted.
- Asymptotic formulae in combinatory analysis.
- Bijective proofs of some classical partition identities
- scientific article; zbMATH DE number 1178976 (Why is no real title available?)
- On the Partition Function p (n )
- Partitions into \(k\)th powers of terms in an arithmetic progression
- Power partitions
- The development of multiple-valued logic as related to computer science
This page was built for publication: Testability of positive integers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6983284)
