There are only two hard things in computer science: cache invalidation, naming things, and off-by-one errors
There are only two hard things in computer science: cache invalidation, naming things, and off-by-one errors
Aashu Mahajan wrote:Please guys help me, i already spent more than 2hr on this code to get output according to given question Please what else i can do in existing code to show the ouput like (2,5) (5,7) (11,13) (17, 19).
There are only two hard things in computer science: cache invalidation, naming things, and off-by-one errors
Aashu Mahajan wrote:Hey Guys Finally i did it, i did it, i solved this problem
Thanks to fred rosenberger, Stephan van Hulst for you suggetion
First of all i constrcut an array of int of length 100 and then i made a method that generate prime no. Now when the method is called is it would generate a prime no. series and this those prime series are stored in array then after the problem get very clear. I happy now
kiran kirankukmar wrote:
Hi friend..congrats for that code.I am trying from 2hrs but i cant getting a single error make me confusion.please mail your code to me once i will see and correct my code please...please....
my mail id is kirankiran123456.kk@gmail.com.
please mail me...
There are only two hard things in computer science: cache invalidation, naming things, and off-by-one errors
There are only two hard things in computer science: cache invalidation, naming things, and off-by-one errors
Spot false dilemmas now, ask me how!
(If you're not on the edge, you're taking up too much room.)
Prasad babu wrote:source - chetanasforum (a Job Portal site)
Find 127th twin-prime pair(For more information on what is twin prime, look at Wikipedia)
I just write the code for this yar if you want that source code contact me on spb.1986@gmail.com.
hey this is prasad. i just write the code for this. if you want that contact me on spb.1986@gmail.com k
Don't get me started about those stupid light bulbs. |