Closed. This question does not meet Stack Overflow guidelines. It is not currently accepting answers.
This question does not appear to be about programming within the scope defined in the help center.
Closed 5 years ago.
Improve this question
How to check the "Number of factors" of "n" is odd or even?
Only the perfect square numbers (i.e. 4,16,25....) have odd number of factors.
Others have even.
Related
Closed. This question does not meet Stack Overflow guidelines. It is not currently accepting answers.
This question does not appear to be about programming within the scope defined in the help center.
Closed 5 years ago.
Improve this question
Example:
Why sum(x)/sum(y) is not equivalent (equal) to sum(x/y)/n???
Suppose we have two values of x (3 and 6) and 2 values of y (5 and 11). Now sum(x)=9 and sum(y)=16, dividing them, we get 0.5625. Then we find sum(x/y). That would be (3/5)+(6/11)=0.6+0.5454= 1.1454. Dividing by n (2), we get the answer 0.57. So you see, sum(x)/sum(y) and sum(x/y)/n are two essentially very different things.
They might produce the same answer in some cases e.g. when y values are (5 and 10) but not always.
Closed. This question does not meet Stack Overflow guidelines. It is not currently accepting answers.
This question does not appear to be about programming within the scope defined in the help center.
Closed 7 years ago.
Improve this question
I've read this interesting problem:
how many different passwords made up of a upper case letters, b lower case letters, c digits and d characters from this set {'$','%','!','&','#'} exist?
This could be used to suggest strong passwords.
This is a basic combinatorics problem.
First of all, you have two base 26 numbers of lengths a and b, a base 10 number of length c and a base 5 number of length d. You have to multiply the number of these numbers to the number of ways you can arrange them, so you get:
Closed. This question does not meet Stack Overflow guidelines. It is not currently accepting answers.
This question does not appear to be about programming within the scope defined in the help center.
Closed 9 years ago.
Improve this question
k:=0; b:=1;
{b=a^k}
while k <> n do begin
k:=k+1;
b:=b*a;
end;
Couldn't get help on it elsewhere .. hope to get it answered here.
It's something I first saw in VB.net. It means "Not equal to".
The other formats you might see this notation as are:
!=
/=
=/=
^= (although in Java this is a bitwise XOR operation, in some notations ^ denotes not.)
while k "is less than or greater than, hence not equal to" n
Closed. This question is off-topic. It is not currently accepting answers.
Want to improve this question? Update the question so it's on-topic for Stack Overflow.
Closed 10 years ago.
Improve this question
This question is a practice problem on interviewstreet.com.
Find number of integral solution of 1/x+1/y=1/N! for a given N
For N=1 answer is 1.
I tried to solve this questions , but cant predict from where to start. I am not from math background.
I am looking for the approach , how should I proceed towards the solution.
Is there any direct formula for this?
Try to solve it as a iterative problem. All the solutions of N-1 are also valid for N. The only uncovered solutions are where x and y are both not divisible by N, which should be easier to count.
Closed. This question is off-topic. It is not currently accepting answers.
Want to improve this question? Update the question so it's on-topic for Stack Overflow.
Closed 10 years ago.
Improve this question
does gcd(gcd(a,b),gcd(c,d)) equal gcd(a,b,c,d)?or how can i calculate gcd of 4 number?
yes that is correct. If you are finding the gcd of (a,b,c,d) then any split should work. So gcd(a,b,c,d) = gcd(gcd (a,b) , gcd(c,d))
Yes. GCD(a,b,c,d) = GCD(a, GCD(b, GCD(c, d))) (or any other order, its associative and commutative.) Oh, and just in case you didn't know, you can use the Euclidean algorithm to compute GCD very quickly.