Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
Profile
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Questions by yuyutsu
1
votes
0
answers
1
Charles C Pinter Abstract Algebra
If G is a group, G=(F(R), +), F(R) set of all real valued functions. H={f€F(R) ; f(-x)=-f(x)} Is H a subgroup of G? My solution.(Click on link..I have not shown th associative prt coz addition is always associative) please let me know if iam correct. https://ibb.co/sPzHg6m https://ibb.co/sPzHg6m
If G is a group, G=(F(R), +), F(R) set of all real valued functions.H={f€F(R) ; f(-x)=-f(x)}Is H a subgroup of G?My solution.(Click on link..I have not shown th associa...
43
views
asked
4 days
ago
Set Theory & Algebra
discrete-mathematics
group-theory
+
–
0
votes
0
answers
2
Clrs ex 5.2-2 chapter5 page133 4thedition
Hiring assistant. Initially assistant is NULL We have n candidates who hv come to interview for the position of assistant. Each candidate has distinct scores or level of qualifications. Now initially we have no assistant(stated earlier), so the first ... to solve this sum, and my answer is The best candidate comes in at kth position. Am I right? Thankyou.
Hiring assistant. Initially assistant is NULL We have n candidates who hv come to interview for the position of assistant. Each candidate has distinct scores or level of ...
211
views
asked
May 1, 2023
0
votes
1
answer
3
Cengage algebra jee advanced.
Coefficient of x^8 in ( (1-x^6)/(1-x) )^3.
Coefficient of x^8 in ( (1-x^6)/(1-x) )^3.
442
views
asked
Jul 24, 2022
Combinatory
combinatory
+
–
0
votes
1
answer
4
BigEndian C compiler
Hi, can anyone please suggest me an online site where I can run code in C and test how the code will act under bid endian environment?
Hi, can anyone please suggest me an online site where I can run code in C and test how the code will act under bid endian environment?
831
views
asked
Jul 3, 2022
Programming in C
programming-in-c
compiler-design
+
–
2
votes
1
answer
5
Recurrence Tree Method
T(n) = 5T(n/3) + T(2n/3) + 1. My answer is BigOmega(n) BigO(n). Am I right? This is a question I found on cs.stackexchange.
T(n) = 5T(n/3) + T(2n/3) + 1.My answer is BigOmega(n) BigO(n). Am I right? This is a question I found on cs.stackexchange.
632
views
asked
Jun 22, 2022
Algorithms
recurrence-relation
algorithms
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register
