A community for students.

Here's the question you clicked on:

55 members online
  • 0 replying
  • 0 viewing


  • 4 years ago

ps1 def pr(x): print'2' n=1 som=0 prod=1 ## odds= 2*n+1 cmpt=1 ## j=2 ## prim = True while cmpt < x: ## n=n+1 odds=2*n+1 j=2 prim= True while (j < odds) and (prim == True): if odds%j==0: prim = False else: j=j+1 if prim == True: print (n, odds,cmpt) som=som+odds prod=prod*odds print( som, prod) cmpt=cmpt+1

  • This Question is Closed
  1. anonymous
    • 4 years ago
    Best Response
    You've already chosen the best response.
    Medals 0

    Wow you need to use pastebin. also try to use more descriptive names it will make it easier to read. I think you are asking about the prime number exercise. Start with the premise that the number you are testing is prime and test for falseness. like this is_prime = True if the number is 1 then return false do a loop while the index is less then or equal to the square of the number to check if number % index == 0 then return false index = index + 1 return True So as you can see from the pseudo code that all you do is see if there is a remainder.

  2. anonymous
    • 4 years ago
    Best Response
    You've already chosen the best response.
    Medals 0

    my code work but thanks for your advices jimtuv

  3. Not the answer you are looking for?
    Search for more explanations.

    • Attachments:

Ask your own question

Sign Up
Find more explanations on OpenStudy
Privacy Policy

Your question is ready. Sign up for free to start getting answers.

spraguer (Moderator)
5 → View Detailed Profile

is replying to Can someone tell me what button the professor is hitting...


  • Teamwork 19 Teammate
  • Problem Solving 19 Hero
  • You have blocked this person.
  • ✔ You're a fan Checking fan status...

Thanks for being so helpful in mathematics. If you are getting quality help, make sure you spread the word about OpenStudy.

This is the testimonial you wrote.
You haven't written a testimonial for Owlfred.