olymmath

Putnam 1976 B2

  • Session B

B-2. Suppose that GG is a group generated by elements AA and BB, that is, every element of GG can be written as a finite "word" An1Bn2An1⋯BnkA^{n_{1}} B^{n_{2}} A^{n_{1}} \cdots B^{n_{k}}, where n1,…,nkn_{1}, \ldots, n_{k} are any integers, and A0=Bn=1A^{0}=B^{n}=1 as usual. Also, suppose that A4=B7=ABA−1B=1,A2≠1A^{4}=B^{7}=A B A^{-1} B=1, A^{2} \neq 1, and B≠1B \neq 1. (a) How many elements of GG are of the form C2C^{2} with CC in GG ? (b) Write each such square as a word in AA and BB.

Dataset text PutnamGAP. Quoted with source.

Solutions

No solution is on olymmath yet. Official and human solutions come first when they arrive. AI solutions come after them, with a label.

Add a solution

Similar problems

These problems have the most words in common with this statement.

Locator putnam/1976/b2 · Tag KASZH845CD · Edit this page on GitHub · Keys: j next, k previous