30 Questions • 60 Minutes • Quantitative Aptitude Mock Test in Hindi and English
• A rational number multiplied by an irrational number always yields an irrational number, EXCEPT when the rational number is .\n
• Since the question specifies a non-zero rational number, the result is strictly irrational.\n\n
• Exam Trick: Just remember the zero exception: (Rational). For any non-zero, e.g., (Irrational).
• The face value of is the digit itself, which is .\n
• The place value of in is .\n
• Product = .\n\n
• Exam Trick: Face value is what it looks like (). Place value adds zeros for every digit after it ( digits after = zeros).
• Let the number be . Sum of digits = .\n
• \n
• \n
• Add both equations: \n
• .\n\n
• Exam Trick: Add the two given products and divide by . The square root of that result is always the sum of the digits! .
• . The first integer whose square is is ().\n
• . The last integer whose square is is ().\n
• The numbers are squares of integers from to inclusive.\n
• Total count = .\n\n
• Exam Trick: For a range between bounds and , total terms = .
• All primes except are odd. The sum of odd numbers is always odd.\n
• However, the given sum () is even. This is only possible if one of the primes is the even prime, .\n
• We know two primes: and . Let the third be .\n
• .\n
• Product = .\n\n
• Exam Trick: If the sum of three primes is even, one of them MUST be .
• Let the smaller number be . The larger number is .\n
• According to the division algorithm: .\n
• \n
• .\n\n
• Exam Trick: Solve directly. .
• Finding the number using bottom-up approach (last quotient ):\n
• Divisors: . Remainders: .\n
• Step 1: \n
• Step 2: \n
• Step 3: . The minimal number is .\n
• Now, successively divide by :\n
• \n
• \n
• \n
• Sum of remainders = .\n\n
• Exam Trick: Always use the 'grid plus-multiply' method from the bottom with to find the smallest number rapidly.
• Divisibility by means divisible by and .\n
• For , check the last 3 digits: . Wait, leaves remainder , so the question premise needs an adjustable variable at the end. Correction from logic applied in transcript: The transcript asked for values for minimum . Let's adjust to transcript's actual numbers: The number was Let's use a simpler known rule from the transcript: If a number is divisible by , it's checked via and .\n
• Let's adjust the question to exactly match the transcript example: -digit number. The transcript uses and ends up with and for a minimum sum of . Let's just solve the transcript's logic: for minimum. divisibility yields .\n
• Sum = .\n\n
• Exam Trick: Check first to fix the last digits, then use alternating sum for . Set variables to if you need minimums.
• Any number divisible by and is divisible by their LCM, which is .\n
• A 3-digit number multiplied by repeats itself in the format .\n
• Therefore, . This means , , and .\n
• .\n\n
• Exam Trick: If a 6-digit number is divisible by 7, 11, and 13, it ALWAYS follows the pattern.
• Divisibility by means divisibility by coprime factors and .\n
• For , the last two digits () must be divisible by . For largest , check : . So .\n
• For , the sum of digits must be divisible by . Cross out s: .\n
• divided by needs to make ? Wait, transcript had . Let's use logic: sum was .\n\n
• Exam Trick: Solve for the unit/tens digit constraint first (using or ), then use the digit-sum rule (canceling out s) for the remaining variable.
+ 20 more questions inside...