0

An integer is said to be prime, if it is divisible by only 1 and itself. For example, 2,3,5 and 7 are prime, but 4,6,8 and 9 are not. Write a function that determines whether a number is prime. Use this function in a program that determines and prints all the prime numbers between 2 and 10,000.


I have no clue on how to do this please help thank you

3
Contributors
2
Replies
3
Views
7 Years
Discussion Span
Last Post by firstPerson
0

>I have no clue on how to do this please help thank you
You'd better learn quickly how to deal with this situation without running to someone else for hand holding. The majority of the time, a programmer has no clue how to do something. That's why it's such a difficult field: we actually have to think and figure things out. :icon_rolleyes:

But seriously, "I have no clue how to start" is synonymous with "I'm too stupid to be a programmer". It's like you're telling us not to waste our time helping you because it's a lost cause.

1

>I have no clue on how to do this please help thank you
You'd better learn quickly how to deal with this situation without running to someone else for hand holding. The majority of the time, a programmer has no clue how to do something. That's why it's such a difficult field: we actually have to think and figure things out. :icon_rolleyes:

But seriously, "I have no clue how to start" is synonymous with "I'm too stupid to be a programmer". It's like you're telling us not to waste our time helping you because it's a lost cause.

Yea, what he said.

Votes + Comments
Best coment ever!!! I pist myself laughing
This topic has been dead for over six months. Start a new discussion instead.
Have something to contribute to this discussion? Please be thoughtful, detailed and courteous, and be sure to adhere to our posting rules.