| Author |
c+ programming |
trini
Joined: Feb 19, 2008
Posts: 0
PM |
how do i display all prime integers between 1 and 25000 stating if the integer is abundant of deficient, and display all abundant integers that are divisible by 7 and 5 at the same time by a range of 1 to 10000. |
|
|
Nipsen
Joined: Jul 31, 2007
Posts: > 500
From: Noway
PM, WWW
|
You just take one thing at a time.
And then you give up, install java, make an abstract class for the variations - and produce the product through a set of simple functions through syntax it's possible to understand, with consistent results regardless of size, earth- rotation and the computer's mood. Ehm. Nevermind.. |
himlims_nl
Joined: Apr 06, 2004
Posts: > 500
PM |
welke at esato
no offence; but you just might try the wrong forum.
try sysmbian developers, for integers etc. are MANY MANY MANY MANY MANY tutorials on the web.
code.google.com might be a good place to start
|
tesssst
Joined: Oct 26, 2007
Posts: 98
PM |
hah that guy was funny
You do know though that a prime number could be divided by itself and 1 only?
just a thought...
P.s.On slightly other note would a Ries algorithm do? - lol
[ This Message was edited by: tesssst on 2008-02-19 21:07 ] |
Krubach
Joined: Dec 05, 2002
Posts: > 500
From: Sunny Portugal! :)
PM |
Well, i don't know much about C+.
If it was C or C++ I would gladly help you.  
If you want all prime number between 1 and 25000 that are divisible by 5 and 7, the result is:
.
.
.
.
.
.
5 and 7  |
|
|
Posted: 2008-02-19 16:21
