Elements in a finite group of order primeHow do I use Cipolla's algorithm to compute a square root of $56$ mod $101$$p^3 + 2$ is prime if $p$ and $p^2 + 2$ are prime?$q=1+k256$ and q is a prime,does $q|2^k+1$Generator of group, find the inverse, solve equationPrimitive elements proofFermat's Theorem and primitive $n$th roots of unityQuestion on Legendre symbol and orders of elements modulo a prime.$x^m equiv 1$ (mod p) has $(m,p-1)$ rootsProof of $(mathbbZ/p^k mathbbZ)^timescongmathbbZ/phi(p^k) mathbbZ$
Why doesn't hot charcoal glow blue?
Does Turkey make the "structural steel frame" for the F-35 fighter?
What is gerrymandering called if it's not the result of redrawing districts?
Rawrdon Mamsay pays a visit
Matrix class in C#
How can I seal 8 inch round holes in my siding?
How can a stock trade for a fraction of a cent?
Is the phrase “You are requested” polite or rude?
When applying for a visa has there ever been a case of embassy asking for proof of right to be in the present country?
Linux Commands in Python
How to cut a perfect shape out of 4cm oak?
Just how fanciful is Egyptology?
I'm half of a hundred
Cutting a 4.5m long 2x6 in half with a circular saw
Was Switzerland pressured either by Allies or Axis to take part in World War 2 at any time?
Will I be allowed to enter the US after living there illegally then legally in the past?
I run daily 5kms but I cant seem to improve stamina when playing soccer
Does code obfuscation give any measurable security benefit?
In the old name Dreadnought, is nought an adverb or a noun?
Newcommand with optional argument and ifthenelse
Why is this a missed win?
Why do baby boomers have to sell 5% of their retirement accounts by the end of the year?
Prisoner's dilemma formulation for children
Why can a T* be passed in register, but a unique_ptr<T> cannot?
Elements in a finite group of order prime
How do I use Cipolla's algorithm to compute a square root of $56$ mod $101$$p^3 + 2$ is prime if $p$ and $p^2 + 2$ are prime?$q=1+k256$ and q is a prime,does $q|2^k+1$Generator of group, find the inverse, solve equationPrimitive elements proofFermat's Theorem and primitive $n$th roots of unityQuestion on Legendre symbol and orders of elements modulo a prime.$x^m equiv 1$ (mod p) has $(m,p-1)$ rootsProof of $(mathbbZ/p^k mathbbZ)^timescongmathbbZ/phi(p^k) mathbbZ$
.everyoneloves__top-leaderboard:empty,.everyoneloves__mid-leaderboard:empty,.everyoneloves__bot-mid-leaderboard:empty
margin-bottom:0;
.everyonelovesstackoverflowposition:absolute;height:1px;width:1px;opacity:0;top:0;left:0;pointer-events:none;
$begingroup$
I'm trying to prove the following statement:
Let $p=101$.
Let $xin (mathbbZ/pmathbbZ)^*$ be arbitrary. Show that there exists $yin (mathbbZ/pmathbbZ)^*$ such that $y^3=x$.
Here is my work.
Since $p$ is a prime. We know that the group of units $(mathbbZ/pmathbbZ)^*$ is a field and cyclic.
Let $alphain(mathbbZ/pmathbbZ)^*$ be a primitive root, then $x=alpha^j$ for some $jin mathbbZ$. But I cannot go further.
I also tried Fermat's little theorem as follows; beginequation*
x^100 equiv 1 quad mod(101)
endequation*
and beginequation*
(x^3)^33x equiv 1 quad mod(101)
endequation*
But I cannot see the exact solution. Can you help me please?
abstract-algebra group-theory number-theory finite-groups
New contributor
eloparti is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
$endgroup$
add a comment
|
$begingroup$
I'm trying to prove the following statement:
Let $p=101$.
Let $xin (mathbbZ/pmathbbZ)^*$ be arbitrary. Show that there exists $yin (mathbbZ/pmathbbZ)^*$ such that $y^3=x$.
Here is my work.
Since $p$ is a prime. We know that the group of units $(mathbbZ/pmathbbZ)^*$ is a field and cyclic.
Let $alphain(mathbbZ/pmathbbZ)^*$ be a primitive root, then $x=alpha^j$ for some $jin mathbbZ$. But I cannot go further.
I also tried Fermat's little theorem as follows; beginequation*
x^100 equiv 1 quad mod(101)
endequation*
and beginequation*
(x^3)^33x equiv 1 quad mod(101)
endequation*
But I cannot see the exact solution. Can you help me please?
abstract-algebra group-theory number-theory finite-groups
New contributor
eloparti is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
$endgroup$
$begingroup$
Use$pmod101$for $pmod101$.
$endgroup$
– Shaun
16 mins ago
add a comment
|
$begingroup$
I'm trying to prove the following statement:
Let $p=101$.
Let $xin (mathbbZ/pmathbbZ)^*$ be arbitrary. Show that there exists $yin (mathbbZ/pmathbbZ)^*$ such that $y^3=x$.
Here is my work.
Since $p$ is a prime. We know that the group of units $(mathbbZ/pmathbbZ)^*$ is a field and cyclic.
Let $alphain(mathbbZ/pmathbbZ)^*$ be a primitive root, then $x=alpha^j$ for some $jin mathbbZ$. But I cannot go further.
I also tried Fermat's little theorem as follows; beginequation*
x^100 equiv 1 quad mod(101)
endequation*
and beginequation*
(x^3)^33x equiv 1 quad mod(101)
endequation*
But I cannot see the exact solution. Can you help me please?
abstract-algebra group-theory number-theory finite-groups
New contributor
eloparti is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
$endgroup$
I'm trying to prove the following statement:
Let $p=101$.
Let $xin (mathbbZ/pmathbbZ)^*$ be arbitrary. Show that there exists $yin (mathbbZ/pmathbbZ)^*$ such that $y^3=x$.
Here is my work.
Since $p$ is a prime. We know that the group of units $(mathbbZ/pmathbbZ)^*$ is a field and cyclic.
Let $alphain(mathbbZ/pmathbbZ)^*$ be a primitive root, then $x=alpha^j$ for some $jin mathbbZ$. But I cannot go further.
I also tried Fermat's little theorem as follows; beginequation*
x^100 equiv 1 quad mod(101)
endequation*
and beginequation*
(x^3)^33x equiv 1 quad mod(101)
endequation*
But I cannot see the exact solution. Can you help me please?
abstract-algebra group-theory number-theory finite-groups
abstract-algebra group-theory number-theory finite-groups
New contributor
eloparti is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
New contributor
eloparti is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
edited 17 mins ago
Shaun
13.7k12 gold badges39 silver badges127 bronze badges
13.7k12 gold badges39 silver badges127 bronze badges
New contributor
eloparti is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
asked 9 hours ago
elopartieloparti
303 bronze badges
303 bronze badges
New contributor
eloparti is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
New contributor
eloparti is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
$begingroup$
Use$pmod101$for $pmod101$.
$endgroup$
– Shaun
16 mins ago
add a comment
|
$begingroup$
Use$pmod101$for $pmod101$.
$endgroup$
– Shaun
16 mins ago
$begingroup$
Use
$pmod101$ for $pmod101$.$endgroup$
– Shaun
16 mins ago
$begingroup$
Use
$pmod101$ for $pmod101$.$endgroup$
– Shaun
16 mins ago
add a comment
|
4 Answers
4
active
oldest
votes
$begingroup$
Hint: Fermat's little theorem also tells you that $ x^101equiv x mod(101) $, and therefore that $ x^101+100nequiv x mod(101) $ for any integer $ n $. What happens if you choose $ n=1 $?
By the way, the group of units $ (mathbbZ/pmathbbZ)^*$ isn't a field. It's a cyclic group under multiplication, but it's not closed under addition. The entire ring $ mathbbZ/pmathbbZ $ is what constitutes a field.
$endgroup$
$begingroup$
Firstly, thank you for the correction in my statement. You are right, in a group we have only one binary operation(in a field we have two).\ We have beginequation* x^101+100n equiv x^101(x^100)^n equiv quad x quad mod(101) endequation* Choosing $n=1$, we get beginequation* x^201 equiv x^67.3=(x^67)^3 equiv x quad mod(101) endequation* We can choose $y$ as $y=x^67$.
$endgroup$
– eloparti
9 hours ago
add a comment
|
$begingroup$
You almost have it, you just need to flip things around a bit:
$beginequation*
(x^-1)^100 equiv 1 quad mod(101)
endequation*$
$beginequation*
((x^-1)^33)^3(x^-1) equiv 1 quad mod(101)
endequation*$
$beginequation*
((x^-1)^33)^3 equiv x quad mod(101)
endequation*$
So the cube root of $x$ is $(x^-1)^33$.
New contributor
PMar is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
$endgroup$
$begingroup$
Also, $x^-1=x^99$.
$endgroup$
– lhf
9 hours ago
add a comment
|
$begingroup$
Consider the map $f: x mapsto x^3$. Since your group is abelian, it is easy to check that $f$ is a group homomorphism. Now, the order of your group is $phi(101) = 100$ and so no non-identity element has an order which is either a divisor or a multiple of 3. So, $textker(f) = x in (mathbbZ/101 mathbbZ)^* = 1$ and hence $f$ is injective. Since $f$ is an injection from a finite set to itself, $f$ is also a surjection and therefore, every element has a pre-image via $f$. That is, every element is a cube.
$endgroup$
add a comment
|
$begingroup$
Hints:
To prove existence only, prove that the map $x mapsto x^3$ is injective.
To exhibit a cube root, note that $201=67 cdot 3$.
$endgroup$
add a comment
|
Your Answer
StackExchange.ready(function()
var channelOptions =
tags: "".split(" "),
id: "69"
;
initTagRenderer("".split(" "), "".split(" "), channelOptions);
StackExchange.using("externalEditor", function()
// Have to fire editor after snippets, if snippets enabled
if (StackExchange.settings.snippets.snippetsEnabled)
StackExchange.using("snippets", function()
createEditor();
);
else
createEditor();
);
function createEditor()
StackExchange.prepareEditor(
heartbeatType: 'answer',
autoActivateHeartbeat: false,
convertImagesToLinks: true,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: 10,
bindNavPrevention: true,
postfix: "",
imageUploader:
brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/4.0/"u003ecc by-sa 4.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
allowUrls: true
,
noCode: true, onDemand: true,
discardSelector: ".discard-answer"
,immediatelyShowMarkdownHelp:true
);
);
eloparti is a new contributor. Be nice, and check out our Code of Conduct.
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function ()
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3389535%2felements-in-a-finite-group-of-order-prime%23new-answer', 'question_page');
);
Post as a guest
Required, but never shown
4 Answers
4
active
oldest
votes
4 Answers
4
active
oldest
votes
active
oldest
votes
active
oldest
votes
$begingroup$
Hint: Fermat's little theorem also tells you that $ x^101equiv x mod(101) $, and therefore that $ x^101+100nequiv x mod(101) $ for any integer $ n $. What happens if you choose $ n=1 $?
By the way, the group of units $ (mathbbZ/pmathbbZ)^*$ isn't a field. It's a cyclic group under multiplication, but it's not closed under addition. The entire ring $ mathbbZ/pmathbbZ $ is what constitutes a field.
$endgroup$
$begingroup$
Firstly, thank you for the correction in my statement. You are right, in a group we have only one binary operation(in a field we have two).\ We have beginequation* x^101+100n equiv x^101(x^100)^n equiv quad x quad mod(101) endequation* Choosing $n=1$, we get beginequation* x^201 equiv x^67.3=(x^67)^3 equiv x quad mod(101) endequation* We can choose $y$ as $y=x^67$.
$endgroup$
– eloparti
9 hours ago
add a comment
|
$begingroup$
Hint: Fermat's little theorem also tells you that $ x^101equiv x mod(101) $, and therefore that $ x^101+100nequiv x mod(101) $ for any integer $ n $. What happens if you choose $ n=1 $?
By the way, the group of units $ (mathbbZ/pmathbbZ)^*$ isn't a field. It's a cyclic group under multiplication, but it's not closed under addition. The entire ring $ mathbbZ/pmathbbZ $ is what constitutes a field.
$endgroup$
$begingroup$
Firstly, thank you for the correction in my statement. You are right, in a group we have only one binary operation(in a field we have two).\ We have beginequation* x^101+100n equiv x^101(x^100)^n equiv quad x quad mod(101) endequation* Choosing $n=1$, we get beginequation* x^201 equiv x^67.3=(x^67)^3 equiv x quad mod(101) endequation* We can choose $y$ as $y=x^67$.
$endgroup$
– eloparti
9 hours ago
add a comment
|
$begingroup$
Hint: Fermat's little theorem also tells you that $ x^101equiv x mod(101) $, and therefore that $ x^101+100nequiv x mod(101) $ for any integer $ n $. What happens if you choose $ n=1 $?
By the way, the group of units $ (mathbbZ/pmathbbZ)^*$ isn't a field. It's a cyclic group under multiplication, but it's not closed under addition. The entire ring $ mathbbZ/pmathbbZ $ is what constitutes a field.
$endgroup$
Hint: Fermat's little theorem also tells you that $ x^101equiv x mod(101) $, and therefore that $ x^101+100nequiv x mod(101) $ for any integer $ n $. What happens if you choose $ n=1 $?
By the way, the group of units $ (mathbbZ/pmathbbZ)^*$ isn't a field. It's a cyclic group under multiplication, but it's not closed under addition. The entire ring $ mathbbZ/pmathbbZ $ is what constitutes a field.
answered 9 hours ago
lonza leggieralonza leggiera
4,0092 gold badges2 silver badges9 bronze badges
4,0092 gold badges2 silver badges9 bronze badges
$begingroup$
Firstly, thank you for the correction in my statement. You are right, in a group we have only one binary operation(in a field we have two).\ We have beginequation* x^101+100n equiv x^101(x^100)^n equiv quad x quad mod(101) endequation* Choosing $n=1$, we get beginequation* x^201 equiv x^67.3=(x^67)^3 equiv x quad mod(101) endequation* We can choose $y$ as $y=x^67$.
$endgroup$
– eloparti
9 hours ago
add a comment
|
$begingroup$
Firstly, thank you for the correction in my statement. You are right, in a group we have only one binary operation(in a field we have two).\ We have beginequation* x^101+100n equiv x^101(x^100)^n equiv quad x quad mod(101) endequation* Choosing $n=1$, we get beginequation* x^201 equiv x^67.3=(x^67)^3 equiv x quad mod(101) endequation* We can choose $y$ as $y=x^67$.
$endgroup$
– eloparti
9 hours ago
$begingroup$
Firstly, thank you for the correction in my statement. You are right, in a group we have only one binary operation(in a field we have two).\ We have beginequation* x^101+100n equiv x^101(x^100)^n equiv quad x quad mod(101) endequation* Choosing $n=1$, we get beginequation* x^201 equiv x^67.3=(x^67)^3 equiv x quad mod(101) endequation* We can choose $y$ as $y=x^67$.
$endgroup$
– eloparti
9 hours ago
$begingroup$
Firstly, thank you for the correction in my statement. You are right, in a group we have only one binary operation(in a field we have two).\ We have beginequation* x^101+100n equiv x^101(x^100)^n equiv quad x quad mod(101) endequation* Choosing $n=1$, we get beginequation* x^201 equiv x^67.3=(x^67)^3 equiv x quad mod(101) endequation* We can choose $y$ as $y=x^67$.
$endgroup$
– eloparti
9 hours ago
add a comment
|
$begingroup$
You almost have it, you just need to flip things around a bit:
$beginequation*
(x^-1)^100 equiv 1 quad mod(101)
endequation*$
$beginequation*
((x^-1)^33)^3(x^-1) equiv 1 quad mod(101)
endequation*$
$beginequation*
((x^-1)^33)^3 equiv x quad mod(101)
endequation*$
So the cube root of $x$ is $(x^-1)^33$.
New contributor
PMar is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
$endgroup$
$begingroup$
Also, $x^-1=x^99$.
$endgroup$
– lhf
9 hours ago
add a comment
|
$begingroup$
You almost have it, you just need to flip things around a bit:
$beginequation*
(x^-1)^100 equiv 1 quad mod(101)
endequation*$
$beginequation*
((x^-1)^33)^3(x^-1) equiv 1 quad mod(101)
endequation*$
$beginequation*
((x^-1)^33)^3 equiv x quad mod(101)
endequation*$
So the cube root of $x$ is $(x^-1)^33$.
New contributor
PMar is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
$endgroup$
$begingroup$
Also, $x^-1=x^99$.
$endgroup$
– lhf
9 hours ago
add a comment
|
$begingroup$
You almost have it, you just need to flip things around a bit:
$beginequation*
(x^-1)^100 equiv 1 quad mod(101)
endequation*$
$beginequation*
((x^-1)^33)^3(x^-1) equiv 1 quad mod(101)
endequation*$
$beginequation*
((x^-1)^33)^3 equiv x quad mod(101)
endequation*$
So the cube root of $x$ is $(x^-1)^33$.
New contributor
PMar is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
$endgroup$
You almost have it, you just need to flip things around a bit:
$beginequation*
(x^-1)^100 equiv 1 quad mod(101)
endequation*$
$beginequation*
((x^-1)^33)^3(x^-1) equiv 1 quad mod(101)
endequation*$
$beginequation*
((x^-1)^33)^3 equiv x quad mod(101)
endequation*$
So the cube root of $x$ is $(x^-1)^33$.
New contributor
PMar is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
New contributor
PMar is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
answered 9 hours ago
PMarPMar
311 bronze badge
311 bronze badge
New contributor
PMar is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
New contributor
PMar is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
$begingroup$
Also, $x^-1=x^99$.
$endgroup$
– lhf
9 hours ago
add a comment
|
$begingroup$
Also, $x^-1=x^99$.
$endgroup$
– lhf
9 hours ago
$begingroup$
Also, $x^-1=x^99$.
$endgroup$
– lhf
9 hours ago
$begingroup$
Also, $x^-1=x^99$.
$endgroup$
– lhf
9 hours ago
add a comment
|
$begingroup$
Consider the map $f: x mapsto x^3$. Since your group is abelian, it is easy to check that $f$ is a group homomorphism. Now, the order of your group is $phi(101) = 100$ and so no non-identity element has an order which is either a divisor or a multiple of 3. So, $textker(f) = x in (mathbbZ/101 mathbbZ)^* = 1$ and hence $f$ is injective. Since $f$ is an injection from a finite set to itself, $f$ is also a surjection and therefore, every element has a pre-image via $f$. That is, every element is a cube.
$endgroup$
add a comment
|
$begingroup$
Consider the map $f: x mapsto x^3$. Since your group is abelian, it is easy to check that $f$ is a group homomorphism. Now, the order of your group is $phi(101) = 100$ and so no non-identity element has an order which is either a divisor or a multiple of 3. So, $textker(f) = x in (mathbbZ/101 mathbbZ)^* = 1$ and hence $f$ is injective. Since $f$ is an injection from a finite set to itself, $f$ is also a surjection and therefore, every element has a pre-image via $f$. That is, every element is a cube.
$endgroup$
add a comment
|
$begingroup$
Consider the map $f: x mapsto x^3$. Since your group is abelian, it is easy to check that $f$ is a group homomorphism. Now, the order of your group is $phi(101) = 100$ and so no non-identity element has an order which is either a divisor or a multiple of 3. So, $textker(f) = x in (mathbbZ/101 mathbbZ)^* = 1$ and hence $f$ is injective. Since $f$ is an injection from a finite set to itself, $f$ is also a surjection and therefore, every element has a pre-image via $f$. That is, every element is a cube.
$endgroup$
Consider the map $f: x mapsto x^3$. Since your group is abelian, it is easy to check that $f$ is a group homomorphism. Now, the order of your group is $phi(101) = 100$ and so no non-identity element has an order which is either a divisor or a multiple of 3. So, $textker(f) = x in (mathbbZ/101 mathbbZ)^* = 1$ and hence $f$ is injective. Since $f$ is an injection from a finite set to itself, $f$ is also a surjection and therefore, every element has a pre-image via $f$. That is, every element is a cube.
edited 9 hours ago
answered 9 hours ago
user328442user328442
2,0991 gold badge6 silver badges16 bronze badges
2,0991 gold badge6 silver badges16 bronze badges
add a comment
|
add a comment
|
$begingroup$
Hints:
To prove existence only, prove that the map $x mapsto x^3$ is injective.
To exhibit a cube root, note that $201=67 cdot 3$.
$endgroup$
add a comment
|
$begingroup$
Hints:
To prove existence only, prove that the map $x mapsto x^3$ is injective.
To exhibit a cube root, note that $201=67 cdot 3$.
$endgroup$
add a comment
|
$begingroup$
Hints:
To prove existence only, prove that the map $x mapsto x^3$ is injective.
To exhibit a cube root, note that $201=67 cdot 3$.
$endgroup$
Hints:
To prove existence only, prove that the map $x mapsto x^3$ is injective.
To exhibit a cube root, note that $201=67 cdot 3$.
answered 9 hours ago
lhflhf
176k12 gold badges180 silver badges418 bronze badges
176k12 gold badges180 silver badges418 bronze badges
add a comment
|
add a comment
|
eloparti is a new contributor. Be nice, and check out our Code of Conduct.
eloparti is a new contributor. Be nice, and check out our Code of Conduct.
eloparti is a new contributor. Be nice, and check out our Code of Conduct.
eloparti is a new contributor. Be nice, and check out our Code of Conduct.
Thanks for contributing an answer to Mathematics Stack Exchange!
- Please be sure to answer the question. Provide details and share your research!
But avoid …
- Asking for help, clarification, or responding to other answers.
- Making statements based on opinion; back them up with references or personal experience.
Use MathJax to format equations. MathJax reference.
To learn more, see our tips on writing great answers.
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function ()
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3389535%2felements-in-a-finite-group-of-order-prime%23new-answer', 'question_page');
);
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
$begingroup$
Use
$pmod101$for $pmod101$.$endgroup$
– Shaun
16 mins ago