\(2^n\) in scientific computation and beyond
From MaRDI portal
Publication:2473131
DOI10.1016/j.mcm.2005.02.009zbMath1208.11016OpenAlexW1966692686MaRDI QIDQ2473131
Publication date: 26 February 2008
Published in: Mathematical and Computer Modelling (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.mcm.2005.02.009
Pascal triangleMersenne primesbinary number systemCantor's diagonal argumentnumber \(2^n\)number 1729physical constant
Related Items
SOME IDENTITIES OF k-MERSENNE NUMBERS, Golden ratio in science, as random sequence source, its computation and beyond
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Error-free matrix symmetrizers and equivalent symmetric matrices
- Computing a matrix symmetrizer exactly using modified multiple modulus residue arithmetic
- Solving linear programming problems exactly
- Discrete Weighted Transforms and Large-Integer Arithmetic
- Wavelet transforms versus Fourier transforms
- An Algorithm for the Machine Calculation of Complex Fourier Series
- On a divide-and-correct method for variable precision division
- On the normalization requirement of divisor in divide-and-correct methods
- On Range-Transformation Techniques for Division
- A more efficient range-transformation algorithm for signed-digit division†
- Carry—borrow free sequential quotient generation with segmented signed-digit operands†
- Complementary Two-Way Algorithms for Negative Radix Conversions
- Economical Iterative and Range-Transformation Schemes for Division
- Arithmetic Algorithms in a Negative Base
- Deterministic Division Algorithm in a Negative Base
- A Computer Organization and Programming System for Automated Maintenance
