ravidaram · September 7, 2013 14:38
diff --git a/fact b/fact
 puts "enter number"
 num=gets.chomp.to_i
 puts num1=1

 while(1<=num)
 num1=num*num1
 num=num-1
 end
 puts"the factorial number=" + num1.to_s + "."
diff --git a/gcd b/gcd
 puts "enter two numbers"
 n1=gets.chomp.to_i
 n2=gets.chomp.to_i

 n=1
 if(n1<n2)
  while(n<=n2)
     if(n1%n==0&&n2%n==0)
      m=n
      end
   n=n+1
   end
 else
   while(n<=n1)
     if(n1%n==0&&n2%n==0)
      m=n
     end
    n=n+1
    end
 end
 puts "Greatest Common Devisor for #{n1} and #{n2} is #{m}."   



diff --git a/leap b/leap
 puts"enter year"
 n1=gets.chomp.to_i
 puts"enter year"
 n2=gets.chomp.to_i
 while(n1<=n2)
 n3=n1%4
 if(n3==0)
 puts"the leap year is #{n1}."
 end
 n1=n1+1
 end
diff --git a/prime b/prime
 puts"enter one number"
 num=gets.chomp.to_i
 n1=num%1
 n2=num%2
 if(n1!=n2)
 puts"the number is prime= #{num}."
 else
 puts"this is not prime number"
 end
	puts "enter number"
	num=gets.chomp.to_i
	puts num1=1

	while(1<=num)
	num1=num*num1
	num=num-1
	end
	puts"the factorial number=" + num1.to_s + "."
	puts "enter two numbers"
	n1=gets.chomp.to_i
	n2=gets.chomp.to_i

	n=1
	if(n1<n2)
	while(n<=n2)
	if(n1%n==0&&n2%n==0)
	m=n
	end
	n=n+1
	end
	else
	while(n<=n1)
	if(n1%n==0&&n2%n==0)
	m=n
	end
	n=n+1
	end
	end
	puts "Greatest Common Devisor for #{n1} and #{n2} is #{m}."