A group where every two elements different than 1 are conjugate has order 1 or 2.











up vote
5
down vote

favorite
3












I need help showing this:



Let G be a finite group such that for every $x$, $y$ in G, $xneq 1$ and $yneq 1$, we have that $x$ and $y$ are conjugates. Under those conditions, G must have order 1 or 2.



This is under the topic "actions of groups on sets", but I couldn't figure out a way to start it. Since every element is conjugate, then G must have only one conjugation class, which is itself, but how can this information help?










share|cite|improve this question


















  • 1




    I'll note that the condition that $G$ is finite is essential. There are infinite groups in which any two non-identity elements are conjugate (they can be constructed as a sequence of HNN extensions).
    – Arturo Magidin
    Apr 28 '12 at 3:44















up vote
5
down vote

favorite
3












I need help showing this:



Let G be a finite group such that for every $x$, $y$ in G, $xneq 1$ and $yneq 1$, we have that $x$ and $y$ are conjugates. Under those conditions, G must have order 1 or 2.



This is under the topic "actions of groups on sets", but I couldn't figure out a way to start it. Since every element is conjugate, then G must have only one conjugation class, which is itself, but how can this information help?










share|cite|improve this question


















  • 1




    I'll note that the condition that $G$ is finite is essential. There are infinite groups in which any two non-identity elements are conjugate (they can be constructed as a sequence of HNN extensions).
    – Arturo Magidin
    Apr 28 '12 at 3:44













up vote
5
down vote

favorite
3









up vote
5
down vote

favorite
3






3





I need help showing this:



Let G be a finite group such that for every $x$, $y$ in G, $xneq 1$ and $yneq 1$, we have that $x$ and $y$ are conjugates. Under those conditions, G must have order 1 or 2.



This is under the topic "actions of groups on sets", but I couldn't figure out a way to start it. Since every element is conjugate, then G must have only one conjugation class, which is itself, but how can this information help?










share|cite|improve this question













I need help showing this:



Let G be a finite group such that for every $x$, $y$ in G, $xneq 1$ and $yneq 1$, we have that $x$ and $y$ are conjugates. Under those conditions, G must have order 1 or 2.



This is under the topic "actions of groups on sets", but I couldn't figure out a way to start it. Since every element is conjugate, then G must have only one conjugation class, which is itself, but how can this information help?







group-theory






share|cite|improve this question













share|cite|improve this question











share|cite|improve this question




share|cite|improve this question










asked Apr 28 '12 at 0:36









Marra

2,480945




2,480945








  • 1




    I'll note that the condition that $G$ is finite is essential. There are infinite groups in which any two non-identity elements are conjugate (they can be constructed as a sequence of HNN extensions).
    – Arturo Magidin
    Apr 28 '12 at 3:44














  • 1




    I'll note that the condition that $G$ is finite is essential. There are infinite groups in which any two non-identity elements are conjugate (they can be constructed as a sequence of HNN extensions).
    – Arturo Magidin
    Apr 28 '12 at 3:44








1




1




I'll note that the condition that $G$ is finite is essential. There are infinite groups in which any two non-identity elements are conjugate (they can be constructed as a sequence of HNN extensions).
– Arturo Magidin
Apr 28 '12 at 3:44




I'll note that the condition that $G$ is finite is essential. There are infinite groups in which any two non-identity elements are conjugate (they can be constructed as a sequence of HNN extensions).
– Arturo Magidin
Apr 28 '12 at 3:44










2 Answers
2






active

oldest

votes

















up vote
14
down vote



accepted










If $G$ is the trivial group, then the condition holds. So suppose $G$ isn't the trivial group.



$G$ acts on itself by conjugation, i.e. we have an action $G times G to G$ where $(g,h) mapsto ghg^{-1}$. Take an element $x in G$. Since any two non-identity elements are conjugate, $mathrm{orb}_G(x) = G backslash {e}$, so $|mathrm{orb}_G(x)| = |G| - 1$. But the orbit-stabiliser theorem tells us that the size of an orbit divides the order of the group. So $|G|-1 $ divides $|G|$. So $|G|$ must be 2.






share|cite|improve this answer























  • To check your understanding: what's $mathrm{stab}_G(x)$ in this case?
    – Jonathan
    Apr 28 '12 at 1:00






  • 1




    $stab_G(x)$ is the set of all elements of $G$ that $gx=x$, that is, $stab_G(x)={gin G | gx=x}$. Right?
    – Marra
    Apr 28 '12 at 1:15










  • I know now why I couldn't have a clue on this before: $x$ and $y$ are conjugate if there is an element $z$ other than $1$ such that $x=zyz^{-1}$. I forgot to exclude the 1!
    – Marra
    Apr 28 '12 at 1:17










  • @GustavoMarra That's the right definition, yes (provided one interprets your notation correctly). $mathrm{stab}_G(x)$ is the set of all elements of $G$ such that $g cdot x = x$ where "$cdot$" denotes the action. So in the case of the conjugation action, this is equivalent to saying $mathrm{stab}_G(x) = { g in G | gxg^{-1} = x }$ where (for lack of a better term) "placement of letters next to each other" corresponds to the group multiplication law. What I mean to ask is "can you list the elements in the stabiliser of $x$ for a particular $x$? (for this particular action)"
    – Jonathan
    Apr 28 '12 at 1:18




















up vote
2
down vote













Here's another proof, not quite as elegant, but with a different flavor that I feel is also worth seeing. In this proof I use a few of the theorems you may have seen in the "group actions" section of the book:



Since conjugate elements have the same order, all nonidentity elements have the same order. Thus only one prime number, $p$, divides the order of the group, since for every prime dividing $|G|$ we have an element whose order is that prime (This follows from Cauchy's Theorem and the Sylow Theorems, which I expect you'll encounter soon). But we know $p$-groups have nontrivial centers (by the class equation, one of the most important elementary results using group actions), and elements of the center are their own conjugacy classes. Since the order of the center is at least $p$ and the center has at most one nonidentity element, $p=2$, and $|Z(G)|=2$. If $|G|$ is 4 or more, then we have elements not in the center, which cannot be conjugate to elements of the center. Thus $|G|=2$.






share|cite|improve this answer























  • This is fine, but it uses Sylow's theorems... and I'm supposed to solve that without them.
    – Marra
    Apr 28 '12 at 1:28






  • 1




    Yeah, Jonathan's solution is nicer anyhow, but I figured it would be useful to see a proof that makes good use of the some of the bigger theorems you find in a first course on group theory.
    – Brett Frankel
    Apr 28 '12 at 1:32











Your Answer





StackExchange.ifUsing("editor", function () {
return StackExchange.using("mathjaxEditing", function () {
StackExchange.MarkdownEditor.creationCallbacks.add(function (editor, postfix) {
StackExchange.mathjaxEditing.prepareWmdForMathJax(editor, postfix, [["$", "$"], ["\\(","\\)"]]);
});
});
}, "mathjax-editing");

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',
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/3.0/"u003ecc by-sa 3.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
});


}
});














draft saved

draft discarded


















StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f137858%2fa-group-where-every-two-elements-different-than-1-are-conjugate-has-order-1-or-2%23new-answer', 'question_page');
}
);

Post as a guest















Required, but never shown

























2 Answers
2






active

oldest

votes








2 Answers
2






active

oldest

votes









active

oldest

votes






active

oldest

votes








up vote
14
down vote



accepted










If $G$ is the trivial group, then the condition holds. So suppose $G$ isn't the trivial group.



$G$ acts on itself by conjugation, i.e. we have an action $G times G to G$ where $(g,h) mapsto ghg^{-1}$. Take an element $x in G$. Since any two non-identity elements are conjugate, $mathrm{orb}_G(x) = G backslash {e}$, so $|mathrm{orb}_G(x)| = |G| - 1$. But the orbit-stabiliser theorem tells us that the size of an orbit divides the order of the group. So $|G|-1 $ divides $|G|$. So $|G|$ must be 2.






share|cite|improve this answer























  • To check your understanding: what's $mathrm{stab}_G(x)$ in this case?
    – Jonathan
    Apr 28 '12 at 1:00






  • 1




    $stab_G(x)$ is the set of all elements of $G$ that $gx=x$, that is, $stab_G(x)={gin G | gx=x}$. Right?
    – Marra
    Apr 28 '12 at 1:15










  • I know now why I couldn't have a clue on this before: $x$ and $y$ are conjugate if there is an element $z$ other than $1$ such that $x=zyz^{-1}$. I forgot to exclude the 1!
    – Marra
    Apr 28 '12 at 1:17










  • @GustavoMarra That's the right definition, yes (provided one interprets your notation correctly). $mathrm{stab}_G(x)$ is the set of all elements of $G$ such that $g cdot x = x$ where "$cdot$" denotes the action. So in the case of the conjugation action, this is equivalent to saying $mathrm{stab}_G(x) = { g in G | gxg^{-1} = x }$ where (for lack of a better term) "placement of letters next to each other" corresponds to the group multiplication law. What I mean to ask is "can you list the elements in the stabiliser of $x$ for a particular $x$? (for this particular action)"
    – Jonathan
    Apr 28 '12 at 1:18

















up vote
14
down vote



accepted










If $G$ is the trivial group, then the condition holds. So suppose $G$ isn't the trivial group.



$G$ acts on itself by conjugation, i.e. we have an action $G times G to G$ where $(g,h) mapsto ghg^{-1}$. Take an element $x in G$. Since any two non-identity elements are conjugate, $mathrm{orb}_G(x) = G backslash {e}$, so $|mathrm{orb}_G(x)| = |G| - 1$. But the orbit-stabiliser theorem tells us that the size of an orbit divides the order of the group. So $|G|-1 $ divides $|G|$. So $|G|$ must be 2.






share|cite|improve this answer























  • To check your understanding: what's $mathrm{stab}_G(x)$ in this case?
    – Jonathan
    Apr 28 '12 at 1:00






  • 1




    $stab_G(x)$ is the set of all elements of $G$ that $gx=x$, that is, $stab_G(x)={gin G | gx=x}$. Right?
    – Marra
    Apr 28 '12 at 1:15










  • I know now why I couldn't have a clue on this before: $x$ and $y$ are conjugate if there is an element $z$ other than $1$ such that $x=zyz^{-1}$. I forgot to exclude the 1!
    – Marra
    Apr 28 '12 at 1:17










  • @GustavoMarra That's the right definition, yes (provided one interprets your notation correctly). $mathrm{stab}_G(x)$ is the set of all elements of $G$ such that $g cdot x = x$ where "$cdot$" denotes the action. So in the case of the conjugation action, this is equivalent to saying $mathrm{stab}_G(x) = { g in G | gxg^{-1} = x }$ where (for lack of a better term) "placement of letters next to each other" corresponds to the group multiplication law. What I mean to ask is "can you list the elements in the stabiliser of $x$ for a particular $x$? (for this particular action)"
    – Jonathan
    Apr 28 '12 at 1:18















up vote
14
down vote



accepted







up vote
14
down vote



accepted






If $G$ is the trivial group, then the condition holds. So suppose $G$ isn't the trivial group.



$G$ acts on itself by conjugation, i.e. we have an action $G times G to G$ where $(g,h) mapsto ghg^{-1}$. Take an element $x in G$. Since any two non-identity elements are conjugate, $mathrm{orb}_G(x) = G backslash {e}$, so $|mathrm{orb}_G(x)| = |G| - 1$. But the orbit-stabiliser theorem tells us that the size of an orbit divides the order of the group. So $|G|-1 $ divides $|G|$. So $|G|$ must be 2.






share|cite|improve this answer














If $G$ is the trivial group, then the condition holds. So suppose $G$ isn't the trivial group.



$G$ acts on itself by conjugation, i.e. we have an action $G times G to G$ where $(g,h) mapsto ghg^{-1}$. Take an element $x in G$. Since any two non-identity elements are conjugate, $mathrm{orb}_G(x) = G backslash {e}$, so $|mathrm{orb}_G(x)| = |G| - 1$. But the orbit-stabiliser theorem tells us that the size of an orbit divides the order of the group. So $|G|-1 $ divides $|G|$. So $|G|$ must be 2.







share|cite|improve this answer














share|cite|improve this answer



share|cite|improve this answer








edited Apr 28 '12 at 1:01

























answered Apr 28 '12 at 0:55









Jonathan

5691514




5691514












  • To check your understanding: what's $mathrm{stab}_G(x)$ in this case?
    – Jonathan
    Apr 28 '12 at 1:00






  • 1




    $stab_G(x)$ is the set of all elements of $G$ that $gx=x$, that is, $stab_G(x)={gin G | gx=x}$. Right?
    – Marra
    Apr 28 '12 at 1:15










  • I know now why I couldn't have a clue on this before: $x$ and $y$ are conjugate if there is an element $z$ other than $1$ such that $x=zyz^{-1}$. I forgot to exclude the 1!
    – Marra
    Apr 28 '12 at 1:17










  • @GustavoMarra That's the right definition, yes (provided one interprets your notation correctly). $mathrm{stab}_G(x)$ is the set of all elements of $G$ such that $g cdot x = x$ where "$cdot$" denotes the action. So in the case of the conjugation action, this is equivalent to saying $mathrm{stab}_G(x) = { g in G | gxg^{-1} = x }$ where (for lack of a better term) "placement of letters next to each other" corresponds to the group multiplication law. What I mean to ask is "can you list the elements in the stabiliser of $x$ for a particular $x$? (for this particular action)"
    – Jonathan
    Apr 28 '12 at 1:18




















  • To check your understanding: what's $mathrm{stab}_G(x)$ in this case?
    – Jonathan
    Apr 28 '12 at 1:00






  • 1




    $stab_G(x)$ is the set of all elements of $G$ that $gx=x$, that is, $stab_G(x)={gin G | gx=x}$. Right?
    – Marra
    Apr 28 '12 at 1:15










  • I know now why I couldn't have a clue on this before: $x$ and $y$ are conjugate if there is an element $z$ other than $1$ such that $x=zyz^{-1}$. I forgot to exclude the 1!
    – Marra
    Apr 28 '12 at 1:17










  • @GustavoMarra That's the right definition, yes (provided one interprets your notation correctly). $mathrm{stab}_G(x)$ is the set of all elements of $G$ such that $g cdot x = x$ where "$cdot$" denotes the action. So in the case of the conjugation action, this is equivalent to saying $mathrm{stab}_G(x) = { g in G | gxg^{-1} = x }$ where (for lack of a better term) "placement of letters next to each other" corresponds to the group multiplication law. What I mean to ask is "can you list the elements in the stabiliser of $x$ for a particular $x$? (for this particular action)"
    – Jonathan
    Apr 28 '12 at 1:18


















To check your understanding: what's $mathrm{stab}_G(x)$ in this case?
– Jonathan
Apr 28 '12 at 1:00




To check your understanding: what's $mathrm{stab}_G(x)$ in this case?
– Jonathan
Apr 28 '12 at 1:00




1




1




$stab_G(x)$ is the set of all elements of $G$ that $gx=x$, that is, $stab_G(x)={gin G | gx=x}$. Right?
– Marra
Apr 28 '12 at 1:15




$stab_G(x)$ is the set of all elements of $G$ that $gx=x$, that is, $stab_G(x)={gin G | gx=x}$. Right?
– Marra
Apr 28 '12 at 1:15












I know now why I couldn't have a clue on this before: $x$ and $y$ are conjugate if there is an element $z$ other than $1$ such that $x=zyz^{-1}$. I forgot to exclude the 1!
– Marra
Apr 28 '12 at 1:17




I know now why I couldn't have a clue on this before: $x$ and $y$ are conjugate if there is an element $z$ other than $1$ such that $x=zyz^{-1}$. I forgot to exclude the 1!
– Marra
Apr 28 '12 at 1:17












@GustavoMarra That's the right definition, yes (provided one interprets your notation correctly). $mathrm{stab}_G(x)$ is the set of all elements of $G$ such that $g cdot x = x$ where "$cdot$" denotes the action. So in the case of the conjugation action, this is equivalent to saying $mathrm{stab}_G(x) = { g in G | gxg^{-1} = x }$ where (for lack of a better term) "placement of letters next to each other" corresponds to the group multiplication law. What I mean to ask is "can you list the elements in the stabiliser of $x$ for a particular $x$? (for this particular action)"
– Jonathan
Apr 28 '12 at 1:18






@GustavoMarra That's the right definition, yes (provided one interprets your notation correctly). $mathrm{stab}_G(x)$ is the set of all elements of $G$ such that $g cdot x = x$ where "$cdot$" denotes the action. So in the case of the conjugation action, this is equivalent to saying $mathrm{stab}_G(x) = { g in G | gxg^{-1} = x }$ where (for lack of a better term) "placement of letters next to each other" corresponds to the group multiplication law. What I mean to ask is "can you list the elements in the stabiliser of $x$ for a particular $x$? (for this particular action)"
– Jonathan
Apr 28 '12 at 1:18












up vote
2
down vote













Here's another proof, not quite as elegant, but with a different flavor that I feel is also worth seeing. In this proof I use a few of the theorems you may have seen in the "group actions" section of the book:



Since conjugate elements have the same order, all nonidentity elements have the same order. Thus only one prime number, $p$, divides the order of the group, since for every prime dividing $|G|$ we have an element whose order is that prime (This follows from Cauchy's Theorem and the Sylow Theorems, which I expect you'll encounter soon). But we know $p$-groups have nontrivial centers (by the class equation, one of the most important elementary results using group actions), and elements of the center are their own conjugacy classes. Since the order of the center is at least $p$ and the center has at most one nonidentity element, $p=2$, and $|Z(G)|=2$. If $|G|$ is 4 or more, then we have elements not in the center, which cannot be conjugate to elements of the center. Thus $|G|=2$.






share|cite|improve this answer























  • This is fine, but it uses Sylow's theorems... and I'm supposed to solve that without them.
    – Marra
    Apr 28 '12 at 1:28






  • 1




    Yeah, Jonathan's solution is nicer anyhow, but I figured it would be useful to see a proof that makes good use of the some of the bigger theorems you find in a first course on group theory.
    – Brett Frankel
    Apr 28 '12 at 1:32















up vote
2
down vote













Here's another proof, not quite as elegant, but with a different flavor that I feel is also worth seeing. In this proof I use a few of the theorems you may have seen in the "group actions" section of the book:



Since conjugate elements have the same order, all nonidentity elements have the same order. Thus only one prime number, $p$, divides the order of the group, since for every prime dividing $|G|$ we have an element whose order is that prime (This follows from Cauchy's Theorem and the Sylow Theorems, which I expect you'll encounter soon). But we know $p$-groups have nontrivial centers (by the class equation, one of the most important elementary results using group actions), and elements of the center are their own conjugacy classes. Since the order of the center is at least $p$ and the center has at most one nonidentity element, $p=2$, and $|Z(G)|=2$. If $|G|$ is 4 or more, then we have elements not in the center, which cannot be conjugate to elements of the center. Thus $|G|=2$.






share|cite|improve this answer























  • This is fine, but it uses Sylow's theorems... and I'm supposed to solve that without them.
    – Marra
    Apr 28 '12 at 1:28






  • 1




    Yeah, Jonathan's solution is nicer anyhow, but I figured it would be useful to see a proof that makes good use of the some of the bigger theorems you find in a first course on group theory.
    – Brett Frankel
    Apr 28 '12 at 1:32













up vote
2
down vote










up vote
2
down vote









Here's another proof, not quite as elegant, but with a different flavor that I feel is also worth seeing. In this proof I use a few of the theorems you may have seen in the "group actions" section of the book:



Since conjugate elements have the same order, all nonidentity elements have the same order. Thus only one prime number, $p$, divides the order of the group, since for every prime dividing $|G|$ we have an element whose order is that prime (This follows from Cauchy's Theorem and the Sylow Theorems, which I expect you'll encounter soon). But we know $p$-groups have nontrivial centers (by the class equation, one of the most important elementary results using group actions), and elements of the center are their own conjugacy classes. Since the order of the center is at least $p$ and the center has at most one nonidentity element, $p=2$, and $|Z(G)|=2$. If $|G|$ is 4 or more, then we have elements not in the center, which cannot be conjugate to elements of the center. Thus $|G|=2$.






share|cite|improve this answer














Here's another proof, not quite as elegant, but with a different flavor that I feel is also worth seeing. In this proof I use a few of the theorems you may have seen in the "group actions" section of the book:



Since conjugate elements have the same order, all nonidentity elements have the same order. Thus only one prime number, $p$, divides the order of the group, since for every prime dividing $|G|$ we have an element whose order is that prime (This follows from Cauchy's Theorem and the Sylow Theorems, which I expect you'll encounter soon). But we know $p$-groups have nontrivial centers (by the class equation, one of the most important elementary results using group actions), and elements of the center are their own conjugacy classes. Since the order of the center is at least $p$ and the center has at most one nonidentity element, $p=2$, and $|Z(G)|=2$. If $|G|$ is 4 or more, then we have elements not in the center, which cannot be conjugate to elements of the center. Thus $|G|=2$.







share|cite|improve this answer














share|cite|improve this answer



share|cite|improve this answer








edited Nov 23 at 20:50

























answered Apr 28 '12 at 1:25









Brett Frankel

8,02611650




8,02611650












  • This is fine, but it uses Sylow's theorems... and I'm supposed to solve that without them.
    – Marra
    Apr 28 '12 at 1:28






  • 1




    Yeah, Jonathan's solution is nicer anyhow, but I figured it would be useful to see a proof that makes good use of the some of the bigger theorems you find in a first course on group theory.
    – Brett Frankel
    Apr 28 '12 at 1:32


















  • This is fine, but it uses Sylow's theorems... and I'm supposed to solve that without them.
    – Marra
    Apr 28 '12 at 1:28






  • 1




    Yeah, Jonathan's solution is nicer anyhow, but I figured it would be useful to see a proof that makes good use of the some of the bigger theorems you find in a first course on group theory.
    – Brett Frankel
    Apr 28 '12 at 1:32
















This is fine, but it uses Sylow's theorems... and I'm supposed to solve that without them.
– Marra
Apr 28 '12 at 1:28




This is fine, but it uses Sylow's theorems... and I'm supposed to solve that without them.
– Marra
Apr 28 '12 at 1:28




1




1




Yeah, Jonathan's solution is nicer anyhow, but I figured it would be useful to see a proof that makes good use of the some of the bigger theorems you find in a first course on group theory.
– Brett Frankel
Apr 28 '12 at 1:32




Yeah, Jonathan's solution is nicer anyhow, but I figured it would be useful to see a proof that makes good use of the some of the bigger theorems you find in a first course on group theory.
– Brett Frankel
Apr 28 '12 at 1:32


















draft saved

draft discarded




















































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.





Some of your past answers have not been well-received, and you're in danger of being blocked from answering.


Please pay close attention to the following guidance:


  • 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.


To learn more, see our tips on writing great answers.




draft saved


draft discarded














StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f137858%2fa-group-where-every-two-elements-different-than-1-are-conjugate-has-order-1-or-2%23new-answer', 'question_page');
}
);

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







Popular posts from this blog

Berounka

Sphinx de Gizeh

Different font size/position of beamer's navigation symbols template's content depending on regular/plain...