Zorich's "Mathematical Analysis I" Problem 25

  • Thread starter Thread starter Andrei1
  • Start date Start date
  • Tags Tags
    Analysis
AI Thread Summary
The discussion revolves around a problem from Zorich's "Mathematical Analysis I," specifically regarding the representation of numbers on a computer in the form x = ±q^p∑(n=1 to k)(α_n/q^n). The key points include the clarification that n=1 is correct in the summation, as the mantissa must be less than 1, making the first term either 0 or 1/2 when q=2. The order of the number x is defined as the least power p such that q^p exceeds x, with the bounds for p typically being |p| ≤ 1023 and k=53 for a 64-bit IEEE floating point representation, contrasting with the original problem's stated limits of |p| ≤ 64 and k=35. This highlights the importance of understanding the numerical range and representation in computational contexts.
Andrei1
Messages
36
Reaction score
0
Here is a problem from Zorich's "Mathematical analysis I", pg.69.
25. A number $$x$$ is represented on a computer as $$x=\pm q^p\sum_{n=1}^{k}\frac{\alpha_n}{q^n}$$, where $$p$$ is the order of $$x$$ and $$M=\sum_{n=1}^{k}\frac{\alpha_n}{q^n}$$ is the mantissa of the number $$x$$ $$\left(\frac{1}{q}\leqslant M<1\right).$$ Now a computer works only with a certain range of numbers: for $$q=2$$ usually $$|p|\leqslant 64$$, and $$k=35.$$ Evaluate this range in the decimal system.
I suspect this text has misprints: is it correct that $$n=1$$ under $$\sum$$ and why, or it should be $$n=0$$? By order I understand the unique $$p\in\mathbb{Z}$$ such that $$q^{p}\leqslant x<q^{p+1}.$$
 
Technology news on Phys.org
Andrei said:
Here is a problem from Zorich's "Mathematical analysis I", pg.69.

I suspect this text has misprints: is it correct that $$n=1$$ under $$\sum$$ and why, or it should be $$n=0$$? By order I understand the unique $$p\in\mathbb{Z}$$ such that $$q^{p}\leqslant x<q^{p+1}.$$

Hi Andrei,

No misprint - it should really be $$n=1$$, since a mantissa is always less than 1, so with $q=2$ the first term is either $\frac 0 2$ or $\frac 1 2$.

The order, as used here, would be the least power of $p$ that is greater than the number. That is:
$$q^{p-1}\le |x| < q^p$$

I don't know where those bounds for $p$ and $k$ are coming from, but $|p| \le 1023$ and $k=53$ is about the most common, belonging to a 64-bit IEEE floating point number (see wiki).
 
Dear Peeps I have posted a few questions about programing on this sectio of the PF forum. I want to ask you veterans how you folks learn program in assembly and about computer architecture for the x86 family. In addition to finish learning C, I am also reading the book From bits to Gates to C and Beyond. In the book, it uses the mini LC3 assembly language. I also have books on assembly programming and computer architecture. The few famous ones i have are Computer Organization and...
I have a quick questions. I am going through a book on C programming on my own. Afterwards, I plan to go through something call data structures and algorithms on my own also in C. I also need to learn C++, Matlab and for personal interest Haskell. For the two topic of data structures and algorithms, I understand there are standard ones across all programming languages. After learning it through C, what would be the biggest issue when trying to implement the same data...
Back
Top