answersLogoWhite

0

<html>

<script language="vbscript">

n=cint(inputbox("Enter a number"))

dim f

f=1

if n<0 then

Msgbox "Invalid number"

elseif n=0 or n=1 then

MsgBox "The factorial of given number "&n&" is :"&f

else

for i=n to 2 step -1

f=f*i

next

MsgBox "The factorial of given number "&n&" is :"&f

end if

</script>

</html>

User Avatar

Wiki User

14y ago

What else can I help you with?

Related Questions

How do you find out how many digits are in integer using vbscript?

num=32767 MsgBox(len(num))


By using call by reference find the factorial of a number?

chutia mc,bc bhosdika


Home page containing pull down menu box for the links using vbscript?

Home page containing pull down menu box for the links using VBScript.


How can you find factorial of each element in array using pointer?

To find the factorial of each element in an array using pointers in C, you can create a function that takes a pointer to the array and its size as parameters. In the function, iterate through the array using pointer arithmetic, calculating the factorial for each element and storing the result back in the same array or a separate array. For calculating the factorial, you can use a simple loop or recursion. Finally, print or return the modified array with the factorials.


Write a java program to find the factorial of a given number?

Here's a simple Java program to find the factorial of a given number using a recursive method: import java.util.Scanner; public class Factorial { public static void main(String[] args) { Scanner scanner = new Scanner(System.in); System.out.print(&quot;Enter a number: &quot;); int number = scanner.nextInt(); System.out.println(&quot;Factorial of &quot; + number + &quot; is &quot; + factorial(number)); } static int factorial(int n) { return (n == 0) ? 1 : n * factorial(n - 1); } } This program prompts the user for a number and calculates its factorial recursively.


Write the Pseudocode to find the factorial of a number?

Pseudo code+factorial


Algorithm to find factorial using functions?

factorial using recursion style in c++ is unsigned int fact(unsigned int a) { if (a&lt;=1) return 1; else { f*=fact(a-1); return a; } } when using looping structure factorial is unsigned int fact (unsigned int n) { unsigned int i,f=1; for(i=1;i&lt;=n;i++) f*=i ; return f; }


When was VBScript created?

VBScript was created in 1996.


Program to find n th fabonacci number?

#include #include using std::cin;using std::cout;using std::endl;using std::tolower;long factorial(const int& N);int main(){int N = 0; //factorial of Nchar command = 'n';do{cout > N;cout


How you can find a factorial of a number without using multiple operator?

If you really wanted to do this, you could simulate multiplication with repeated addition.


Factorial of a number in shell?

To calculate the factorial of a number in a shell script, you can use a simple loop. Here's a basic example: #!/bin/bash factorial=1 read -p &quot;Enter a number: &quot; num for (( i=1; i&lt;=num; i++ )) do factorial=$((factorial * i)) done echo &quot;Factorial of $num is $factorial&quot; This script prompts the user for a number, computes its factorial using a for loop, and then prints the result.


A program for simple factorial in prolog?

In Prolog, a simple factorial program can be defined using recursion. Here's a basic implementation: factorial(0, 1). % Base case: factorial of 0 is 1 factorial(N, Result) :- N &gt; 0, N1 is N - 1, factorial(N1, Result1), Result is N * Result1. % Recursive case You can query the factorial of a number by calling factorial(N, Result). where N is the number you want to compute the factorial for.


Flowchart to find factorial of a given no?

Kat


output of a c program using function to find factorial of a number?

In a C program that calculates the factorial of a number using a function, the program typically prompts the user for an integer input. The function then recursively or iteratively computes the factorial by multiplying the number by the factorial of the number minus one until it reaches one. For example, if the user inputs 5, the program outputs 120, as 5! = 5 × 4 × 3 × 2 × 1. The final result is displayed on the screen.


Jntu 2-2 oops through java answers?

write a java program to find factorial using recursive and non recursive


What is vbscript?

! VBScript is a Microsoft created program. It stands for Visual Basic Scripting


How do you make a programm to find the fectorial by using fuction?

To create a program that calculates the factorial of a number using a function, you can define a recursive function or use an iterative approach. For example, in Python, you can define a function factorial(n) that returns 1 if n is 0 or 1, and calls itself with n-1 otherwise. Alternatively, you can use a loop to multiply the numbers from 1 to n. Here's a simple example using recursion: def factorial(n): if n == 0 or n == 1: return 1 else: return n * factorial(n - 1)


In VBScript the first element of the array dim data(10) is accessed using?

In VBScript, the first element of an array declared as Dim data(10) can be accessed using data(0). This is because VBScript arrays are zero-based, meaning that the index starts at 0 and goes up to 10, allowing for a total of 11 elements. Therefore, to access the first element, you would use data(0).


Using while loop Write a program find the factors of a number?

by this program you can find the factorial: #include&lt;iostream&gt; using namespace std; main() { int n,x,f=1; cin&gt;&gt; n; x=0; while(x&lt;n) { x++; f= f*x; } cout&lt;&lt;"factorial is"&lt;&lt;f&lt;&lt;"\n"; system("pause"); return 0; }


Program to find factorial of a number using inheritance?

/*71.PROGRAM TO FIND FACTORIAL OF A NUMBER USING RECURSION*/ #include&lt;stdio.h&gt; #include&lt;conio.h&gt; int fact(int); void main() { int n,f; clrscr(); printf("Enter number whose factorial is to be calculated: "); scanf("%d",&amp;n); if(n&gt;0) { f=fact(n); printf("factorial of %d is %d",n,f); } else printf("Factorial of numbers less than 1 does not exist"); getch(); } int fact(int n) { int facto=1; if(n&gt;1) facto=n*fact(n-1); else return 1; return(facto); }