A man walks a certain distance and rides back in 3.75 hours, he could ride both ways in 2.5 hours. How many hours would it take him to walk both ways?
Let the man walk distance x km in time t hours. His walking speed is kmph.
Let him ride distance x km in time T hours. His riding speed is kmph.
Using above in first equation:
Hence, = his speed of walking. Hence, it would take him 5 hours to walk both ways.
Positive integers a and b are such that . What is the value of ?
Given that a and b are positive integers.
Given also .
As a and b are both positive integers, so and both are non-negative.
So, both the terms are non-negative and hence, sum is zero if both are zero or and .
The equations and where k is a real number, have exactly one common root. What is the value of k?
Let and let is a common root.
Hence, satisfies both the equations. So, by plugging in the value of we get the following:
and and so using these two equations, we get the following:
Case 1: then . But hold on, we havent’t checked thoroughly if this is the real answer. We got to check now if both equations with these values of alpha and k have only one common root.
Equation I now goes as : so this equation has irrational roots. On further examination, we see that if , then k can be any value. So, what are the conditions on k? We get that from equation I: plug in the value of alpha:
so and .
So, we now recheck if both equations have only one common root when alpha is 1 and k is 3:
so the roots of first equation are 3 and 1.
so the roots of second equation are -4 and 1.
Clearly so is the final answer. 🙂
What is the smallest positive integer k such that for some positive integers a and n with ?
We have so that giving k=1.
What is the value of
which in turn is equal to
Question 3: Homework:
It is given that the equation has integer roots. What is the sum of all possible values of a?
Let be real numbers different from 1, such that
Then, what is the value of
which is required answer.
Note that the maximum index 2014 plays no significant role here.
Let f be a one-to-one function from the set of natural numbers to itself such that
for all natural numbers m and n.
What is the least possible value of ?
From elementary number theory, we know that given f is a multiplicative function and hence, the required function is such that if p and q are prime, then
That is we need to decompose 999 into its unique prime factorization.
So, we have where both 3 and 97 are prime.
We have and we want this to be least positive integer. Clearly, then f(3) cannot be greater than 97. Also, moreover, we need both f(3) and f(97) to be as least natural number as possible. So, and so that required answer is 24.
What is the number of ordered pairs (A,B) where A and B are subsets of such that neither nor ?
- If x and y are two natural numbers, HCF(x,y) x LCM (x,y) = xy
- If a, b, c are three natural numbers, then the product abc=HCF(a,b,c) x LCM(ab,bc,ca) and also abc=HCF(ab, bc,ca) x LCM(a,b,c).