Python Program For Beginner

 GREETINGS TO ALL OF YOU!!!!!! WE WILL BE DOING  OUR FIRST PATTERN PRINTING PROGRAM SO LET'S START WITH IT !! WE PRINT OUR PATTER IN THIS WAY * * * * * * * * * * * *  * * * * * * * * * * * *  n= int ( input ( "enter the number:..." )) for i in range ( 1 ,n+ 1 ): for j in range ( 1 ,n+ 1 ): print ( "*" , end = " " ) print ( " " ) ACCORDING TO YOUR INPUT THE NUMBER OF ROWS AND COLUMN

  GREETINGS TO ALL OF YOU!!!!!!! We will be looking to the most tricky problem that is Fibbuonacci series  n= int ( input ( "enter the number till you need Fibbuonacci series: " )) first_number,second_number= 0 , 1 print (first_number,second_number, end = " " ) for i in range ( 1 ,n- 1 ): print (first_number+second_number, end = " " ) first_number,second_number=second_number,(first_number + second_number) thank you!!!

GREETINGS TO ALL OF YOU!!!!!!! WE WILL MAKE A PROGRAM TO IDENTIFY THAT THE GIVEN INPUT IS A PERFECT SQUARE OR NOT A PERFECT SQUARE...  WE WILL BE USING MATH MODULE  WE HAVE TO IMPORT MATH MODULE  SO LETS START WITH IT!!!!!!! import math print ( "welcome to square root finding tool" ) i= int ( input ( "enter your number " )) a=math.sqrt(i) # it will find the square of i that is the number given by the user #when we find square root in python it gives the result in decimal(.) if (a-math.floor(a)== 0 ): print ( "it is a perfect square:" ,i) else : print ( "it is not a perfect square: " ,i) THANK YOU !!!!!!!

          GREETINGS TO ALL OF YOU!!!!!!!!!!!!! # WELCOME EVERY ONE WE ARE HERE TO HAVE A PROGRAM ON PRIME NUMBER   # WE WILL HAVE TWO PROGRAM  # 1. TO IDENTIFY THAT THE GIVEN NUMBER IS A PRIME NUMBER OR NOT   # 2. TO PRINT ALL THE PRIME NUMBER FROM 1 TO N # 1) Pyhton program for indentifying which is a PRIME NUMBER   n= int ( input ( "pls enter your number:..... \n " )) flage = 0 for i in range ( 2 ,n): if n % i == 0 : flage = 1 if flage == 0 : print ( "it is a prime number" ) else : print ( "it is not a prime number" ) #2) Python program for printing all prime number from 1 to N n= int ( input ( "Enter the starting number:....." )) q= int ( input ( "enter the ending number:..." )) for i in range (n,q+ 1 ): flage = 0 for j in range ( 2 ,i): if i % j== 0 : flage= 1 if flage== 0 : print ( "it is a prime number: " ,i) thanks guys for joining me

GREETINGS TO ALL OF YOU!! a basic code for beginner to understand f string # f strings # f stands for fast a= "vaibhav" b= "samayra" c= f"this is { a } and she is my sister and her name is { b } !!" print (c) thank you!!!

GREETINGS TO ALL OF YOU!!  Factorial problem, Recursion and Iterative Method   #  Recursion Method  def fac2 (n): if n== 1 : return 1 else : return n*fac2(n- 1 ) number = int ( input ( "enter your number" )) print ( 'factorial of your given number by recursion method :' ,fac2(number)) # Iterative Method  def fac1 (n): fac= 1 for i in range (n): fac=fac*(i+ 1 ) return fac number= int ( input ( "enter your number: " )) print ( "factorial of your given number by iterative method:" ,fac1(number))

  GREETINGS TO ALL OF YOU!! code for printing table  i= 0 n= int ( input ( "enter your number \n " "for your table " )) while i< 10 : i+= 1 print (n, 'x' ,i, '=' ,n*i) thank you!!!