finding square root of factorial

Question

5.00/5 (1 vote)

See more:

suppose i have found out the factorial of 2000. then if i have to find out the square root of the large factorial..then what to do?? can some one plzz frwd the algo for it..i think it might be newton raphson method.

Posted 21-Oct-12 1:06am

decodererror2345

Add a Solution

Comments

nv3 22-Oct-12 16:08pm

For one, people in this forum mostly find it annoying if a question is asked in mobile phone speak. If you want people to invest some time in helping you, you should have the courtesy to write in full sentences.

And second, your question looks like you got some homework which you try to avoid by having others do it for you. Not only would that counteract the idea of your homework in the first place, it would keep you from making progress. Most people here don't want that to happen.

If your question is not homework, then show us which steps you have tried on your own and where you got stuck. You haven't tried anything yet? Why do you think other people would invest their time then?

So: Try do come up with a couple of ideas yourself and when you got stuck, let us know exactly where and why. That way your success rate in this forum (and probably in general) will be significantly higher. And, believe me, it can be fun, too!

And: Yes, I do know the answer to this problem.

4 solutions

Add a Solution

This content, along with any associated source code and files, is licensed under The Code Project Open License (CPOL)

Richard MacCutchan · Answer 1 · 2012-10-21T01:08:00

Solution 1

If you know the method name then why not try this[^] to start with?

Posted 21-Oct-12 1:08am

Richard MacCutchan

Comments

decodererror2345 22-Oct-12 13:19pm

if u know the answer then plzz let me know as i am nt getting way to implement it..as in this method i have to take xpower(n) in which x is the factorial of 2000

Richard MacCutchan 22-Oct-12 14:00pm

Follow the link I gave you and start reading how Newton Raphson works.

Matt T Heffron · Answer 2 · 2012-10-22T07:46:00

If you know that you will be taking the square root of the result of the factorial function, just implement a function that directly computes the square root of factorial:

since factorial(n) is the product of the integers from 2 to n
square root of factorial(n) is the product of the square root of each of those integers from 2 to n

or, more efficient:

return Math.Pow(factorial(n), 0.5) (assuming factorial(n) is type double)

if your factorial(n) is returning BigInteger, then use Math.Exp(Math.BigInteger(factorial(n))/2.0)

Edit: I forgot that you indicated that the language you're using is C:
The concepts are the same but the function names are different.

*Abhishek Pant* · Answer 3 · 2012-10-22T10:44:00

C#

#include <stdio.h>
#include <math.h>

int main()
{
  long double c, n, fact = 1;
  printf("Enter a number to calculate it's factorial\n");
  scanf("%d", &n);
  for (c = 1; c <= n; c++)
  fact = fact * c;
  long double result=csqrtl(fact);
  printf("Squareroot of %d = %d\n", n, result);

  return 0;
}

----------------------------------------------------------------------------------------------------

for more details on square root refer to..
http://www.codecogs.com/reference/computing/c/math.h/sqrt.php[^]

I think this solves your problem.

for data type see my solution below

*Abhishek Pant* · Answer 4 · 2012-10-22T11:42:00

Solution 4

Perhaps the BigInteger structure can help you:(As C++ and C are almost same so try this: for data type to store.)

http://msdn.microsoft.com/en-us/library/system.numerics.biginteger.aspx

Posted 22-Oct-12 11:42am

Abhishek Pant

finding square root of factorial

4 solutions

Solution 1

Solution 2

Solution 3

Solution 4

Add your solution here

Preview 0

finding square root of factorial

4 solutions

Solution 1

Solution 2

Solution 3

Solution 4

Add your solution here

Preview 0

Existing Members

...or Join us