__ what is prime numbers:-__

Prime numbers are the numbers which is divisible by 1 or itself .

example:- 2,3,5,7,11,etc.

So for finding the prime number which simply use a loop from 2 to n-1 and check that number is divisible by i or not if number is divisible by i then it is not a prime number otherwise prime number.

**here **we use a loop from 2 to n//2 and if number is divisible in this interval then it is not a prime number otherwise it is prime number.

__Code:-__

# function for check the prime number

def checkprime(n):

for i in range(2,(n//2)+1):

if n%i==0:

return 1

return 0

# driver code

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

print("All the prime numbers up to ",num," are: ")

for i in range(2,num+1):

f=checkprime(i)

if f==0:

print(i,end=" ")

__Output:-__

Enter the a number 34

All the prime numbers up to 34 are:

2 3 5 7 11 13 17 19 23 29 31

__Recommended Post:-__

__Hackerearth Problems:-__- Very Cool numbers | Hacker earth solution
- Vowel Recognition | Hackerearth practice problem solution
- Birthday party | Hacker earth solution
- Most frequent | hacker earth problem solution
- program to find symetric difference of two sets
- cost of balloons | Hacker earth problem solution
- Chacha o chacha | hacker earth problem solution
- jadu and dna | hacker earth solution
- Bricks game | hacker earth problem
- Anti-Palindrome strings | hacker earth solution
- connected components in the graph | hacker earth data structure
- odd one out || hacker earth problem solution
- Minimum addition | Hackerearth Practice problem
- The magical mountain | Hackerearth Practice problem
- The first overtake | Hackerearth Practice problem

__Hackerrank Problems:-__Data structure:-- Playing With Characters | Hackerrank practice problem solution
- Sum and Difference of Two Numbers | hackerrank practice problem solution
- Functions in C | hackerrank practice problem solution
- Pointers in C | hackerrank practice problem solution
- Conditional Statements in C | Hackerrank practice problem solution
- For Loop in C | hackerrank practice problem solution

- Program to find cycle in the graph
- Implementation of singly link list
- Implementation of queue by using link list
- Algorithm of quick sort
- stack by using link list
- program to find preorder post order and inorder of the binary search tree
- Minimum weight of spanning tree
- Preorder, inorder and post order traversal of the tree

__Key points:-__

__ MCQs:-__

## 0 Comments