1 12 123 1234 12345 Pattern Using Shell Programme

#!/bin/sh
c=6;
m=1;
for((i=1;i<=5;i++))
do
for((k=1;k<=c;k++))
do
  echo -n  " "
done
for((j=1;j<=i;j++))
do
echo -n "$j"
echo -n " "
done
c=$(($c-1))
echo -e " "
done


exit 0

Loop Patterns Using Shell Commands

#!/bin/sh
c=5;
for((i=1;i<=5;i++))
do
for((k=1;k<=c;k++))
do
  echo -n  " "
done
for((j=1;j<=i;j++))
do
echo -n "*"
echo -n " "
done
c=$(($c-1))
echo -e " "
done


exit 0

Output :

Geometric Progression Using shell

#!/bin/sh

echo -n "Enter First No. of G.P :  "
read  a
echo -n "Enter Common Ratio of G.p :"
read r
echo -n  "how many no. you want to print : "
read  n
echo " .............G.p is : ........   "

while [ $n -gt 0 ]
do
echo -n "$a "
a=$(($a*$r))
n=$(($n-1))
done

exit 0

Cheking Number is Palindrome

#!/bin/sh

echo -n "Enter any no to find Reverse :  "
read  n
p=$n
rev=0
while [ $n -gt 0 ]
do
z=$(($n%10))
n=$(($n/10))
rev=$(($(($rev*10)) + z))
done
echo " .............reverse of the no. is : ........   : $rev"

if [ $rev -eq $p ]
then
echo "............Number is Palindrome.......... "
else
 echo  "........Number  is Not Palindrome ............."

fi

exit 0

output :