24 | Java Program To Check Given Number is Prime or Not | Java For Loop

[@gegtube1]

thanks its the most simple way to find it i will never forget this one

[@ramananstevensmith249]

Wow 🥳 Way of Explaining is Outstanding Sir😍😍 Thanks a lot ☺️

[@ChiragKhimani]

Glad it was helpful! Thank you @Ramanan for your comment. Keep Learning & Keep Shining

[@AswanthSKrishna]

import java.util.Scanner;
public class Prime {
public static void main(String p[]) {

Scanner s=new Scanner(System.in);

System.out.println("Enter a number");

int n=s.nextInt();
int flag=0;


for (int i=2;i

[@Gayathri_712]

Thank you so much sir. Your explanation is awesome.

[@life_123-z8j]

Thank you sir!!!Very good & easy explanation

[@nitinjirawal]

If you traverse halfway through.....you get the result. No need to loop till we reach the number.

[@ChiragKhimani]

Yes, even if you traverse till square root of the number that will also work

[@ThangamaniRIT]

Can you explain how it is ? Or send any links ?

[@shoyebansari7960]

​​​​@@ThangamaniRITIt is one of the way to find prime number in number theory.
If prime numbers less than the square root of the given number doesn't divides the given number then our number is prime.

[@dineshreddy1244]

@@ChiragKhimani can you tell me how write with pen on eclipse screen?

[@shashankmishra6502]

the way of teaching is osm

[@xaviball2911]

clean explanation Sir

[@ChiragKhimani]

Thanks Xaviball 🙌

[@reginahshikanda6478]

Nice Explanation!

[@monimonika9193]

That's an amazing explanation... That I have never seen before.... On point 🎉 thankyou

[@ChiragKhimani]

Thank you @Monika

[@mohdmasaoodraza9315]

wow great explanation sir

[@srikanthbhatthula4318]

Please make a video on remove duplicate from integers and string.

[@ChiragKhimani]

Hi Srikanth, Yes I'll upload it soon

[@PratibhaHembrom-dc5jg]

Thank you vey much bhai.. ❤

[@Routine-cw9bn]

thank you. very simple and good explanation.

[@giridharneeli1618]

Really bro it's just osm❤

[@ChiragKhimani]

Thank you so much 😀

[@martinbeckLXS]

Thank you❤good job!

[@telugucinema4u]

top notch explanation becoming my favourite tutor

[@ChiragKhimani]

Wow, thanks for your comment!

[@sipundas1352]

Thank you so much Sir🙏

[@MohammedAl-Hashemi-n7d]

thank you so much super logic

[@duythaitrieu239]

thanks alottttt
brilliant explaination

[@ChiragKhimani]

Glad it was helpful. Thank you @Duy Thai Trieu for your comment!

[@bachelorcookingchannel3165]

good explaination

[@leelabhandari9374]

Nice solution thanks

[@pshobana8160]

Super explanation 👌 sir thank u

[@ChiragKhimani]

Thank you so much for your words @p shobana

[@Narendra1620]

Just perfect ❤

[@usefullaman]

Sir you are very helpfull thanks

[@ChiragKhimani]

Thanks for your comment!

[@alenjoshiakkala7821]

Nice explanation sir.. What to add in code to print prime number between any two numbers

[@eswarec1422]

Clean & Perfect Explanation Bro... Thanks a Lot ❤️🙌🏻

[@ChiragKhimani]

Glad you liked it! 😇 Thank you for your comment! @ Eswar ❤

[@karmegamvikram1969]

Thank you so much

[@ChiragKhimani]

Thanks @Jarmegam for your comment.

[@justsad2181]

thank you so much

[@sandeepverma790]

Very nice concept brother 😊

[@sandeepverma790]

Thanku bhai

[@Xasanxidig]

Thank you
I understood

[@ChiragKhimani]

Glad it helped. Thanks for your comment @Halyeey Media

[@thesenioredit9523]

Brother it shows that 9 is prime number plz check all of u

[@ChiragKhimani]

Hi, It'll show 9 is not prime as the factors of 9 is 1, 3 & 9
:Pls post your program here so I can check

[@kirankumarkandula4087]

if take num =1;
the answer is not prime

[@japieeeee3187]

The number one is neither a prime nor a composite

[@Reema-qt9ho]

can you please reply me in the comment to check prime numbers using interface

[@ChiragKhimani]

Hi Reema, I am not sure why you need an interface here? Still you can just create interface and have a method declaration inside the interface & just implement in the class

[@mansurmalikov9105]

I tried to upgrade your code and print out all numbers to check if they are prime or not:
int rotatingNum = 7;
for (int j = 1; j

[@ChiragKhimani]

You can create simple methods to check if number is prime or not like "isPrime(num)" then you can just use below logic
int rotatingNum = 7;
for (int j = 1; j

[@francksgenlecroyant]

Your algorithm will be slow as the value of the input is larger since the Big O is O(n²)

[@ImranAnsari-gz1iw]

Badhiya Bhai aap ne hi clear Kiya hai ,baki sab farzi

[@ChiragKhimani]

Thank you @Imran 🙋‍♂️

[@JanmenjaySahoo-g3r]

thank you

[@hi-us6if]

You are fucking genius

[@jayeshmarmat1820]

That was amazing !! 🤩🤩 can you make videos on spy and palindrome numbers too ????

[@ChiragKhimani]

Thanks for your comment Jayesh, Palindrome number video is already available in the playlist.

[@izzedeenalfarra1228]

جزاك الله خير

[@jagana90]

super bro...

[@ChiragKhimani]

Thank you for your comment! @jagan

[@rakeshmanna8949]

Thanks a lot sir

[@mokshasrisirigineedi435]

Tq so much sir

[@ChiragKhimani]

Thank you @M S ❤

[@apurbasaha6818]

thank u sir

[@reveal5081]

Hara Hara mahadeva

[@RangaRajuth]

Simple perfect

[@ChiragKhimani]

Thanks @Ranga!

[@SagarMahat085]

🎩📴

[@alimajeed5308]

hatiw to chit

[@niksri412]

Chirag i was stuck in the same issue where i made i

[@ChiragKhimani]

Glad it helped! Thanks for your comment @Nikhil

[@armyandblink9895]

Thank you sir.
This video helped me very much.

[@ayancr7fan]

Thank you sir

[@madhusudhanbalakrishna305]

thank you

[@reveal5081]

Hara Hara mahadeva

[@snehalbhosale297]

Thank u