| Message |
|
|
|
May be you were not able to get it because you could not read it well. Try again: First, the prime factorization 1050:  Each factor of 1050 can contain only these primes. So the general form of each of the  is  , where  are non-negative integers and  . Accordingly,  We must assign the  's,  's,  's and  's so that the following set of equalities hold:  ,  ,   The number of possible ordered lists for these equations are:     Since each list  correspond to a factor, the number of solutions of the given equation  is  .
|
|
|
|
|
That's not correct. First, the prime factorization 1050:
Each factor of 1050 can contain only these primes. So the general form of each of the is
, where , , , are non-negative integers and . Accordingly,
We must assign the 's, 's, 's and 's so that the following set of equalities hold:
,
,
The number of possible ordered lists for these equations are:
:
:
:
: Since each list correspond to a factor, the number of solutions of the given equation
is 
|
|
|
|
|
|
|
|
Or 
Here n is an integer.
|
|
|
|
|
|
|
To answer both these questions, we need to know whether or not the particle is an isolated one, i.e. to say whether or not some more particles are present with whom the given particle can interact. Generally, when one talks about a particle, it is assumed that it is isolated (until and unless, its given otherwise). Now an isolated particle can only move with a constant velocity as seen from an inertial frame. In fact, this fact is used to define an inertial reference frame. For the first question, using the above fact, (a) must be correct. Now, can you think of the second one?
|
|
|
|
|
|
http://www.goiit.com/posts/list/algebra-really-good-questions-a-collection-i-will-post-all-questions-931320.htm
|
|
|
|
|
|
2) Its straight forward. Assume that there is some greatest prime. Call it pn. Let p1, p2, . . ., pn-1 be the prime lesser than pn. The product p1p2p3....pn + 1 is the then obviously a prime and greater than pn, which is a contradiction. Hence, there are infinitely many prime.
|
|
|
|
|
nugorama's explanation is correct. Call the six colors 1, 2, 3, 4, 5, 6. Put the cube on the table so that face 1 is at the bottom. Consider face 2. If it is at the top then we can rotate the cube about a vertical axis so that face 3 is in front. Now the cube is fixed. There are 3! = 6 ways to complete the coloring. Now, suppose that face 2 is a neighbor of 1. Then we rotate the cube so that 2 is in front. Now the cube is fixed, and the coloring can be completed in 4! = 24 ways. Altogether, there are 6 + 24 = 30 distinct colorings of the cube by six colors.
|
|
|
|
|
@kapil: the problem says the number of zeroes, NOT ONLY THE TRAILING ZEROES. If you want to find the number of trailing zeroes in p! (where p is a prime), it is sufficient to find the exponent of 5 in p!.
|
|
|
|
|
13! = 6227020800 and 101!= 9425947759838359420851623124482936749562312794702543768327889353416977599316221476503087861591808346911623490003549599583369706302603264000000000000000000000000 In both cases, Kapil's answer didn't match.
|
|
|
|
|
I could not find any "nice" solution. However, brute force works. Since , , , are . Setting
, , , , we see that . Now we need to prove
which is quite obvious, if we expand that LHS. On expansion we get the LHS as
which is, beyond any doubt, positive. Probably, someone will turn up with a "nice" solution.
|
|
|
|
|
For the second case, we need to know the initial position from where it starts sliding. However the locus of the center will be simply x2 + y2 = 202 .
|
|
|
|
|
|
Are you sure about the problem. It is easy to check by a calculator that the LHS is positive but the RHS is negative.
|
|
|
|
|
|
|
 |
|