echo "input any number:"
read no
no=`expr $no`
i=`expr 2`
while [ $i -lt $no ]
do
if [ `expr $no % $i` -eq 0];
then
echo "$no is not a prime no.."
break 2
fi
i=`expr $i +1`
done
if [ $i -eq $no ];
then
echo "$no is a PRIME no..."
fi
Type your answer here... i think we should first enter 1 number then check it
write a program in C to check whether a given number is apalindrome or not
8086 assembly language program to check wether given number is perfect or not
You don't need a shell script to do this - just use the 'tail' command.
Check below link
45
Avogadro's number is a constant. Therefore only one number is equal to Avogadro's number.
#!/bin/sh wc -lw "$1"
You don't need a shell script to do this; use the 'grep' command with the '-c' option to count the number of occurrences of some pattern.
just have a clear sequence of who are the guest speakers.. and breiefly introduce them after yoy have given info about the ceremomy.
No
To determine whether a given number is odd or even: function odd_even($i) { return ($i % 2 == 0 ? 'even' : 'odd'); }