flat assembler
Message board for the users of flat assembler.
Index
> Heap > Request for Tomasz 
Author 

0.1
And if it is still unclear as what I want to say:
For example, for starting up, post some info about how to rotate a point in 3D. And please explain the Maths behind it, along with how it can be done in asm. _________________ Code: o__= ) (\ /\ 

28 Sep 2007, 09:56 

vid
there were such things posted by tomasz already, about division by multiplying. try searching, or maybe someone will post a link.
i quess rotating point in 3D is too mundane task for tomasz, you can figure that out with knowledge of trigonometry and common sense. 

28 Sep 2007, 21:19 

0.1
fine!
_________________ Code: o__= ) (\ /\ 

29 Sep 2007, 04:31 

0.1
Tomasz can you please post a formula for finding primes?
_________________ Code: o__= ) (\ /\ 

29 Sep 2007, 10:28 

polygon7
0.1 wrote: Tomasz can you please post a formula for finding primes? Hi, search for "Sieve of Eratosthenes" in google and for "prime number" on mathworld.wolfram.com. _________________ best regards p7 

02 Oct 2007, 20:20 

0.1
Thanks polygon7!
I know the sieve method But I had heard that there is no direct way to find an Ndigit prime number And if someone had such a formula he would be ruling the entire computer based IT industry, be it banks, defense or stock markets etc. And I heard it on a TV serial  NUMB3RS on AXN _________________ Code: o__= ) (\ /\ 

04 Oct 2007, 10:21 

Chewy509
0.1 wrote:
Correct, there is no current method to factorise any number n(1). If we could, RSA (and Public Key Encryption) would be marked as broken... Hint: Your Public key = Private Key 1 * Private Key 2. Where Both private keys are prime numbers. 

04 Oct 2007, 23:41 

0.1
Thanks Chewy509!
I hope Tomasz will soon awake the Mathematician in him and will go to solitude for a period of time and will come up with the solutions, and will give it to me using PM on this board, and I will then become richer than Bill Gates! Day dreaming . . . _________________ Code: o__= ) (\ /\ 

05 Oct 2007, 05:12 

ATV
0.1 check "Prime Finder" in Hugi Size Coding Compo #12
http://www.hugi.scene.org/compo/compoold.htm#compo12 Maybe you can change that 1 million limit something like 4294967295th prime or even more _________________ 6213186413*2^605+1 divides Fermat F(600) and 121531*2^30260+1 divides Fermat F(30256) 

05 Oct 2007, 07:04 

0.1
Geeeeee!
ATV, you're asking me to do that I am very *DUMB* at Maths and *Assembly Language* Yeah, Tomasz may do that, but he seems toooooooooooooooooooo busy these days (he always IS)! PS: Not tu menshan my puar inglish _________________ Code: o__= ) (\ /\ 

05 Oct 2007, 07:10 

edfed
thales and phytagore are the basis of 3D
and to find a prime number ( thing that is fully unusefull for me) you have to divide the number? by all prime numbers that are at max the half of your number? logic to do 3d there are a lot of exemples in asm 

07 Oct 2007, 01:39 

rugxulo
0.1, look through the old VLA DOS tutorials, some easy 3D stuff there.


07 Oct 2007, 04:23 

0.1
Thanks edfed & rugxulo !
_________________ Code: o__= ) (\ /\ 

08 Oct 2007, 04:38 

Furby
Kill all the 0.1's


08 Oct 2007, 15:21 

vid
Furby: ?!?!?


08 Oct 2007, 16:37 

edfed
happy 4444 posts Vid
happy 4444 posts Vid happy 4444 posts Vid happy 4444 posts Vid 

09 Oct 2007, 00:31 

< Last Thread  Next Thread > 
Forum Rules:

Copyright © 19992020, Tomasz Grysztar.
Powered by rwasa.