Quantcast

A community for students. Sign up today!

Here's the question you clicked on:

55 members online
  • 0 replying
  • 0 viewing

dhemmy

  • one year ago

how do you test for primality in java. and if the input is not prime how do you output the product

  • This Question is Closed
  1. MakaiMcClintock
    • one year ago
    Best Response
    You've already chosen the best response.
    Medals 1

    Use the modulus (%) operator. If 0 the number is even, if not it is odd. Discard number if even (and not 0, depending on how you look at it), then for all odd numbers write a recursive method that breaks down the number into its factors

  2. bwCA
    • one year ago
    Best Response
    You've already chosen the best response.
    Medals 1

    http://bit.ly/14hhKHQ

  3. oldrin.bataku
    • one year ago
    Best Response
    You've already chosen the best response.
    Medals 0

    For primality there are many different sieves that allow one to find prime numbers up to a given number; you can just use trial division and see if any of these divide your given number.

  4. oldrin.bataku
    • one year ago
    Best Response
    You've already chosen the best response.
    Medals 0

    http://en.wikipedia.org/wiki/Primality_test#Naive_methods

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

    • Attachments:

Ask your own question

Ask a Question
Find more explanations on OpenStudy

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...

23

  • 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.