Handshake Problem
Handshake ProblemSuppose there are n people in the party. The first person shakes hand with the other (n-1) guests. The second guest shakes hand with the other (n-2) guests. this will continue until the (n-1) th guest shakes hand with the nth guest.
Total number of handshakes is (n-1) + (n-2)... + 3 + 2 + 1.
= ((n-1)(n))/2
For example, 6 people in a party shake hand with other guests. So how many handshakes will be there?
=((6-1)(6))/2
=15.
കോൺവെക്സ് - ദീർഘദൃഷ്ടി.
കോൺകേവ് - ഹ്രസ്വദൃഷ്ടി .
സിലണ്ട്രിക്കൽ - വിഷമദൃഷ്ടി.
കോഡ്: .
മലയാളത്തിൽ \'\'കോൺവെക്സ് \" എന്നെഴുതുമ്പോൾ മറ്റ് ലെൻസുകളെ അപേക്ഷിച്ച് ദീർഘമുള്ള പേരാണ് ഇത്. അതിനാൽ ദീർഘദൃഷ്ടി പരിഹരിക്കാനുപയോഗിക്കുന്നു \' .
മലയാളത്തിലെഴുതുമ്പോൾ \"കോൺകേവ് \" എന്ന വാക്ക് മറ്റ് ലെൻസുകളുടെ പേരെഴുതുന്നതിനേക്കാൾ ചെറുതാണ്. ഹ്രസ്വദൃഷ്ടി പരിഹരിക്കാനുപ...
Code: ABC FIR GJ.
A : America .
B : Britain.
C : Canada.
F : France.
I : Italy.
R : Russia.
G : Germany.
J : Japan.
...
What is the divisibility by 2 Rule?.
Even numbers are multiples of 2. A number is even if ends in 0,2,4,6, or 8.
What is the divisibility by 3 rule?.
A number is divisible by 3 if the sum of its digits is divisible by 3.
372, for instance, is divisible by 3 since sum of its digits (3+7+2) is 12. And 12 is divisible by 3.
What is the divisibility by 4 rule?.
A number is divisible by 4 if the number\'s last two digits are divisible by 4.
9,312, for instance, is divisible by 4 since its last 2 digits are 12. And 12 is divisible by 4.
What is the divisibility by 5 rule?.
A number is divisible by 5 if its last digit is a 0 or 5.
What is the divisibility by 6 rule?.
Since 6 is a multiple of 2 and 3, the rules for divisibility by 6 are a combination of the rule for 2 and the rule for 3.
Divisibility by 8 Rule.
A number passes the test for 8 if the las...
















