What if we need to find minimum number of prime numbers to represent a number N as sum of prime numbers. The number of prime numbers can be 3, 4 ,5 etc . How would i soove such kind of problem
Sorry but do you remember what were you going to teach us in this video??? And btw i shouldn't be equal to n because of this number will never be Prime... I hope you will be careful in your next video. Well tried👏👏
In the IsPrime function the return would be a flag. In the video you might see it as 'return IsPrime'. Please consider it as 'return flag'.
Yes that I had noticed.
Very nice concept thank you so much mam
1:17 First prime number you would encounter is 2
mam there is a mistake in is prime function you should run a loop from i=2;i
correct
Why till sqrt of n??
Thank you so much. i can understand this solution.
Simple,sort and best video 👍
💯💯💯
Excellent tutorial. Thanks a lot
What if we need to find minimum number of prime numbers to represent a number N as sum of prime numbers. The number of prime numbers can be 3, 4 ,5 etc . How would i soove such kind of problem
Thanks a lot, just what I was looking for
Very nice sister👍👍
Nice explanation ❤️🔥
Would like to have the same program, in javascript for console . Would be glad to have assistance
Guvi class question
please delete the video or correct it and repload it ,please don't keep this video for views.
Love this series. Thanks, Faceprep!
How to write an algorithm to show a number as a sum of three prime no.?(in sosml)
did u figure out or not because I need help with it
For 3 prime no. What we do?
u said sum of two primes but u wrote given no is prime or not..or print prime numbers between that range
Hi, please watch the complete video. The logic to check if a given number can be expressed as the sum of two prime numbers or not is explained.
In the function isprime() u should return the flag value!!! :}
Thats correct buddy thanks for pointing it out.
In isprime function we should flag1 why we are returning the isprime function
bro just correct there is would be returned flag ...simple
Bolivian Beimar Wilfredo Lopez solved the Riemann Millenium Problem 2021
got the logic
how to express a number as a sum of three prime numbers
the above code is not working
Hi! For the complete code, please check the link in the description box of this video. The code works perfectly fine.
thanks
Sorry but do you remember what were you going to teach us in this video??? And btw i shouldn't be equal to n because of this number will never be Prime... I hope you will be careful in your next video. Well tried👏👏
Ist prime number is 2 Madam
Got it 👍🏼
Thxxx! ❣📍
💯💯💯