×
Information!
Sign In
to continue to Youth4work
UserName, Email or phone
Enter your password
Remember me
Register
|
Forgot password
Login
Practice Tests
yTests - Skill Tests
Prep Tests
Psychometric Test
Typing Test
For Job Seekers
Search Jobs
Post Resume
yTests - Skill Tests
Prep Tests
Follow Employers
Job Insights
Certification Courses
For Employers
Post Jobs - Free
Contact Pre-Assessed Profiles
Campus Hiring
Managed Recruitment
Assessment Solutions
Subscription Plans
Sign In
Register
Free !!
Practice Tests
yTests - Skill Tests
Prep Tests
Psychometric Test
Typing Test
For Job Seekers
Search Jobs
Post Resume
yTests - Skill Tests
Prep Tests
Follow Employers
Job Insights
Certification Courses
For Employers
Post Jobs - Free
Contact Pre-Assessed Profiles
Campus Hiring
Managed Recruitment
Assessment Solutions
Subscription Plans
Sign In
Register
Free !!
×
Information!
Online Prep Test
Gate Computer Science (Cs)
Forum
Graph Theory Discrete Mathematics
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
answer
Answer
×
0 Answer
0 Answer
No answer yet, be the first one to answer this question.
Other Related Discussions
Кухни на заказ
Tricks to Prepare for GATE Computer science
I have completed my B.Tech with 50%. Am I eligible for GATE 2018?
anyone say me the cut off required for cs stream to get into psu's
How do I start preparing for the 2019 GATE for CS?
give some text book names for gate preaparation
what are the public sectors to give the jobs for computer science students?
qus > I have passed in 2017 but I have a backlog. Can I apply for GATE 2018?
How are previous papers helpful?
What is the expected cutoff? How was the cutoff in the last few years?
Ask a Question
Practice Mock Test
gate computer science (cs)
Take Mock Test
×
Close
Ask / Start a new topic
title
forum