[ 3 / biz / cgl / ck / diy / fa / ic / jp / lit / sci / vr / vt ] [ index / top / reports ] [ become a patron ] [ status ]
2023-11: Warosu is now out of extended maintenance.

/sci/ - Science & Math

Search:


View post   

>> No.2304538 [View]
File: 281 KB, 1000x669, 1284266495276.jpg [View same] [iqdb] [saucenao] [google]
2304538

>>2304469
I'm kinda sad that no one has given you any real help yet. Check out page 44 of "Algebra" by Artin. (very similar problem)

The last defenying relation implies you can write all combinations in the form (a^n)*(b^m). With n and m from 0 to 4 (and 3) (respectivly).

Write out all the combinations, then reduce duplicate results using your defnying relations.

Make sense?

>> No.2244746 [View]
File: 281 KB, 1000x669, 1284266495276.jpg [View same] [iqdb] [saucenao] [google]
2244746

>>2244503

Navigation
View posts[+24][+48][+96]