Skip to Main Content
Java Programming by Pearson
book

Java Programming by Pearson

by Hari Mohan Pandey
May 2024
Intermediate to advanced content levelIntermediate to advanced
889 pages
37h 5m
English
Pearson India
Content preview from Java Programming by Pearson
94 • Java Programming
Explanation: A number is prime if it is completely divisible by 1 and itself, e.g., 1, 3, 5, 7, 11, 13, 17, 19, 23, etc.
To check whether a number is prime or not, start from a counter c 2 ( every number divides by 1 ) and continue
till c num/2 since no number is completely divisible by a number which is more than half of that number.
For example, 12 is not divisible by 7, 8, 9, 10, 11 which are greater than 6. So it should be checked whether
the number divisible by any number num/2 is true; simply print ‘ Number is not prime ’ and exit from the
program, using System.exit(0). If num%c 0 is never true ...
Become an O’Reilly member and get unlimited access to this title plus top books and audiobooks from O’Reilly and nearly 200 top publishers, thousands of courses curated by job role, 150+ live events each month,
and much more.
Start your free trial

You might also like

Java Programming, 1st Edition by Pearson

Java Programming, 1st Edition by Pearson

K. Rajkumar
Object Oriented Programming Through Java by Pearson

Object Oriented Programming Through Java by Pearson

Ramesh Vasappanavara, Anand Vasappanavara, Gautam Vasappanavara
Python Programming by Pearson

Python Programming by Pearson

S.Sridhar, J. Indumathi, V.M. Hariharan

Publisher Resources

ISBN: 9781299486539