Does anyone fancy

[poshphil]

writing me two QBasic programs for me?

I need one to work out and print all prime numbers under 1000.

And I need one that uses the Taylor series expansion to calculate exp(x)

You have 10 minutes to do it in btw.

[sayonara]

I have the primes one already done.

Shame it's at home though - I'll rustle up another version now.

Someone else can do the one that actually needs effort.

[Freakozoid]

ok.

wait ten minutes.

[poshphil]

Originally posted by sayonara
I have the primes one already done.

Shame it's at home though - I'll rustle up another version now.

Someone else can do the one that actually needs effort.

Yay!

I'll need the source code though

[MrL_JaKiri]

The taylor expansion's easy.

10 INPUT X
20 LET Q = 1
30 LET T = 0
40 LET E = 0
50 LET P = 1 TO 1000
60 LET T = (X^P)/Q
70 LET E = E + T
80 LET Q = Q*(P+1)
90 NEXT P
100 PRINT E

does it to 1001 iterations

(ofc that's in BBC Basic, don't use QBasic personally)

[Nodrog]

10 PRINT "JIGGLYPUFF"
20 GOTO 10

[[GAP]Obiwan]

<usual_reply>
DO YOUR OWN ****ING HOMEWORK
</usual_reply>

[Evil Skragg]

10 PRINT NODROG HAS CAUGHT "THE GHEY"
20 RUNPROG c:\Docs\mockinglaughter.wav
30 GOTO 10
RUN

[poshphil]

It's not homework, its stuff we're doing in a 3hr practical for physics today, I've already done 3 weeks of it and bored as **** with it, plus its friday afternoon, and the quicker I get it done the quicker i can go home.

Not only this, but the people who are doing the class have no clue. And the keyboards there are crap.

[[GAP]Obiwan]

Originally posted by poshphil
It's not homework, its stuff we're doing in a 3hr practical for physics today, I've already done 3 weeks of it and bored as **** with it, plus its friday afternoon, and the quicker I get it done the quicker i can go home.

Not only this, but the people who are doing the class have no clue. And the keyboards there are crap.

i bet you even moan when having sex!

[sayonara]

10 INPUT X
20 LET Q = 1
30 LET T = 0
40 LET E = 0
50 FOR p = 1 TO 1000
60      LET T = (X ^ p) / Q
70      LET E = E + T
80      LET Q = Q * (p + 1)
90
100 PRINT E
110 NEXT p

qBasic version

It overflows at the moment - I didn't check the maths, just changed it to qB form. Every second I spend doing this increases the risk that someone will discover I have done all my work for the day

[edit - the primes one is giving me hassle 'cos Ican't remember how I did it last time. Apparently qBasic does not get the idea of "if x/n <> int(x/n) then..."]

[pablissimo]

Originally posted by sayonara
[edit - the primes one is giving me hassle 'cos Ican't remember how I did it last time. Apparently qBasic does not get the idea of "if x/n <> int(x/n) then..."]

Use the mod operator, it's % in most languages.

x % n is equivalent to x/n <> int(x/n) I think. Though it could be n % x, can't remember.

[sayonara]

x MOD n in qBasic.

Which returns an integer - huzzah!

[pablissimo]

Hmm, really has been a while since I've done 'all that jazz'.

[poshphil]

yay thanks for the help, we managed to copy off the lecturer guy though

[MrL_JaKiri]

Post his version of the e^x one, I want to see if it's superior.

[queball]

Originally posted by poshphil

I need one to work out and print all prime numbers under 1000.

PRINT "2 3 5 7 11 13 17 19 23 29 31 37 41 43 47"
PRINT "53 59 61 67 71 73 79 83 89 97 101 103 107 109 113"
PRINT "127 131 137 139 149 151 157 163 167 173 179 181 191 193 197"
PRINT "199 211 223 227 229 233 239 241 251 257 263 269 271 277 281"
PRINT "283 293 307 311 313 317 331 337 347 349 353 359 367 373 379"
PRINT "383 389 397 401 409 419 421 431 433 439 443 449 457 461 463"
PRINT "467 479 487 491 499 503 509 521 523 541 547 557 563 569 571"
PRINT "577 587 593 599 601 607 613 617 619 631 641 643 647 653 659"
PRINT "661 673 677 683 691 701 709 719 727 733 739 743 751 757 761"
PRINT "769 773 787 797 809 811 821 823 827 829 839 853 857 859 863"
PRINT "877 881 883 887 907 911 919 929 937 941 947 953 967 971 977"
PRINT "983 991 997"

[sayonara]

Originally posted by queball

[MrL_JaKiri]

Originally posted by MrL_JaKiri
The taylor expansion's easy.

10 INPUT X
20 LET Q = 1
30 LET T = 0
40 LET E = 0
50 LET P = 1 TO 1000
60 LET T = (X^P)/Q
70 LET E = E + T
80 LET Q = Q*(P+1)
90 NEXT P
100 PRINT E

does it to 1001 iterations

(ofc that's in BBC Basic, don't use QBasic personally)

While I was walking in town, I realised that this is wrong

10 INPUT X
20 LET Q = 1
30 LET T = 0
40 LET E = 1
50 FOR P = 1 TO 1000
60 LET T = (X^P)/Q
70 LET E = E + T
80 LET Q = Q*(P+1)
90 NEXT P
100 PRINT E

Is the correct QBasic one.

(Let E = 1, not 0)

[sayonara]

Originally posted by MrL_JaKiri
While I was walking in town, I realised that this is wrong
(Let E = 1, not 0)

That would explain the overflow. Like I said, I didn't check the maths

[Dante Hicks]

Isn't "LET" redundant in QBasic?

a = 1 should be the same as LET a = 1, etc.

[queball]

Originally posted by sayonara
That would explain the overflow. Like I said, I didn't check the maths

That's more likely to be the result of working out the factorial of 1000.

[MrL_JaKiri]

Originally posted by queball
That's more likely to be the result of working out the factorial of 1000.

Well, I meant 100 when I originally posted it.

The explaning line was an edit, so I claim 'error carried through'

[edit]

Perhaps 50 would be better. Or 20.

[queball]

Originally posted by MrL_JaKiri
Well, I meant 100 when I originally posted it.

The explaning line was an edit, so I claim 'error carried through'

9332621544394415268169923885626670049071596826438162146859296389521759999322991560894146397615651828 6253697920827223758251185210916864000000000000000000000000 is still pretty big

[MrL_JaKiri]

Yeah, but if you want e^x to loads of dp...

[edit]

And he didn't say it actually had to work, just that the program was valid.

[Deathjam]

yea i now got qbasic on xp

[poshphil]

Originally posted by MrL_JaKiri
Post his version of the e^x one, I want to see if it's superior.

It's in the physics computer lab. Thats far too far away.

Sorry

[sayonara]

Originally posted by queball
That's more likely to be the result of working out the factorial of 1000.

Like I said, I didn't work out the maths.

[Tobe]

there should be ****ing buttons for this kind of stuff on they keyboard

[W]

const limit=1000
dim b(limit)
a=2:t=1
do while a<=sqr(limit)
for d=0 to limit step a:b(d)=b(d)+1:next d
print a
do while b(a)>0:a=a+1:loop
loop
do while a<=limit
if b(a)=0 then print a
a=a+1
loop

Has the nice side effect of resulting in an array b() of how many prime factors every number lower than the limit has.