Graph Theory Discrete Mathematics
Can someone explain-->"Since n(n-1) must be divisible by 4, it follows that n=0 or 1 (mod 4)"?
- Rohan
- 24 May
- 0 Answer
0 Answer
0 Answer
No answer yet, be the first one to answer this question.
Other Related Discussions
-
How I study as I have to give exam for gate 2019 ? As I also go to college and coaching also so how i manage time to study ..please some one help me out.
-
How can I access more mock tests? I just have 10 here, and I wanted some more also.
-
Tricks to Prepare for GATE Computer science
-
How much time one need to give per day to crack GATE in one year ?
-
What is the exam pattern for GATE Computer Science (CS)?
-
What do you mean by GATE? Is it an online exam?
-
which book is the best for GATE preparation with theory.
-
What is the eligibility criteria for GATE Computer Science Exam?
-
velocity formula
-
Consider a system where each file is associated with a 16 bit number. For each file, each user should have the read and write capability. How much memory is needed to store each user's access data?
