Program to find prime numbers between 1 and 50

#include<stdio.h>
#include<conio.h>

void main()
{
int i, n=1, count;

clrscr();
printf("\nPrime numbers between 1 and 50\n");

while(n<=50)
{
count=0;
for (i=2; i<=n/2; i++)
{
if(n%i==0)
{
count++;
break;
}
}

if (count==0)
{
printf("\n%d",n);
}
n++;
}
getch();
}

OUTPUT

Prime numbers between 1 and 50

1
2
3
5
7
11
13
17
19
23
29
31
37
41
43
47

Comments

Program to check whether the given number is prime or not

#include<stdio.h> #include<conio.h> void main() { int n, i, count=0; clrscr(); printf("\nEnter a number: "); scanf("%d",&n); for(i=2;i<=n/2;i++) { if(n%i==0) { count++; break; } } if(count==0) { printf("%d is a prime number",n); } else { printf("%d is not a prime number",n); } getch(); } OUTPUT: Enter a number: 11 11 is a prime number Enter a number: 25 25 is not a prime number

Star Design using Python program

Star Design import turtle turObj = turtle.Turtle() turObj.getscreen().bgcolor("#555555") turObj.speed(10) def star(turtle, size): if size <=10: return else: for i in range(30): turObj.color("#FEACFF") turObj.forward(i * 15) turObj.right(144) star(turObj,100) turtle.done() Output:

Creating a Realtime Clock using Python program

Clock from turtle import * from datetime import datetime def jump(distanz, winkel=0): penup() right(winkel) forward(distanz) left(winkel) pendown() def hand(laenge, spitze): fd(laenge*1.15) rt(90) fd(spitze/2.0) lt(120) fd(spitze) lt(120) fd(spitze) lt(120) fd(spitze/2.0) def make_hand_shape(name, laenge, spitze): reset() jump(-laenge*0.15) begin_poly() hand(laenge, spitze) end_poly() hand_form = get_poly() register_shape(name, hand_form) def clockface(radius): reset() pensize(7) for i in range(60): jump(radius) if i % 5 == 0: ...

Tech Garden

Search This Blog