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
-
Is studing GATE course also be useful for those who aren't preparing for gate exam??
-
how rank is calculated in GATE?
-
A third year student will be able to give GATE exam.
-
What GATE score and rank do I need to get in GATE (computer science) to get into PSUs?
-
i want to attempt unlimited questions each day for practice. but this app only provides 20 questions each day and that is not enough for me. to attempt as many questions i want what should i do?
-
Кухни на заказ
-
How are previous papers helpful?
-
I have upgraded my plan but my money is debited from my account but the upgradation is not done
-
what subject is most wethag in gate.
-
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.
