Date | November 2017 | Marks available | 2 | Reference code | 17N.3srg.hl.TZ0.4 |
Level | HL only | Paper | Paper 3 Sets, relations and groups | Time zone | TZ0 |
Command term | Show that | Question number | 4 | Adapted from | N/A |
Question
The set S is defined as the set of real numbers greater than 1.
The binary operation ∗ is defined on S by x∗y=(x−1)(y−1)+1 for all x, y∈S.
Let a∈S.
Show that x∗y∈S for all x, y∈S.
Show that the operation ∗ on the set S is commutative.
Show that the operation ∗ on the set S is associative.
Show that 2 is the identity element.
Show that each element a∈S has an inverse.
Markscheme
x, y>1⇒(x−1)(y−1)>0 M1
(x−1)(y−1)+1>1 A1
so x∗y∈S for all x, y∈S AG
[2 marks]
x∗y=(x−1)(y−1)+1=(y−1)(x−1)+1=y∗x M1A1
so ∗ is commutative AG
[2 marks]
x∗(y∗z)=x∗((y−1)(z−1)+1) M1
=(x−1)((y−1)(z−1)+1−1)+1 (A1)
=(x−1)(y−1)(z−1)+1 A1
(x∗y)∗z=((x−1)(y−1)+1)∗z M1
=((x−1)(y−1)+1−1)(z−1)+1
=(x−1)(y−1)(z−1)+1 A1
so ∗ is associative AG
[5 marks]
2∗x=(2−1)(x−1)+1=x, x∗2=(x−1)(2−1)+1=x M1
2∗x=x∗2=2 (2∈S) R1
Note: Accept reference to commutativity instead of explicit expressions.
so 2 is the identity element AG
[2 marks]
a∗a−1=2⇒(a−1)(a−1−1)+1=2 M1
so a−1=1+1a−1 A1
since a−1>0⇒a−1>1 (a−1∗a=a∗a−1) R1
Note: R1 dependent on M1.
so each element, a∈S, has an inverse AG
[3 marks]