Sample Questions

This is not a professionally built mathematical test but a simple effort to

exemplify it. These sample questions will help you to know general style of
math aptitude tests. Foe Example...

The L.C.M. (Lowest (or Least) Common Multiple) of two numbers is 45 times to
their H.C.F (Highest Common Factor). If one of the numbers is 125 and sum of
L.C.M. and H.C.F. is

1150, the other number is:

a) 215

b) 220

c) 225

d) 235

Solution: Let L.C.M. be l and H.C.F. be h. Then l = 45h

l + h =1150

This gives h =25 and l = 1125

Thus the second number = (25 * 1125)/125 = 225

Question 2

Six bells commence tolling together and toll at intervals 2,4,6,8,10 and 12
seconds respectively. In 30 minutes how many times they toll together.

a) 4

b) 10

c) 15

d) 16

Solution: L.C.M. of 2,4,6,8,10,12 = 120

So they toll together after every 120 seconds i.e. 2 minutes. So in 30 minutes
they toll together 30/2 + 1 = 16 times
Question 3
The value of (0.625 * 0.0729 * 28.9)/(0.0017 * 0.025 * 8.1) is

a) 0.3825

b) 3.825

c) 38.25

d) 382.5

Solution: The sum of decimal places in numerator and denominator being the
same, decimal point can be removed

(625*729*289) / (17*25*81) = 3825

Algebra Aptitude Test Question 4

Trigonometry is the science of measuring triangles. To do well in any math
aptitude test you must have good knowledge of trigonometric ratios and basic
identities should be on tips. You may face a lot of questions about heights and
distances like:

Find x if sin(x+36^) = cos x

Solution:

sin(x+36^) = cos x

cos(90^ - (x+36^)) = cos x

90^ - (x+36^) = x

2x = 54^

x= 27^

Math Aptitude Test Question 5

Linear equations are part of all math aptitude tests. They can be age related
problems, upstream, downstream problems etc

I am three times as old as my son. Five years later I shall be two and a half
times as old as my son. What is my age?

Solution:
Let my age be x years and age of my son be y years.

(i) x = 3y

Five years later

(ii) x+5 = 5/2(y+5)

From (i) and (ii)

y=15 and x=45

Math Aptitude Test Question 6

In almost all the tests questions from Volume and surface area can be expected
like:

The number of coins 1.5 cm in diameter and 0.2cm thick to be melted to form a
right circular cylinder of height 10 cm and diameter 4.5 cm is:

a) 380

b) 450

c) 472

d) 540

Solution: Volume of 1 coin = 22/7 *(1.5)/2*(1.5)/2 * 0.2 = 99/280 cm3

Volume of large cylinder = 22/7 *(4.5)/2*(4.5)/2 * 10 = (99*45)/28cm3

Number of coins = (99*45)/28 * 280/99 = 450

Math Aptitude Test Question 7

The size of a wooden block is 5 * 10 * 20 cm3. How many whole such blocks
you will take to construct a solid wooden cube of minimum size?

a) 6

b) 8

c) 12

d) 16

Solution: Size of each cube = 5 cm

So number of blocks = (5 * 10 * 20)/(5*5*5) = 8

Numerical Aptitude Test Question 8

Find the odd man out - 1050, 510, 242, 106, 46, 16, 3

a) 510

b) 242

c) 106

d) 46

Solution:

2nd term = (Ist term - 30) / 2 = (1050-30)/2 = 510

3rd term = (2nd term - 26) / 2 = (510-26)/2 = 242

4th term = (3rd term - 22) / 2 = (242-22)/2 = 110

So 106 is the answer.

Least Common Multiple (LCM)

Least Common Multiple (LCM) of two or more numbers is the smallest
number that is a multiple of all the numbers.

Example: LCM of 3 and 4 = 12 because 12 is the smallest number which is a

multiple of both 3 and 4 (In other words, 12 is the smallest number which is
divisible by both 3 and 4).

We can find LCM using prime factorization method or division method.

How to find out LCM using prime factorization method

Step 1 : Express each number as a product of prime factors.

Step 2 : LCM = The product of highest powers of all prime factors.

Example 1: Find out LCM of 8 and 14

Step 1 : Express each number as a product of prime factors. (Reference: Prime
Factorization)

8 = 23

14 = 2 × 7
Step 2 : LCM = The product of highest powers of all prime factors.

Here the prime factors are 2 and 7

The highest power of 2 here = 23

The highest power of 7 here = 7

Hence LCM = 23 × 7 = 56 Example 2: Find out LCM of 18, 24, 9, 36 and

90

Step 1 : Express each number as a product of prime factors.

18 = 2 × 32

24 = 23 × 3

9 = 32

36 = 23 × 32

90 = 2 × 5 × 32

Step 2 : LCM = The product of highest powers of all prime factors.

Here the prime factors are 2, 3 and 5

The highest power of 2 here = 23

The highest power of 3 here = 32

The highest power of 5 here = 5

Hence LCM = 23 × 32 × 5 = 360

How to find out LCM using division Method (shortcut method)

Step 1: Write the given numbers in a horizontal line separated by commas.

Step 2: Divide the given numbers by the smallest prime number which can
exactly divide at least two of the given numbers.

Step 3: Write the quotients and undivided numbers in a line below the first.
Step 4: Repeat the process until we reach a stage where no prime factor is
common to any two numbers in the row.

Step 5: LCM = The product of all the divisors and the numbers in the last line.

Example 1: Find out LCM of 8 and 14

2 8,14

4,7
Hence Least common multiple (L.C.M) of 8 and 14
=2×4×7
= 56 Example 2: Find out LCM of 18, 24, 9, 36 and 90

2 18,24,9,36,90

2 9,12,9,18,45

3 9,6,9,9,45

3 3,2,3,3,15

1,2,1,1,5
Hence Least common multiple (L.C.M) of 18, 24, 9, 36 and 90
=2×2×3×3×2×5
= 360

Highest Common Factor(HCF)

Highest Common Factor(HCF) of two or more numbers is the greatest
number which divides each of them exactly.

Greatest Common Measure(GCM) and Greatest Common Divisor(GCD) are

the other terms used to refer HCF.

Example : HCF of 60 and 75 = 15 because 15 is the highest number which

divides both 60 and 75 exactly.

We can find out HCF using prime factorization method or by dividing the
numbers or division method.

How to find out HCF using prime factorization method

Step 1: Express each number as a product of prime factors. (Reference: Prime
Factorization)

Step 2: HCF is the product of all common prime factors using the least power
of each common prime factor.
Example 1: Find out HCF of 60 and 75

Step 1 : Express each number as a product of prime factors.

60 = 22 × 3 × 5

75 = 3 × 52

Step 2: HCF is the product of all common prime factors using the least power
of each common prime factor.

Here, common prime factors are 3 and 5

The least power of 3 here = 3

The least power of 5 here = 5

Hence, HCF = 3 × 5 = 15

Example 2: Find out HCF of 36, 24 and 12

Step 1: Express each number as a product of prime factors.

36 = 22 × 32

24 = 23 × 3

12 = 22 × 3

Step 2: HCF is the product of all common prime factors using the least power
of each common prime factor.

Here 2 and 3 are common prime factors.

The least power of 2 here = 22

The least power of 3 here = 3

Hence, HCF = 22 × 3 = 12
Example 3: Find out HCF of 36, 27 and 80
step 1 : Express each number as a product of prime factors.

36 = 22 × 32

27 = 33

80 = 24 × 5

Step 2 : HCF is the product of all common prime factors using the least power
of each common prime factor.

Here you can see that there are no common prime factors.

Hence, HCF = 1

How to find out HCF - by dividing the numbers (shortcut method)

Step 1: Write the given numbers in a horizontal line separated by commas.

Step 2: Divide the given numbers by the smallest prime number (write in the
left side) which can exactly divide all the given numbers.

Step 3: Write the quotients in a line below the first.

Step 4: Repeat the process until we reach a stage where no common prime
factor exists for all the numbers.

Step 5: We can see that the factors mentioned in the left side clearly divides all
the numbers exactly and they are common prime factors. Their product is the
HCF

Example 1: Find out HCF of 60 and 75

3 60,75

5 20,25

4,5
We can see that the prime factors mentioned in the left side clearly divides all
the numbers exactly and they are common prime factors. No common prime
factor exists for the numbers came at the bottom.
Hence HCF = 3 × 5 = 15.

Example 2: Find out HCF of 36, 24 and 12

2 36,24,12

2 18,12,6

3 9,6,3

3,21
HCF = 2 × 2 × 3 = 12.

Example 3: Find out HCF of 36, 24 and 48

2 36,24,48

2 18,12,24

3 9,6,12

3,24
HCF = 2 × 2 × 3 = 12.

How to find out HCF using division method(shortcut method)

To find out HCF of two given numbers using division method,
Step 1: Divide the larger number by the smaller number.
Step 2: Divisor of step 1 is divided by its remainder.
Step 3: Divisor of step 2 is divided by its remainder. Continue this process till
we get zero as remainder.
Step 4: Divisor of the last step is the HCF.

To find out HCF of three given numbers using division method,

Step 1: Find out HCF of any two numbers.
Step 2: Find out the HCF of the third number and the HCF obtained in step 1.
Step 3: HCF obtained in step 2 will be the HCF of the three numbers.

In a similar way as explained for three numbers, we can find out HCF of more
than three numbers also using division method.

Example 1: Find out HCF of 60 and 75

Hence HCF of 60 and 75 = 15

Example 2: Find out HCF of 12 and 48

Hence HCF of 12 and 48 = 12

Example 3: Find out HCF of 3556 and 3224

Hence HCF of 3556 and 3224 = 4

Example 4: Find out HCF of 9, 27, and 48

Take any two numbers and find out their HCF first. Say, let's find out HCF of 9
and 27 initially.

Hence HCF of 9 and 27 = 9

HCF of 9 ,27, 48
= HCF of [(HCF of 9, 27) and 48]
= HCF of [9 and 48]

Hence, HCF of 9 ,27, 48 = 3

Example 5: Find out HCF of 5 and 7

Hence HCF of 5 and 7 = 1

Problems on HCF and LCM - Solved Examples

1. Two numbers are in the ratio 2 : 3. If their L.C.M. is 48. what is sum of the
numbers?

A. 28 B. 40

C. 64 D. 42

Hide Answer

answer with explanation

Answer: Option B

Explanation:

Let the numbers be 2x2x and 3x3x

LCM of 2xand 3=6x(∵ LCM of 2 and 3 is 6. Hence LCM of 2x2x and 3xis 6x)

Given that LCM of 2x2x and 3x3x is 48

=> 6x=486x=48
=> x=486=8x=486=8

Sum of the numbers

=2x+3x=5x=2x+3x=5x
= 5 × 8 = 40
2. What is the greatest number of four digits which is divisible by 15, 25, 40
and 75 ?

A. 9800 B. 9600

C. 9400 D. 9200

Hide Answer

answer with explanation

Answer: Option B

Explanation:

Greatest number of four digits = 9999

LCM of 15, 25, 40 and 75 = 600

9999 ÷ 600 = 16, remainder = 399

Hence, greatest number of four digits which is divisible by 15, 25, 40 and 75
= 9999 - 399 = 9600

3. Three numbers are in the ratio of 2 : 3 : 4 and their L.C.M. is 240. Their
H.C.F. is:

A. 40 B. 30

C. 20 D. 10

Hide Answer
answer with explanation

Answer: Option C

Explanation:

Let the numbers be 2x2x , 3x3x and 4x4x

LCM of 2x2x, 3x3x and 4x4x = 12x12x

12x=240 ⇒x=24012=2012x=240 ⇒x=24012=20

H.C.F of 2x2x, 3x3x and 4x4x =x=20=x=20

4. What is the lowest common multiple of 12, 36 and 20?

A. 160 B. 220

C. 120 D. 180

Show Answer

| | Discuss

Notebook

5. What is the least number which when divided by 5, 6, 7 and 8 leaves a

remainder 3, but when divided by 9 leaves no remainder?

A. 1108 B. 1683
C. 2007 D. 3363

View Answer

| | Discuss

Notebook

6. The H.C.F. of two numbers is 5 and their L.C.M. is 150. If one of the
numbers is 25, then the other is:

A. 30 B. 28

C. 24 D. 20

Hide Answer

| | Discuss

Notebook

answer with explanation

Answer: Option A

Explanation:

Product of two numbers = Product of their HCF and LCM.

Let one number =x=x

=> 25×x=5×15025×x=5×150
=> x=5×15025=30x=5×15025=30

7. 504 can be expressed as a product of primes as

A. 2 × 2 × 3 × 3 × 7 × 7 B. 2 × 3 × 3 × 3 × 7 × 7

C. 2 × 3 × 3 × 3 × 3 × 7 D. 2 × 2 × 2 × 3 × 3 × 7

Hide Answer

| | Discuss

Notebook

answer with explanation

Answer: Option D

Explanation:

It is clear that 504 = 2 × 2 × 2 × 3 × 3 × 7

8. Which of the following integers has the most number of divisors?

A. 101 B. 99

C. 182 D. 176

Hide Answer
| Discuss
|
Notebook

answer with explanation

Answer: Option D

Explanation:

99 = 1 × 3 × 3 × 11
=> Divisors of 99 are 1, 3, 11, 9, 33 and 99

101 = 1 × 101
=> Divisors of 101 are 1 and 101

182 = 1 × 2 × 7 × 13
=> Divisors of 182 are 1, 2, 7, 13, 14, 26, 91 and 182

176 = 1 × 2 × 2 × 2 × 2 × 11
=> Divisors of 176 are 1, 2, 11, 4, 22, 8, 44, 16, 88, 176

Hence 176 has most number of divisors.

9. The least number which should be added to 28523 so that the sum is exactly
divisible by 3, 5, 7 and 8 is

A. 41 B. 42

C. 32 D. 37

Hide Answer | Discuss

|

Notebook

answer with explanation

Answer: Option D

Explanation:

LCM of 3, 5, 7 and 8 = 840

28523 ÷ 840 = 33 remainder = 803

Hence the least number which should be added = 840 - 803 = 37

10. What is the least number which when doubled will be exactly divisible by
12, 14, 18 and 22 ?

A. 1286 B. 1436

C. 1216 D. 1386

Hide Answer

| | Discuss

Notebook

answer with explanation

Answer: Option D

Explanation:
LCM of 12, 14, 18 and 22 = 2772

Hence the least number which will be exactly divisible by 12, 14, 18 and 22 =
2772

2772 ÷ 2 = 1386

1386 is the number which when doubled, we get 2772

Hence, 1386 is the least number which when doubled will be exactly divisible
by 12, 14, 18 and 22.

11. What is the greatest possible length which can be used to measure exactly
the lengths 8 m, 4 m 20 cm and 12 m 20 cm?

A. 10 cm B. 30 cm

C. 25 cm D. 20 cm

Hide Answer

| | Discuss

Notebook

answer with explanation

Answer: Option D

Explanation:
Required length
= HCF of 800 cm, 420 cm, 1220 cm
= 20 cm

12. Which of the following fraction is the largest ?

A.11121112 B.41504150

C.21402140 D.5656

Hide Answer

| | Discuss

Notebook

answer with explanation

Answer: Option A

Explanation:

Solution 1

LCM of 6, 40, 50 and 12 = 600

56=500600 2140=315600 4150=492600 1112=55060056=500600 2140

=315600 4150=492600 1112=550600

Clearly 550600=1112550600=1112 is the largest among these fractions.

Solution 2

56=.83 2140=.52 4150=.82 1112=.9256=.83 2140=.52 4150=.82 1112=.92

Clearly .92=1112.92=1112 is the largest among these.

13. The product of two 2 digit numbers is 2028 and their HCF is 13. What are
the numbers ?

A. 26, 78 B. 39, 52

C. 13, 156 D. 36, 68

Hide Answer

| | Discuss

Notebook

answer with explanation

Answer: Option B

Explanation:

Let the numbers be 13x13x and 13y 13y (∵ HCF of the numbers = 13)

13x×13y=2028⇒xy=1213x×13y=2028⇒xy=12

co-primes with product 12 are (1, 12) and (3, 4) (∵ we need to take only co-
primes with product 12. If we take two numbers with product 12, but not co-
prime, the HCF will not remain as 13) (Reference: Co-prime Numbers)
Hence the numbers with HCF 13 and product 2028
= (13 × 1, 13 × 12) and (13 × 3, 13 × 4)
= (13, 156) and (39, 52)

Given that the numbers are 2 digit numbers.

Hence numbers are 39 and 52

14. The product of two numbers is 2028 and their HCF is 13. What are the
number of such pairs?

A. 4 B. 3

C. 2 D. 1

Hide Answer

| | Discuss

Notebook

answer with explanation

Answer: Option C

Explanation:

Let the numbers be 13x13x and 13y 13y (∵ HCF of the numbers = 13)

13x×13y=2028⇒xy=1213x×13y=2028⇒xy=12

co-primes with product 12 are (1, 12) and (3, 4) (∵ we need to take only co-
primes with product 12. If we take two numbers with product 12, but not co-
prime, the HCF will not remain as 13) (Reference : Co-prime Numbers)

Hence the numbers with HCF 13 and product 2028

= (13 × 1, 13 × 12) and (13 × 3, 13 × 4)
= (13, 156) and (39, 52)

So, there are 2 pairs of numbers with HCF 13 and product 2028

15. N is the greatest number which divides 1305, 4665 and 6905 and gives the
same remainder in each case. What is the sum of the digits in N?

A. 4 B. 3

C. 6 D. 5

Hide Answer

| | Discuss

Notebook

answer with explanation

Answer: Option A

Explanation:

If the remainder is same in each case and remainder is not given, HCF of the
differences of the numbers is the required greatest number.
6905 - 1305 = 5600
6905 - 4665 = 2240
4665 - 1305 = 3360

Hence, the greatest number which divides 1305, 4665 and 6905 and gives the
same remainder, N
= HCF of 5600, 2240, 3360
= 1120

Sum of digits in N
= Sum of digits in 1120
=1+1+2+0
=4

16. A boy divided the numbers 7654, 8506 and 9997 by a certain largest
number and he gets same remainder in each case. What is the common
remainder?

A. 156 B. 199

C. 211 D. 231

Hide Answer

| | Discuss

Notebook

answer with explanation

Answer: Option B
Explanation:

If the remainder is same in each case and remainder is not given, HCF of the
differences of the numbers is the required largest number.

9997 - 7654 = 2343

9997 - 8506 = 1491
8506 - 7654 = 852

Hence, the greatest number which divides 7654, 8506 and 9997 and leaves
same remainder
= HCF of 2343, 1491, 852
= 213

Now we need to find out the common remainder.

Take any of the given numbers from 7654, 8506 and 9997, say 7654

7654 ÷ 213 = 35, remainder = 199

17. Find the greatest common divisor of 24 and 16

A. 6 B. 2

C. 4 D. 8

Hide Answer | Discuss

|

Notebook

answer with explanation

Answer: Option D

Explanation:

Hence, greatest common divisor of 24 and 16 = 8

18. A, B and C start at the same time in the same direction to run around a
circular stadium. A completes a round in 252 seconds, B in 308 seconds and C
in 198 seconds, all starting at the same point. After what time will they again
at the starting point ?

A. 36 minutes 22 seconds B. 46 minutes 22 seconds

C. 36 minutes 12 seconds D. 46 minutes 12 seconds

Hide Answer

| | Discuss

Notebook

answer with explanation

Answer: Option D

Explanation:

LCM of 252, 308 and 198 = 2772

Hence they all will be again at the starting point after 2772 seconds.
i.e., after 46 minutes 12 seconds.

19. The ratio of two numbers is 4 : 5. If the HCF of these numbers is 6, what is
their LCM?

A. 30 B. 60

C. 90 D. 120

Hide Answer

| | Discuss

Notebook

answer with explanation

Answer: Option D

Explanation:

Let the numbers be 4k and 5k

HCF of 4 and 5 = 1
Hence HCF of 4k and 5k = k
Given that HCF of 4k and 5k = 6
=> k = 6

Hence the numbers are (4 × 6) and (5 × 6)

= 24 and 30

LCM of 24 and 30 = 120

20. What is the HCF of 2.04, 0.24 and 0.8 ?

A. 1 B. 2

C. 0.02 D. 0.04

Hide Answer

| | Discuss

Notebook

answer with explanation

Answer: Option D

Explanation:

(Refer "How to calculate LCM and HCF of Decimals" here)

Step 1: Make the same number of decimal places in all the given numbers by
suffixing zero(s) in required numbers as needed.
=> 2.04, 0.24 and 0.80
Step 2: Now find the HCF of these numbers without decimal.
=> HCF of 204, 24 and 80 = 4

Step 3: Put the decimal point in the result obtained in step 2 leaving as many
digits on its right as there are in each of the numbers.
i.e., here we need to put decimal point in the result obtained in step 2 leaving
two digits on its right.
=> HCF of 2.04, 0.24 and 0.8 = 0.04

21. If HCF of two numbers is 11 and the product of these numbers is 363, what
is the the greater number?

A. 9 B. 22

C. 33 D. 11

Hide Answer

| | Discuss

Notebook

answer with explanation

Answer: Option C

Explanation:

Let the numbers be 11a and 11b

11a × 11b = 363

=> ab = 3
co-primes with product 3 are (1, 3)
(Reference : Co-prime Numbers)

Hence the numbers with HCF 11 and product 363

= (11 × 1, 11 × 3)
= (11, 33)

Hence, numbers are 11 and 33

The greater number = 33

22. What is the greatest number which on dividing 1223 and 2351 leaves
remainders 90 and 85 respectively?

A. 1133 B. 127

C. 42 D. 1100

Hide Answer

| | Discuss

Notebook

answer with explanation

Answer: Option A

Explanation:
Required number
= HCF of (1223 - 90) and (2351 - 85)
= HCF of 1133 and 2266
= 1133

23. What is the least multiple of 7 which leaves a remainder of 4 when divided
by 6, 9, 15 and 18 ?

A. 364 B. 350

C. 343 D. 371

Hide Answer

| | Discuss

Notebook

answer with explanation

Answer: Option A

Explanation:

LCM of 6, 9, 15 and 18 = 90

Required Number = (90k + 4) which is a multiple of 7

Put k = 1. We get number as (90 × 1) + 4 = 94. But this is not a multiple of 7

Put k = 2. We get number as (90 × 2) + 4 = 184. But this is not a multiple of 7

Put k = 3. We get number as (90 × 3) + 4 = 274. But this is not a multiple of 7

Put k = 4. We get number as (90 × 4) + 4 = 364. This is a multiple of 7

Hence 364 is the answer.

24. Three numbers which are co-prime to each other are such that the product
of the first two is 119 and that of the last two is 391. What is the sum of the
three numbers?

A. 47 B. 43

C. 53 D. 51

Hide Answer

| | Discuss

Notebook

answer with explanation

Answer: Option A

Explanation:

Since the numbers are co-prime, their HCF = 1

Product of first two numbers = 119

Product of last two numbers = 391

The middle number is common in both of these products. Hence, if we take

HCF of 119 and 391, we get the common middle number.

HCF of 119 and 391 = 17

=> Middle Number = 17

First Number =11917=7=11917=7

Last Number =39117=23=39117=23

Sum of the three numbers = 7 + 17 + 23 = 47

25. Reduce 4329466243294662 to its lowest terms

A.713713 B.13171317

C.13141314 D.712712

Hide Answer

| | Discuss

Notebook

answer with explanation

Answer: Option C

Explanation:
We need to find out HCF of 4329 and 4662

Hence, HCF of 4329 and 4662 = 333

4329 ÷ 333 = 13
4662 ÷ 333 = 14

Hence, 43294662=131443294662=1314

26. What is the greatest number which divides 24, 28 and 34 and leaves the
same remainder in each case?

A. 1 B. 2

C. 3 D. 4

Hide Answer

| | Discuss

Notebook

answer with explanation

Answer: Option B

Explanation:
If the remainder is same in each case and remainder is not given, HCF of the
differences of the numbers is the required greatest number.

34 - 24 = 10
34 - 28 = 6
28 - 24 = 4

Hence, the greatest number which divides 24, 28 and 34 and gives the same
remainder
= HCF of 10, 6, 4
=2

27. Six bells start ringing together and ring at intervals of 4, 8, 10, 12, 15 and
20 seconds respectively. How many times will they ring together in 60
minutes ?

A. 31 B. 15

C. 16 D. 30

Hide Answer

| | Discuss

Notebook

answer with explanation

Answer: Option A

Explanation:
LCM of 4, 8, 10, 12, 15 and 20 = 120

120 seconds = 2 minutes

Hence all the six bells will ring together in every 2 minutes

Hence, number of times they will ring together in 60 minutes

=1+602=31=1+602=31

28. What is the least number which when divided by 8, 12, 15 and 20 leaves in
each case a remainder of 5 ?

A. 125 B. 117

C. 132 D. 112

Hide Answer

| | Discuss

Notebook

answer with explanation

Answer: Option A

Explanation:

LCM of 8, 12, 15 and 20 = 120

Required Number = 120 + 5 = 125

29. The HCF of two numbers is 23 and the other two factors of their LCM are
13 and 14. What is the largest number?

A. 312 B. 282

C. 299 D. 322

Hide Answer

| | Discuss

Notebook

answer with explanation

Answer: Option D

Explanation:

The HCF of a group of numbers will be always a factor of their LCM.

HCF is the product of all common prime factors using the least power of each
common prime factor.

LCM is the product of highest powers of all prime factors.

HCF of the two numbers = 23

Since HCF will be always a factor of LCM, 23 is a factor of the LCM.

Given that other two factors in the LCM are 13 and 14.
Hence factors of the LCM are 23, 13, 14

So, numbers can be taken as (23 × 13) and (23 × 14)

= 299 and 322

Hence, largest number = 322

Note

We have seen that the numbers are (23 × 13) and (23 × 14).

If we write the numbers as the product of prime factors,

first number = (23 × 13)
second numbers = (23 × 14) = (23 × 2 × 7)

HCF is the product of all common prime factors using the least power of each
common prime factor
= 23

LCM is the product of highest powers of all prime factors

= 23 × 13 × 2 × 7 = 23 × 13 × 14

Clearly we get HCF as 23 and the factors in the LCM as 13, 14 and 23.

Hence every conditions are satisfied.

30. What is the smallest number which when diminished by 12, is divisible 8,
12, 22 and 24?

A. 276 B. 264

C. 272 D. 268

Hide Answer

| | Discuss

Notebook

answer with explanation

Answer: Option A

Explanation:

Required Number
= (LCM of 8, 12, 22 and 24) + 12
= 264 + 12 = 276

31. What is the HCF of 1313 , 2323 and 1414 ?

A.2323 B.1313

C.1414 D.112112

Hide Answer

| | Discuss

Notebook

answer with explanation

Answer: Option D

Explanation:

HCF of fractions = HCF of NumeratorsLCM of DenominatorsHCF of

NumeratorsLCM of Denominators

Read More ...

HCF of 1313 , 2323 and 1414

=HCF (1, 2, 1)LCM (3, 3, 4) =112=HCF (1, 2, 1)LCM (3, 3, 4) =112

32. What is the LCM of 2323 , 5656 and 4949 ?

A.310310 B.320320

C.103103 D.203203

Hide Answer

| | Discuss

Notebook

answer with explanation

Answer: Option D

Explanation:
LCM of fractions =LCM of NumeratorsHCF of Denominators=LCM of
NumeratorsHCF of Denominators

LCM of 2323 , 5656 and 4949

=LCM (2, 5, 4)HCF (3, 6, 9) =203

Operations

"Operations" mean things like add, subtract, multiply, divide, squaring,

etc. If it isn't a number it is probably an operation.

But, when you see something like...

7 + (6 × 52 + 3)
... what part should you calculate first?

Start at the left and go to the right?

Or go from right to left?

Warning: Calculate them in the wrong order, and you will get a wrong
answer !

So, long ago people agreed to follow rules when doing calculations, and
they are:

How Do I Remember It All ... ? BODMAS !

B Brackets first
O Orders (i.e. Powers and Square Roots, etc.)
DM Division and Multiplication (left-to-right)
AS Addition and Subtraction (left-to-right)

Divide and multiply rank equally (and go left to right).

Add and Subtract rank equally (and go left to right)
Example: How do you work out 3 + 6 × 2 ?
Multiplication before Addition:
First 6 × 2 = 12, then 3 + 12 = 15
Example: How do you work out (3 + 6) × 2 ?
Brackets first:
First (3 + 6) = 9, then 9 × 2 = 18
Example: How do you work out 12 / 6 × 3 / 2 ?
Multiplication and Division rank equally, so just go left to right:
First 12 / 6 = 2, then 2 × 3 = 6, then 6 / 2 = 3
Example: Sam threw a ball straight up at 20 meters per
second, how far did it go in 2 seconds?
Sam uses this special formula that includes gravity:

height = velocity × time − (1/2) × 9.8 × time2

Sam puts in the velocity of 20 meters per second and time of 2 seconds:

height = 20 × 2 − (1/2) × 9.8 × 22

Now for the calculations!

20 × 2 − (1/2) × 9.8 × 22

20 × 2 − 0.5 × 9.8 × 22 Start inside Brackets

20 × 2 − 0.5 × 9.8 × 4 Then Orders (22=4)

40 − 19.6 Then the Multiplies

20.4 Subtract and DONE !

The ball reaches 20.4 meters after 2 seconds

Exponents of Exponents ...

What about this example?

43 2

Exponents are special: they go top-down (do the exponent at the top
first). So we calculate this way:
Start with: 43 2

32 = 3×3: 49
49 = 4×4×4×4×4×4×4×4×4: 262144

And finally, what about the example from the beginning?

7 + (6 × 52 + 3)
7 + (6 × 25 + 3) Start inside Brackets, and then use "Orders" First
7 + (150 + 3) Then Multiply
7 + (153) Then Add
7 + 153 Brackets completed, last operation is add
160 DONE !

Mathematical Operations and Elementary

Functions
Julia provides a complete collection of basic arithmetic and bitwise operators across all
of its numeric primitive types, as well as providing portable, efficient implementations
of a comprehensive collection of standard mathematical functions.

Arithmetic Operators
The following arithmetic operators are supported on all primitive numeric types:

Expression Name Description

+x unary plus the identity operation

Expression Name Description

-x unary minus maps values to their additive inverses

x + y binary plus performs addition

x - y binary minus performs subtraction

x * y times performs multiplication

x / y divide performs division

x \ y inverse divide equivalent to y / x

x ^ y power raises x to the y th power

x % y remainder equivalent to rem(x,y)

as well as the negation on Bool types:

Expression Name Description

!x negation changes true to false and vice versa

Julia’s promotion system makes arithmetic operations on mixtures of argument types

“just work” naturally and automatically. See Conversion and Promotion for details of the
promotion system.

Here are some simple examples using arithmetic operators:

julia> 1 + 2 + 3
6
julia> 1 - 2
-1

julia> 3*2/12
0.5

(By convention, we tend to space less tightly binding operators less tightly, but there are
no syntactic constraints.)

Bitwise Operators
The following bitwise operators are supported on all primitive integer types:

Expression Name

~x bitwise not

x & y bitwise and

x | y bitwise or

x $ y bitwise xor (exclusive or)

x >>> y logical shift right

x >> y arithmetic shift right

x << y logical/arithmetic shift left

Here are some examples with bitwise operators:

julia> ~123
-124

julia> 123 & 234

106
julia> 123 | 234
251

julia> 123 $ 234

145

julia> ~UInt32(123)
0xffffff84

julia> ~UInt8(123)
0x84

Updating operators
Every binary arithmetic and bitwise operator also has an updating version that assigns
the result of the operation back into its left operand. The updating version of the binary
operator is formed by placing a = immediately after the operator. For example, writing x
+= 3 is equivalent to writing x = x + 3 :

julia> x = 1
1

julia> x += 3
4

julia> x
4

The updating versions of all the binary arithmetic and bitwise operators are:

+= -= *= /= \= ÷= %= ^= &= |= $= >>>= >>= <<=

Note

An updating operator rebinds the variable on the left-hand side. As a result, the type of
the variable may change.

julia> x = 0x01; typeof(x)

UInt8

julia> x *= 2 #Same as x = x * 2
2

julia> isa(x, Int)

true
Numeric Comparisons
Standard comparison operations are defined for all the primitive numeric types:

Operator Name

== equality

!= ≠ inequality

< less than

<= ≤ less than or equal to

> greater than

>= ≥ greater than or equal to

Here are some simple examples:

julia> 1 == 1
true

julia> 1 == 2
false

julia> 1 != 2
true

julia> 1 == 1.0
true

julia> 1 < 2
true

julia> 1.0 > 3

false
 julia> 1 >= 1.0
true

julia> -1 <= 1
true

julia> -1 <= -1
true

julia> -1 <= -2
false

julia> 3 < -0.5

false

Integers are compared in the standard manner — by comparison of bits. Floating-point

numbers are compared according to the IEEE 754 standard:

 Finite numbers are ordered in the usual manner.

 Positive zero is equal but not greater than negative zero.
 Inf is equal to itself and greater than everything else except NaN .
 -Inf is equal to itself and less then everything else except NaN .
 NaN is not equal to, not less than, and not greater than anything, including itself.

The last point is potentially surprising and thus worth noting:

julia> NaN == NaN

false

julia> NaN != NaN

true

julia> NaN < NaN

false

julia> NaN > NaN

false

and can cause especial headaches with Arrays:

julia> [1 NaN] == [1 NaN]

false

Julia provides additional functions to test numbers for special values, which can be
useful in situations like hash key comparisons:
 Function Tests if

isequal(x, y) x and y are identical

isfinite(x) x is a finite number

isinf(x) x is infinite

isnan(x) x is not a number

isequal() considers NaN s equal to each other:

julia> isequal(NaN,NaN)
true

julia> isequal([1 NaN], [1 NaN])

true

julia> isequal(NaN,NaN32)
true

isequal() can also be used to distinguish signed zeros:

julia> -0.0 == 0.0

true

julia> isequal(-0.0, 0.0)

false

Mixed-type comparisons between signed integers, unsigned integers, and floats can be
tricky. A great deal of care has been taken to ensure that Julia does them correctly.

For other types, isequal() defaults to calling ==() , so if you want to define equality for
your own types then you only need to add a ==() method. If you define your own
equality function, you should probably define a corresponding hash() method to ensure
that isequal(x,y) implies hash(x) == hash(y) .

Chaining comparisons
Unlike most languages, with the notable exception of Python, comparisons can be
arbitrarily chained:

julia> 1 < 2 <= 2 < 3 == 3 > 2 >= 1 == 1 < 3 != 5

true

Chaining comparisons is often quite convenient in numerical code. Chained

comparisons use the && operator for scalar comparisons, and the & operator for
elementwise comparisons, which allows them to work on arrays. For example, 0 .< A
.< 1 gives a boolean array whose entries are true where the corresponding elements of
A are between 0 and 1.

The operator < is intended for array objects; the operation A .< B is valid only if A and
B have the same dimensions. The operator returns an array with boolean entries and
with the same dimensions as A and B . Such operators are called elementwise; Julia
offers a suite of elementwise operators: * , + , etc. Some of the elementwise operators can
take a scalar operand such as the example 0 .< A .< 1 in the preceding paragraph. This
notation means that the scalar operand should be replicated for each entry of the array.

Note the evaluation behavior of chained comparisons:

v(x) = (println(x); x)

julia> v(1) < v(2) <= v(3)

2
1
3
true

julia> v(1) > v(2) <= v(3)

2
1
false

The middle expression is only evaluated once, rather than twice as it would be if the
expression were written as v(1) < v(2) && v(2) <= v(3) . However, the order of
evaluations in a chained comparison is undefined. It is strongly recommended not to
use expressions with side effects (such as printing) in chained comparisons. If side
effects are required, the short-circuit && operator should be used explicitly (see Short-
Circuit Evaluation).

Operator Precedence

Julia applies the following order of operations, from highest precedence to lowest:
 Category Operators

Syntax . followed by ::

Exponentiati
^ and its elementwise equivalent .^
on

Fractions // and .//

Multiplicati
* / % & \ and .* ./ .% .\
on

Bitshifts << >> >>> and .<< .>> .>>>

Addition + - | $ and .+ .-

Syntax : .. followed by |>

Comparison
> < >= <= == === != !== <: and .> .< .>= .<= .== .!=
s

Control
&& followed by || followed by ?
flow

Assignment = += -= *= /= //= \= ^= ÷= %= |= &= $= <<= >>= >>>= and .+= .-= .*= ./= .//=
s .\= .^= .÷= .%=

Elementary Functions

Julia provides a comprehensive collection of mathematical functions and operators.

These mathematical operations are defined over as broad a class of numerical values as
permit sensible definitions, including integers, floating-point numbers, rationals, and
complexes, wherever such definitions make sense.
 Numerical Conversions
Julia supports three forms of numerical conversion, which differ in their handling of
inexact conversions.

 The notation T(x) or convert(T,x) converts x to a value of type T .

o If T is a floating-point type, the result is the nearest representable value, which could be positive
or negative infinity.
o If T is an integer type, an InexactError is raised if x is not representable by T .
 x % T converts an integer x to a value of integer type T congruent to x modulo 2^n , where n is
the number of bits in T . In other words, the binary representation is truncated to fit.
 The Rounding functions take a type T as an optional argument. For example, round(Int,x) is a
shorthand for Int(round(x)) .

The following examples show the different forms.

julia> Int8(127)
127

julia> Int8(128)
ERROR: InexactError()
in call at essentials.jl:56

julia> Int8(127.0)
127

julia> Int8(3.14)
ERROR: InexactError()
in call at essentials.jl:56

julia> Int8(128.0)
ERROR: InexactError()
in call at essentials.jl:56

julia> 127 % Int8

127

julia> 128 % Int8

-128

julia> round(Int8,127.4)
127

julia> round(Int8,127.6)
ERROR: InexactError()
in trunc at float.jl:374
in round at float.jl:181
See Conversion and Promotion for how to define your own conversions and promotions.

Rounding functions

Function Description Return type

round(x) round x to the nearest integer typeof(x)

round(T, x) round x to the nearest integer T

floor(x) round x towards -Inf typeof(x)

floor(T, x) round x towards -Inf T

ceil(x) round x towards +Inf typeof(x)

ceil(T, x) round x towards +Inf T

trunc(x) round x towards zero typeof(x)

trunc(T, x) round x towards zero T

Division functions

Function Description

div(x,y) truncated division; quotient rounded towards zero

fld(x,y) floored division; quotient rounded towards -Inf

cld(x,y) ceiling division; quotient rounded towards +Inf

 Function Description

rem(x,y) remainder; satisfies x == div(x,y)*y + rem(x,y) ; sign matches x

mod(x,y) modulus; satisfies x == fld(x,y)*y + mod(x,y) ; sign matches y

mod2pi(x) modulus with respect to 2pi; 0 <= mod2pi(x) < 2pi

divrem(x,y) returns (div(x,y),rem(x,y))

fldmod(x,y) returns (fld(x,y),mod(x,y))

gcd(x,y...) greatest common divisor of x , y ,...; sign matches x

lcm(x,y...) least common multiple of x , y ,...; sign matches x

Sign and absolute value functions

Function Description

abs(x) a positive value with the magnitude of x

abs2(x) the squared magnitude of x

sign(x) indicates the sign of x , returning -1, 0, or +1

signbit(x) indicates whether the sign bit is on (true) or off (false)

copysign(x,y) a value with the magnitude of x and the sign of y

 Function Description

flipsign(x,y) a value with the magnitude of x and the sign of x*y

Powers, logs and roots

Function Description

sqrt(x) √x square root of x

cbrt(x) ∛x cube root of x

hypot(x,y) hypotenuse of right-angled triangle with other sides of length x and y

exp(x) natural exponential function at x

expm1(x) accurate exp(x)-1 for x near zero

ldexp(x,n) x*2^n computed efficiently for integer values of n

log(x) natural logarithm of x

log(b,x) base b logarithm of x

log2(x) base 2 logarithm of x

log10(x) base 10 logarithm of x

log1p(x) accurate log(1+x) for x near zero

 Function Description

exponent(x) binary exponent of x

significand(x) binary significand (a.k.a. mantissa) of a floating-point number x

For an overview of why functions like hypot() , expm1() , and log1p() are necessary and
useful, see John D. Cook’s excellent pair of blog posts on the subject: expm1, log1p, erfc,
and hypot.

Trigonometric and hyperbolic functions

All the standard trigonometric and hyperbolic functions are also defined:

sin cos tan cot sec csc

sinh cosh tanh coth sech csch
asin acos atan acot asec acsc
asinh acosh atanh acoth asech acsch
sinc cosc atan2

These are all single-argument functions, with the exception of atan2, which gives the
angle in radians between the x-axis and the point specified by its arguments, interpreted
as x and y coordinates.

Additionally, sinpi(x) and cospi(x) are provided for more accurate computations of
sin(pi*x) and cos(pi*x) respectively.

In order to compute trigonometric functions with degrees instead of radians, suffix the
function with d . For example, sind(x) computes the sine of x where x is specified in
degrees. The complete list of trigonometric functions with degree variants is:

sind cosd tand cotd secd cscd

asind acosd atand acotd asecd acscd
491872