Scribd
Upload
18 views

Parth Nagpal: J NJ NJ N

The document contains 14 properties of numbers and arithmetic. It discusses topics like prime factorization, greatest common factors, least common multiples, divisibility tests, and arithmetic in different bases.

Uploaded by

Parth Nagpal
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
18 views

Parth Nagpal: J NJ NJ N

The document contains 14 properties of numbers and arithmetic. It discusses topics like prime factorization, greatest common factors, least common multiples, divisibility tests, and arithmetic in different bases.

Uploaded by

Parth Nagpal
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 3

Parth Nagpal

1. The product of n consecutive natural numbers is always divisible by n!


2. Square of every natural can be written in the form (3n or 3n+1) or (4n or 4n+1).
3. 0.abcabcabc...... = abc
4. a.bcdbcdbcd......

999
= abcd-ab
990

5. N = xa y b zc.......
Number of factors of N = (a+1)(b+1)(c+1).....
Sum of factors = J x

b+1
- 1 z c+1 - 1
-1 y
NJ
NJ
N
x-1
b-1
z-1
a b c

a+1

Product of factors = x y z

6. 5. N = 2a y b zc.......
Number of Even Factors of N = a(b+1)(c+1).....
Number of Odd Factors of N = (b+1)(c+1).....
7. N = xa y b zc.......
i) If N is not a prefect square, number of ways N can be written as a
Product of two factors =

Ha+1L Hb+1L Hc+1L


2

ii) If N is not a prefect square, number of ways N can be written as a :


a) Product of two factors :
b) Product of two different
8. N = xa y b zc.......

Ha+1L Hb+1L Hc+1L + 1


2
factors : Ha+1L Hb+1L Hc+1L - 1
2

Number of positive integers less than and coprime to N = N


I1 - 1 MJ1 - 1 NI1 - 1 M
x

9.HCF x LCM = N1 x N2
LCM= k(HCF)
10. HCFHN1, N2) = H
HCFHN1 + N2, N2) = H
HCFHN1 - N2, N2) = H
11.If P leaves a remainder R when divided by the numbers N1, N2, N3........ ,
then P = k LCM(N1, N2, N3........) + R
12.In finding the digital sum of a number, we can ignore the digit 9 or the digits
that add up to 9.
13. If one of multiplicand is 9, the digital sum is always 9.

a HNL
14.
Remainder 1 ; a and N are coprime.
N

then P = k LCM(N1, N2, N3........) + R


12.In finding the digital sum of a number, we can ignore the digit 9 or the digits
thatSystem.nb
add up to 9.
Number
13. If one of multiplicand is 9, the digital sum is always 9.

a HNL
14.
Remainder 1 ; a and N are coprime.
N

15. Any exponent of 0,1,5 and 6 gives the same unit digit.
16. Exponents of 2,3,7 and 8 :
2
4k+1 2
4k+2 4
4k+3 8
4k
6

3
3
9
7
1

7
7
9
3
1

8
8
4
2
6

17. Exponents of 4 and 9 :


4 9
2 k + 1 HOddL 4 9
2 k HEvenL 6 1

18. 2n .76 2n HLast two digitsL, n 2


19. 25n25
35n 25 ; if n is even
75 ; if n is odd
20.To check the divisibility by :
A) 2, 4, 8, ...., 2n
If the number formed by the last one,two,three,.....n digits is divisible by
2, 4, 8, ...., 2n respectively.
B) 3 and 9
If the sum of the digits is divisible by 3 and 9 respectively.
C) 7,11 and 13
Make groups of 3 digits
ABC|DEF, then ABCDEF is divisible iff DEF-ABC is divisible by 7,11,13
respectively.
D) 27 and 37
Make groups of 3 digits
ABC|DEF, then ABCDEF is divisible iff ABC+DEF is divisible by 27,37
respectively.

D) 27 and 37
Make groups of 3 digits
ABC|DEF, then ABCDEF is divisible iff ABC+DEF is divisibleNumber
by 27,37
System.nb
respectively.

21. Conversion from Base to Decimal:


H2453L7 = 3.70 + 5.71 + 4.72 + 2.73
Conversion from Decimal to Base:

4 25
6 1
1 2
0 1
H25L4 = 121
22. Addition,Subtraction and Multiplication in bases :
Add H4235L7 and H2354L7
1
4 2
2 3
6 6

1
3 5
5 4
2 2

Subtract H45 026L7 from H51 231L7


5 1 2 3 1
- 4 5 0 2 6
3 2 0 2

Multiply H37L9 and H46L9

4
H3 7L9
x H4 6L9
2 4 6L9
6 1 0L9
H1
8 5 6L9

You might also like