Re: Summation, modulo and decimal
- From: "B. Spin" <spin9@xxxxxxxxxxxx>
- Date: 23 Jan 2006 14:10:42 -0800
> Yikes. What is it you are doing, explicitly?
>The easiest way to do what you want, if what I think you want is
>indeed what you want, is to simply multiply both numbers by 10^6, do
>the modulus, and then divide the result by 10^6. That is, do 147536
>mod 101110, which is 46426; then divide the result by 10^6 to get
>0.046426
Given a number n (real, periodic or not), say, 23.38276345 I want to
"transform" the value to 01.10010111 . The question isn´t to convert
to a binary value or change the base. So I used the (n mod 2) to get
the 0´s and 1´s and then shift to left one digit (multiply by 10).
The "mechanic" of it using Summation that is trapping me. I have not
found a way to shift the number to left while keeping the old value or
just to let it go to the left k places and then get back k places to
the right again without changing the inicial value n.
.
- Follow-Ups:
- Re: Summation, modulo and decimal
- From: Arturo Magidin
- Re: Summation, modulo and decimal
- References:
- Summation, modulo and decimal
- From: spin9
- Re: Summation, modulo and decimal
- From: Arturo Magidin
- Summation, modulo and decimal
- Prev by Date: Re: Cantorian pseudomathematics
- Next by Date: Re: Cantorian pseudomathematics
- Previous by thread: Re: Summation, modulo and decimal
- Next by thread: Re: Summation, modulo and decimal
- Index(es):
Relevant Pages
|