Computer Science 35 Online
OpenStudy (anonymous):

In PS2 I'm having problem with test method for primes... How to solve that?

OpenStudy (anonymous):

I'm not sure what class you are taking, but I would imagine from a pseudocode perspective the best approach to finding out if a number is a prime is to use an incremental loop which divide the number by the loop counter and sees if there is a remainder. If there is no remainder then the number is not a prime. You will ant to skip the number 1 and the number itself so the loop will go from 2 to n-1. prime = true; for (i=2; i < (n-1); i++) { if ((n % i)=0) { prime = false; } } Nothing fancy but a basic Java loop to address the question.

OpenStudy (rsmith6559):

Post your code, ask a specific question and we'll have something to help you with. Otherwise, the answer to your question is: consider the attributes that make a number prime, and develop tests for each of those characteristics.

Latest Questions
PureSoulless: How does smartcore on this site work?
13 minutes ago 5 Replies 10 Medals
KimberlyOFFICAL: pedo
6 hours ago 1 Reply 0 Medals
KimberlyOFFICAL: leo gang
6 hours ago 18 Replies 2 Medals
KimberlyOFFICAL: this is my beautiful Ai daughter
8 hours ago 28 Replies 2 Medals
Breathless: bro if I answer 19 answers correctly I can get to 75 True or false?
9 hours ago 8 Replies 4 Medals
Bones: It's finished lmk what y'all think
3 hours ago 12 Replies 1 Medal