Simplest would be to have it backwards. Generate factorials until you find it or not. That way, you are sure always to compare integers: def is_factorial(n): i = f = 1 while f < n: i += 1 f *= i return f == n solved How to check if a given number is a … Read more
you can try like: input = Integer(gets.chomp) ans = 1 for i in 1..input ans = ans*i end print(ans) solved How to calculate factorial in ruby [duplicate]
This is the Taylor’s series development of exp(-x). Recognizing this gives you a good opportunity to check your result against math.exp(-x). Simple syntax improvements You don’t need an ‘else’ after the while. Just add the code to be run after the loop at the same indentation level as before the while loop. Mathematical problems Most … Read more
Hi. I am learning Python and I get stuck with factorial calculation from a number. the codes that I write only return the result once [closed] solved Hi. I am learning Python and I get stuck with factorial calculation from a number. the codes that I write only return the result once [closed]
You never alter self.n, so it’ll always be greater or equal to 1. You created an endless loop. It’s set to 1 in __init__ so self.n >= 1 is true each time you test. You should not use a local variable and a parameter to track the current state of the factorial function. Pick one … Read more
You need to end the recursion at some point: int factorial(int b) /*Function definition*/ { if (b == 0) return 1; return b*factorial(b-1); } 2 solved why does this recursive program for factorial not work? [closed]
Write printf(“factorial of n=%d\n”,s); ^^ And this code snippet if (i==n+1) { break; } is redundant and may be removed. You could write the loop simpler. For example while ( n > 1 ) s *= n–; without a need to use one more variable i. 0 solved My c program is not giving any … Read more
(This answer is a spin-off of the discussion of modular factorials in the comments.) Computing modular factorials by taking mods at each step is definitely the way to go and can be used in conjunction with Wilsons’s Theorem to give an (impractical) way to test for primes: def modFact(k,n): #computes k! mod n p = … Read more
The pictured code (please include actual code in the future, not screenshots of code) returns fact immediately: for ( n = 1; n <= num; n++ ) { return fact * n; } since n starts at 1. What you want is to include fact in the function, and multiply it as the loop goes … Read more
I think it’s a very bad idea to calculate two very large numbers and hope that the quotient comes out as something sensible. Start by taking the natural log: ln(n!/(q!)^r) = ln(n!) – r*ln(q!) You can use gammaln() for the two function values, simplify, then take exp() to get the result you want: value = … Read more