Find Prime Numbers in JavaScript Using a Real-Life Example! | Coding tutorial #shorts #javascript

In this video,

we'll see how to find prime numbers using javascript? we’ll use a fun real-life example with chocolates!

Imagine having 5 chocolates. You can give all to one person or split 2 and 3, but you can’t divide it equally among two. That’s what makes 5 a prime number. Now imagine having 6 chocolates you can easily give 3 each to two people. So 6 is not a prime.

We’ll turn this concept into JavaScript logic to detect prime numbers using simple and clear code perfect for beginners and visual learners.

Learn how to write a prime coding and understand how logic connects to real-world ideas.

Don't forget to like, comment, and subscribe if this helped you understand better!To know more watch the full video & Stay tuned here for the tech insights

#javascript #coding #tech #code #errormakesclever

[emptytree]

Time Complexity: O(root(n))
Code:
import math
class Solution:
def isPrime(self, n):
# code here
if n < 2:
return False
if n in (2, 3):
return True
if n % 2 == 0 or n % 3 == 0:
return False

for i in range(5, int(math.sqrt(n)) + 1, 2):
if n % i == 0:
return False
return True

[arshath]

num = int(input("Enter a number: "))

if num <= 1:
print("It is not a prime number")
elif num == 2:
print("It is a prime number")
else:
for i in range(2, int(num ** 0.5) + 1): # optimization
if num % i == 0:
print("It is not a prime number")
break
else:
print("It is a prime number")

This is the correct code

[Llllvvv]

if it's a big int, you can check for divisibility by numbers from 2 up to its square root. If any number in this range divides the integer evenly, it is not a prime number. Otherwise, it is prime.

```python

def is_prime(n):
if n < 2:
return None
if n == 2:
return True

square_root_n = int(n**0.5)

for i in range (2, quare_root_n+1):
if n%i == 0:
return False
else:
return True
```

[seenuvasan]

Anna scala programming language pathi small tutorial poduga anna

[Exploretherealitywith-me]

Plz explain Armstrong and palindrome concept Anna

[sofisulo]

Visual studio access pathi solunga bro...

[SathyaPrakash-ul]

If a number is divisible by 2, 3, 5, 7 then it is a composite(non prime) number otherwise prime number except 1, 2

[MenakaSelvaMuthuKumar]

2 also prime number it can be divided.

[jeevaks]

Bro your example for prime number is wrong
Prime number is an number which can be divided only by one and itself
So according to your example 2 can be equally divided but it is an prime number

[mohamedrasin]

Bro naa ITI muduchu irukken fitter..
But yenakku IT filed la dha romba interested irukku seralaama basic ah yenna course panna valuable ah irukkum plz bro life matter solluga..

[minuanand]

Which programming language are you using ?

[HariBabu-zb]

Yotube channel for Block chain upload pannunga bro

[Exploretherealitywith-me]

Only by learning from yt and practicing one can learn the skill completely??

[vjtamil]

Bro ava ava sliding window, binary search nu poittu irukkan nee innum prime layee sollitu iruuu🤦‍♂️🤦‍♂️

[Toxicworld]

Adhukku straight ah andha for loop laye else condition use pannalameyy
Why flag???

[Nishwan]

Bro can you make a video about that the AI will replace developers and engineers

[Dhana__d]

Plzz anyone teach this code in python😢

[saven]

Flag concept purla bro, need detail information

[Vimalkumar-pnbr]

n=input(int())
If n=7:
Print("it's prime")
Else:
Print("it's not prime")