## Search found 2803 matches

### Re: Squares

I don't think you know what you are doing. Why would you need ASCII binary, if not to delay the process? When you multiply 3.3 Mbits by 3.3 Mbits in ASCII it requires 10,890,000,000,000 partial product bits go into a massive Wallace Tree. https://en.wikipedia.org/wiki/Wallace_tree Log₁₀( 2 ³² ) = 9....

### Re: Squares

@Albert. Why do you need to find more shortcuts ?

What is 15 seconds when your multiply will take a week.

What is 15 seconds when your multiply will take a week.

### Re: Squares

I converted your base10_to_2() to use pointers , it only speeds it up by a second or so on 1 million. I've got to convert the acc( i ) to use a pointer into the acc( ) array.. I think array access takes 16 clocks per access.. i think an array( pointer ) takes 1 clock (not sure) ?? I am convinced yo...

### Re: Squares

@Albert. First demonstrate that your algorithm works for 10, 100 and 1000 decimal digit numbers when represented in ASCII base two. I can then accurately predict what your million decimal digit time will be. If you can do a 10 x 10 decimal digit multiply in 100 microsec, then 100 x 100 will only tak...

### Re: Squares

@Albert. Why are you interested in a magicians prop and party toy from over 100 years ago? The Wimshurst Mchine, WM, is a parametric capacitance amplifier powered by rotation of the shaft. It has an energy conversion efficiency of less than 1 part in 1000. The sparks make hot air and the sound of cl...

### Re: Squares

You may be describing a Wimshurst Machine. https://en.wikipedia.org/wiki/Wimshurst_machine A small motor ( maybe solar powered. ) could power thousands of disks to generate voltage.. Power is the rate of flow of energy, which is voltage * current. But the machine produces a voltage only when the cur...

### Re: Squares

My array indexing code is even slower because I do -exx checking when writing code like this. The loop speed limitation will be the bin( txt, 32 ) conversion from Ushort to the 32 character ASCII string, then the memory allocation needed for the continuous extension of that string as it grows. Anyho...

### Re: Squares

@ Albert. Introducing the advancing k marker only doubled the speed of the process over the brute force solution. The use of 9 digit and 29 bit blocks is probably not optimum, but it does seem to give the right answer ever time without too much head scratching. I guess there might be another 5% avai...

### Re: Squares

@Albert. Give these a try. They have not been fully tested yet. How do they rate speed-wise compared to others you have ? '======================================================================= ' Convert base two ASCII binary string to base ten ASCII decimal string '================================...

### Re: Squares

That example of dodicatuana looks like a micrograph of my engine oil.

### Re: Squares

I need to convert long strings of decimals to base2 and base2 back into base10 like a string of 1,000,000 decimal digits converted to base2.. That will generate unreadable 3.010300 megabyte strings of confusing data. You do not need the base change to be fast if it is only needed to convert a few t...

### Re: Squares

What you actually need is specifications. I assumed the input was a human readable base ten string, of ASCII digits 0 to 9, without signs or decimal points. But there are just too many possible binary formats available for me to guess at. I have tried to read your mind, but I am weak and it is too c...

### Re: Squares

No idea of what you remember. Did it handle signs and decimal points, or positive integers only? Here are simple converters that change between a simple string of ASCII decimal digits, to a minimum length string that contains close-packed binary bits. '===============================================...

### Re: Squares

I got it working with added and subtracted values!! what ever you add to one side , you have to subtract from the other side Then you have to square the value added and subtracted , and add it to the n1*n2 : answer = ( n1 * n2 ) + ( added * added ) That works for squares when n1 = n2, but what abou...

### Re: Squares

Well found !

So if the rectangle area a, is side length x, times side length y;

a = x * y

You found the area does not change if you use; a = (x*c) * (y/c)

Because; a = x*c * y/c

so; a = x * y * c/c

and; c/c must = 1;

But only so long as c <> 0.

So if the rectangle area a, is side length x, times side length y;

a = x * y

You found the area does not change if you use; a = (x*c) * (y/c)

Because; a = x*c * y/c

so; a = x * y * c/c

and; c/c must = 1;

But only so long as c <> 0.