A simple equation with a complicated property












0














Let, $Bbb{P}$ denote the set of all odd prime numbers and $Bbb{N}$ be the set of all natural numbers. Let, $2a,2b$ be two even numbers both greater than $4$.



Define, $A={(p,q)inBbb{P}timesBbb{P}:p+q=2a}$ and $B={(r,s)inBbb{P}timesBbb{P}:r+s=2b}$. Let, $X'={A,B}$



Define, $n:X'to Bbb{N}$ by, $$n(Y)=max_{(x,y)in Y}{x^2+y^2},forall Yin X'={A,B}$$
My claim is, $n(A)=n(B)implies A=B$



I have no proof as well as no counterexample for my claim. If anyone has any idea about how to prove this or have seen any paper on this or it is very trivial to prove or has a counterexample for this claim please give.



Thanks in advance!



P.S.: I am "in danger of being blocked from asking any more".






number-theory elementary-number-theory prime-numbers diophantine-equations







share|cite|improve this question
























  • the notation is a bit unnecessarily complicated and obtuse. The entire three paragraph description can be simplified to, "fix even $a,binmathbb Z^+$ each greater than 4. If the sum of the squares of two primes whose sum is each of $a,b$ are equal, are $a$ and $b$ equal?"
    – YiFan
    Dec 7 at 16:37










  • If you have such kinds of conjectures you should write a program that tests this for a lot of numbers. Testing for all n<1000 should not be a problem.
    – miracle173
    Dec 7 at 17:38








  • 1




    can you give an example of your claim?
    – miracle173
    Dec 7 at 18:05










  • @YiFan Thank you for your kind response. But the statement you made in the comment is a bit wrong. Take $a=31b=7$ and $p=29,q=13$ then $p^2+q^2=a^2+b^2=1010$ but $pne a,qne b$. That's why I take the maximum of them.
    – Sujit Bhattacharyya
    Dec 8 at 2:31










  • @miracle173 I am having same trouble with the examples. Assuming $n(A)=n(B)implies max{a^2+b^2}=max{p^2+q^2}implies a^2+b^2=p^2+q^2$ for some $(a,b)in A,(p,q)in B$ where the maximum attained. From here if I am able to show that $a=p,b=q$ then we are done. But still no proof is found.
    – Sujit Bhattacharyya
    Dec 8 at 2:41
















0














Let, $Bbb{P}$ denote the set of all odd prime numbers and $Bbb{N}$ be the set of all natural numbers. Let, $2a,2b$ be two even numbers both greater than $4$.



Define, $A={(p,q)inBbb{P}timesBbb{P}:p+q=2a}$ and $B={(r,s)inBbb{P}timesBbb{P}:r+s=2b}$. Let, $X'={A,B}$



Define, $n:X'to Bbb{N}$ by, $$n(Y)=max_{(x,y)in Y}{x^2+y^2},forall Yin X'={A,B}$$
My claim is, $n(A)=n(B)implies A=B$



I have no proof as well as no counterexample for my claim. If anyone has any idea about how to prove this or have seen any paper on this or it is very trivial to prove or has a counterexample for this claim please give.



Thanks in advance!



P.S.: I am "in danger of being blocked from asking any more".






number-theory elementary-number-theory prime-numbers diophantine-equations







share|cite|improve this question
























  • the notation is a bit unnecessarily complicated and obtuse. The entire three paragraph description can be simplified to, "fix even $a,binmathbb Z^+$ each greater than 4. If the sum of the squares of two primes whose sum is each of $a,b$ are equal, are $a$ and $b$ equal?"
    – YiFan
    Dec 7 at 16:37










  • If you have such kinds of conjectures you should write a program that tests this for a lot of numbers. Testing for all n<1000 should not be a problem.
    – miracle173
    Dec 7 at 17:38








  • 1




    can you give an example of your claim?
    – miracle173
    Dec 7 at 18:05










  • @YiFan Thank you for your kind response. But the statement you made in the comment is a bit wrong. Take $a=31b=7$ and $p=29,q=13$ then $p^2+q^2=a^2+b^2=1010$ but $pne a,qne b$. That's why I take the maximum of them.
    – Sujit Bhattacharyya
    Dec 8 at 2:31










  • @miracle173 I am having same trouble with the examples. Assuming $n(A)=n(B)implies max{a^2+b^2}=max{p^2+q^2}implies a^2+b^2=p^2+q^2$ for some $(a,b)in A,(p,q)in B$ where the maximum attained. From here if I am able to show that $a=p,b=q$ then we are done. But still no proof is found.
    – Sujit Bhattacharyya
    Dec 8 at 2:41














0












0








0







Let, $Bbb{P}$ denote the set of all odd prime numbers and $Bbb{N}$ be the set of all natural numbers. Let, $2a,2b$ be two even numbers both greater than $4$.



Define, $A={(p,q)inBbb{P}timesBbb{P}:p+q=2a}$ and $B={(r,s)inBbb{P}timesBbb{P}:r+s=2b}$. Let, $X'={A,B}$



Define, $n:X'to Bbb{N}$ by, $$n(Y)=max_{(x,y)in Y}{x^2+y^2},forall Yin X'={A,B}$$
My claim is, $n(A)=n(B)implies A=B$



I have no proof as well as no counterexample for my claim. If anyone has any idea about how to prove this or have seen any paper on this or it is very trivial to prove or has a counterexample for this claim please give.



Thanks in advance!



P.S.: I am "in danger of being blocked from asking any more".






number-theory elementary-number-theory prime-numbers diophantine-equations







share|cite|improve this question















Let, $Bbb{P}$ denote the set of all odd prime numbers and $Bbb{N}$ be the set of all natural numbers. Let, $2a,2b$ be two even numbers both greater than $4$.



Define, $A={(p,q)inBbb{P}timesBbb{P}:p+q=2a}$ and $B={(r,s)inBbb{P}timesBbb{P}:r+s=2b}$. Let, $X'={A,B}$



Define, $n:X'to Bbb{N}$ by, $$n(Y)=max_{(x,y)in Y}{x^2+y^2},forall Yin X'={A,B}$$
My claim is, $n(A)=n(B)implies A=B$



I have no proof as well as no counterexample for my claim. If anyone has any idea about how to prove this or have seen any paper on this or it is very trivial to prove or has a counterexample for this claim please give.



Thanks in advance!



P.S.: I am "in danger of being blocked from asking any more".






number-theory elementary-number-theory prime-numbers diophantine-equations




number-theory elementary-number-theory prime-numbers diophantine-equations






share|cite|improve this question















share|cite|improve this question













share|cite|improve this question




share|cite|improve this question








edited Dec 7 at 15:44









Asaf Karagila♦

301k32423755




301k32423755










asked Dec 7 at 15:32









Sujit Bhattacharyya

945317




945317












  • the notation is a bit unnecessarily complicated and obtuse. The entire three paragraph description can be simplified to, "fix even $a,binmathbb Z^+$ each greater than 4. If the sum of the squares of two primes whose sum is each of $a,b$ are equal, are $a$ and $b$ equal?"
    – YiFan
    Dec 7 at 16:37










  • If you have such kinds of conjectures you should write a program that tests this for a lot of numbers. Testing for all n<1000 should not be a problem.
    – miracle173
    Dec 7 at 17:38








  • 1




    can you give an example of your claim?
    – miracle173
    Dec 7 at 18:05










  • @YiFan Thank you for your kind response. But the statement you made in the comment is a bit wrong. Take $a=31b=7$ and $p=29,q=13$ then $p^2+q^2=a^2+b^2=1010$ but $pne a,qne b$. That's why I take the maximum of them.
    – Sujit Bhattacharyya
    Dec 8 at 2:31










  • @miracle173 I am having same trouble with the examples. Assuming $n(A)=n(B)implies max{a^2+b^2}=max{p^2+q^2}implies a^2+b^2=p^2+q^2$ for some $(a,b)in A,(p,q)in B$ where the maximum attained. From here if I am able to show that $a=p,b=q$ then we are done. But still no proof is found.
    – Sujit Bhattacharyya
    Dec 8 at 2:41


















  • the notation is a bit unnecessarily complicated and obtuse. The entire three paragraph description can be simplified to, "fix even $a,binmathbb Z^+$ each greater than 4. If the sum of the squares of two primes whose sum is each of $a,b$ are equal, are $a$ and $b$ equal?"
    – YiFan
    Dec 7 at 16:37










  • If you have such kinds of conjectures you should write a program that tests this for a lot of numbers. Testing for all n<1000 should not be a problem.
    – miracle173
    Dec 7 at 17:38








  • 1




    can you give an example of your claim?
    – miracle173
    Dec 7 at 18:05










  • @YiFan Thank you for your kind response. But the statement you made in the comment is a bit wrong. Take $a=31b=7$ and $p=29,q=13$ then $p^2+q^2=a^2+b^2=1010$ but $pne a,qne b$. That's why I take the maximum of them.
    – Sujit Bhattacharyya
    Dec 8 at 2:31










  • @miracle173 I am having same trouble with the examples. Assuming $n(A)=n(B)implies max{a^2+b^2}=max{p^2+q^2}implies a^2+b^2=p^2+q^2$ for some $(a,b)in A,(p,q)in B$ where the maximum attained. From here if I am able to show that $a=p,b=q$ then we are done. But still no proof is found.
    – Sujit Bhattacharyya
    Dec 8 at 2:41
















the notation is a bit unnecessarily complicated and obtuse. The entire three paragraph description can be simplified to, "fix even $a,binmathbb Z^+$ each greater than 4. If the sum of the squares of two primes whose sum is each of $a,b$ are equal, are $a$ and $b$ equal?"
– YiFan
Dec 7 at 16:37




the notation is a bit unnecessarily complicated and obtuse. The entire three paragraph description can be simplified to, "fix even $a,binmathbb Z^+$ each greater than 4. If the sum of the squares of two primes whose sum is each of $a,b$ are equal, are $a$ and $b$ equal?"
– YiFan
Dec 7 at 16:37












If you have such kinds of conjectures you should write a program that tests this for a lot of numbers. Testing for all n<1000 should not be a problem.
– miracle173
Dec 7 at 17:38






If you have such kinds of conjectures you should write a program that tests this for a lot of numbers. Testing for all n<1000 should not be a problem.
– miracle173
Dec 7 at 17:38






1




1




can you give an example of your claim?
– miracle173
Dec 7 at 18:05




can you give an example of your claim?
– miracle173
Dec 7 at 18:05












@YiFan Thank you for your kind response. But the statement you made in the comment is a bit wrong. Take $a=31b=7$ and $p=29,q=13$ then $p^2+q^2=a^2+b^2=1010$ but $pne a,qne b$. That's why I take the maximum of them.
– Sujit Bhattacharyya
Dec 8 at 2:31




@YiFan Thank you for your kind response. But the statement you made in the comment is a bit wrong. Take $a=31b=7$ and $p=29,q=13$ then $p^2+q^2=a^2+b^2=1010$ but $pne a,qne b$. That's why I take the maximum of them.
– Sujit Bhattacharyya
Dec 8 at 2:31












@miracle173 I am having same trouble with the examples. Assuming $n(A)=n(B)implies max{a^2+b^2}=max{p^2+q^2}implies a^2+b^2=p^2+q^2$ for some $(a,b)in A,(p,q)in B$ where the maximum attained. From here if I am able to show that $a=p,b=q$ then we are done. But still no proof is found.
– Sujit Bhattacharyya
Dec 8 at 2:41




@miracle173 I am having same trouble with the examples. Assuming $n(A)=n(B)implies max{a^2+b^2}=max{p^2+q^2}implies a^2+b^2=p^2+q^2$ for some $(a,b)in A,(p,q)in B$ where the maximum attained. From here if I am able to show that $a=p,b=q$ then we are done. But still no proof is found.
– Sujit Bhattacharyya
Dec 8 at 2:41










1 Answer
1






active

oldest

votes


















0














I'm afraid the question is not well defined; or at least, not proven to be well defined. In your definition for the sets $A$ and $B$, you essentially say they are the sets of all pairs of odd primes which sum to $2a$ and $2b$, which are even numbers. The Goldbach Conjecture asserts that every even number ($>4$) can be expressed as the sum of two odd primes, and this unfortunately hasn't been proven. Hence, if the Goldbach Conjecture happens to be false, your sets $A$, $B$ become null sets, and so the question becomes ill-defined and doesn't make sense; indeed, asserting the well-definition of $A$, $B$ would be asserting Goldbach! (This is of course unless you're willing to define $max(x^2+y^2)$ to mean something else in this case, in which case your conjecture comes down to asserting that there is exactly one even positive integer that can't be expressed as a sum of odd primes, an equally tough problem to prove.)






share|cite|improve this answer





















  • If I redefine the functional $n$ as $n(emptyset)=0$ will it be then well defined?
    – Sujit Bhattacharyya
    Dec 8 at 2:38










  • @SujitBhattacharyya the question of whether it's well defined then comes down to asking whether there's only exactly one even number which cannot be expressed as the sum of two primes. The answer is likely "no", though of course it is probably as hard as Goldbach to prove this.
    – YiFan
    Dec 8 at 3:37










  • Thanks for the help. Can I assume that proving/assuming this problem is to be true directly proves Goldbach Conjecture?
    – Sujit Bhattacharyya
    Dec 8 at 5:55










  • @SujitBhattacharyya yes, you're right. If the stated conjecture is true and $A,Bneqemptyset$ in particular, then goldbach is true.
    – YiFan
    Dec 8 at 7:15











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',
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/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%2f3030015%2fa-simple-equation-with-a-complicated-property%23new-answer', 'question_page');
}
);

Post as a guest















Required, but never shown

























1 Answer
1






active

oldest

votes








1 Answer
1






active

oldest

votes









active

oldest

votes






active

oldest

votes









0














I'm afraid the question is not well defined; or at least, not proven to be well defined. In your definition for the sets $A$ and $B$, you essentially say they are the sets of all pairs of odd primes which sum to $2a$ and $2b$, which are even numbers. The Goldbach Conjecture asserts that every even number ($>4$) can be expressed as the sum of two odd primes, and this unfortunately hasn't been proven. Hence, if the Goldbach Conjecture happens to be false, your sets $A$, $B$ become null sets, and so the question becomes ill-defined and doesn't make sense; indeed, asserting the well-definition of $A$, $B$ would be asserting Goldbach! (This is of course unless you're willing to define $max(x^2+y^2)$ to mean something else in this case, in which case your conjecture comes down to asserting that there is exactly one even positive integer that can't be expressed as a sum of odd primes, an equally tough problem to prove.)






share|cite|improve this answer





















  • If I redefine the functional $n$ as $n(emptyset)=0$ will it be then well defined?
    – Sujit Bhattacharyya
    Dec 8 at 2:38










  • @SujitBhattacharyya the question of whether it's well defined then comes down to asking whether there's only exactly one even number which cannot be expressed as the sum of two primes. The answer is likely "no", though of course it is probably as hard as Goldbach to prove this.
    – YiFan
    Dec 8 at 3:37










  • Thanks for the help. Can I assume that proving/assuming this problem is to be true directly proves Goldbach Conjecture?
    – Sujit Bhattacharyya
    Dec 8 at 5:55










  • @SujitBhattacharyya yes, you're right. If the stated conjecture is true and $A,Bneqemptyset$ in particular, then goldbach is true.
    – YiFan
    Dec 8 at 7:15
















0














I'm afraid the question is not well defined; or at least, not proven to be well defined. In your definition for the sets $A$ and $B$, you essentially say they are the sets of all pairs of odd primes which sum to $2a$ and $2b$, which are even numbers. The Goldbach Conjecture asserts that every even number ($>4$) can be expressed as the sum of two odd primes, and this unfortunately hasn't been proven. Hence, if the Goldbach Conjecture happens to be false, your sets $A$, $B$ become null sets, and so the question becomes ill-defined and doesn't make sense; indeed, asserting the well-definition of $A$, $B$ would be asserting Goldbach! (This is of course unless you're willing to define $max(x^2+y^2)$ to mean something else in this case, in which case your conjecture comes down to asserting that there is exactly one even positive integer that can't be expressed as a sum of odd primes, an equally tough problem to prove.)






share|cite|improve this answer





















  • If I redefine the functional $n$ as $n(emptyset)=0$ will it be then well defined?
    – Sujit Bhattacharyya
    Dec 8 at 2:38










  • @SujitBhattacharyya the question of whether it's well defined then comes down to asking whether there's only exactly one even number which cannot be expressed as the sum of two primes. The answer is likely "no", though of course it is probably as hard as Goldbach to prove this.
    – YiFan
    Dec 8 at 3:37










  • Thanks for the help. Can I assume that proving/assuming this problem is to be true directly proves Goldbach Conjecture?
    – Sujit Bhattacharyya
    Dec 8 at 5:55










  • @SujitBhattacharyya yes, you're right. If the stated conjecture is true and $A,Bneqemptyset$ in particular, then goldbach is true.
    – YiFan
    Dec 8 at 7:15














0












0








0






I'm afraid the question is not well defined; or at least, not proven to be well defined. In your definition for the sets $A$ and $B$, you essentially say they are the sets of all pairs of odd primes which sum to $2a$ and $2b$, which are even numbers. The Goldbach Conjecture asserts that every even number ($>4$) can be expressed as the sum of two odd primes, and this unfortunately hasn't been proven. Hence, if the Goldbach Conjecture happens to be false, your sets $A$, $B$ become null sets, and so the question becomes ill-defined and doesn't make sense; indeed, asserting the well-definition of $A$, $B$ would be asserting Goldbach! (This is of course unless you're willing to define $max(x^2+y^2)$ to mean something else in this case, in which case your conjecture comes down to asserting that there is exactly one even positive integer that can't be expressed as a sum of odd primes, an equally tough problem to prove.)






share|cite|improve this answer












I'm afraid the question is not well defined; or at least, not proven to be well defined. In your definition for the sets $A$ and $B$, you essentially say they are the sets of all pairs of odd primes which sum to $2a$ and $2b$, which are even numbers. The Goldbach Conjecture asserts that every even number ($>4$) can be expressed as the sum of two odd primes, and this unfortunately hasn't been proven. Hence, if the Goldbach Conjecture happens to be false, your sets $A$, $B$ become null sets, and so the question becomes ill-defined and doesn't make sense; indeed, asserting the well-definition of $A$, $B$ would be asserting Goldbach! (This is of course unless you're willing to define $max(x^2+y^2)$ to mean something else in this case, in which case your conjecture comes down to asserting that there is exactly one even positive integer that can't be expressed as a sum of odd primes, an equally tough problem to prove.)







share|cite|improve this answer












share|cite|improve this answer



share|cite|improve this answer










answered Dec 7 at 16:48









YiFan

2,3391421




2,3391421












  • If I redefine the functional $n$ as $n(emptyset)=0$ will it be then well defined?
    – Sujit Bhattacharyya
    Dec 8 at 2:38










  • @SujitBhattacharyya the question of whether it's well defined then comes down to asking whether there's only exactly one even number which cannot be expressed as the sum of two primes. The answer is likely "no", though of course it is probably as hard as Goldbach to prove this.
    – YiFan
    Dec 8 at 3:37










  • Thanks for the help. Can I assume that proving/assuming this problem is to be true directly proves Goldbach Conjecture?
    – Sujit Bhattacharyya
    Dec 8 at 5:55










  • @SujitBhattacharyya yes, you're right. If the stated conjecture is true and $A,Bneqemptyset$ in particular, then goldbach is true.
    – YiFan
    Dec 8 at 7:15


















  • If I redefine the functional $n$ as $n(emptyset)=0$ will it be then well defined?
    – Sujit Bhattacharyya
    Dec 8 at 2:38










  • @SujitBhattacharyya the question of whether it's well defined then comes down to asking whether there's only exactly one even number which cannot be expressed as the sum of two primes. The answer is likely "no", though of course it is probably as hard as Goldbach to prove this.
    – YiFan
    Dec 8 at 3:37










  • Thanks for the help. Can I assume that proving/assuming this problem is to be true directly proves Goldbach Conjecture?
    – Sujit Bhattacharyya
    Dec 8 at 5:55










  • @SujitBhattacharyya yes, you're right. If the stated conjecture is true and $A,Bneqemptyset$ in particular, then goldbach is true.
    – YiFan
    Dec 8 at 7:15
















If I redefine the functional $n$ as $n(emptyset)=0$ will it be then well defined?
– Sujit Bhattacharyya
Dec 8 at 2:38




If I redefine the functional $n$ as $n(emptyset)=0$ will it be then well defined?
– Sujit Bhattacharyya
Dec 8 at 2:38












@SujitBhattacharyya the question of whether it's well defined then comes down to asking whether there's only exactly one even number which cannot be expressed as the sum of two primes. The answer is likely "no", though of course it is probably as hard as Goldbach to prove this.
– YiFan
Dec 8 at 3:37




@SujitBhattacharyya the question of whether it's well defined then comes down to asking whether there's only exactly one even number which cannot be expressed as the sum of two primes. The answer is likely "no", though of course it is probably as hard as Goldbach to prove this.
– YiFan
Dec 8 at 3:37












Thanks for the help. Can I assume that proving/assuming this problem is to be true directly proves Goldbach Conjecture?
– Sujit Bhattacharyya
Dec 8 at 5:55




Thanks for the help. Can I assume that proving/assuming this problem is to be true directly proves Goldbach Conjecture?
– Sujit Bhattacharyya
Dec 8 at 5:55












@SujitBhattacharyya yes, you're right. If the stated conjecture is true and $A,Bneqemptyset$ in particular, then goldbach is true.
– YiFan
Dec 8 at 7:15




@SujitBhattacharyya yes, you're right. If the stated conjecture is true and $A,Bneqemptyset$ in particular, then goldbach is true.
– YiFan
Dec 8 at 7:15


















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%2f3030015%2fa-simple-equation-with-a-complicated-property%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

Bressuire

Image
.mw-parser-output .infobox{border:1px solid #aaa;background-color:#f9f9f9;color:black;margin:.5em 0 .5em 1em;padding:.2em;float:right;clear:right;width:22em;text-align:left;font-size:88%;line-height:1.6em}.mw-parser-output .infobox td,.mw-parser-output .infobox th{vertical-align:top;padding:0 .2em}.mw-parser-output .infobox caption{font-size:larger}.mw-parser-output .infobox.bordered{border-collapse:collapse}.mw-parser-output .infobox.bordered td,.mw-parser-output .infobox.bordered th{border:1px solid #aaa}.mw-parser-output .infobox.bordered .borderless td,.mw-parser-output .infobox.bordered .borderless th{border:0}.mw-parser-output .infobox-showbutton .mw-collapsible-text{color:inherit}.mw-parser-output .infobox.bordered .mergedtoprow td,.mw-parser-output .infobox.bordered .mergedtoprow th{border:0;border-top:1px solid #aaa;border-right:1px solid #aaa}.mw-parser-output .infobox.bordered .mergedrow td,.mw-parser-output .infobox.bordered .mergedrow th{border:0;border-right:1px solid ...
Read more

Cabo Verde

Image
  Nota: Cabo-verdiano redireciona para este artigo. Para a língua falada em Cabo Verde, veja crioulo cabo-verdiano. Para outros significados, veja Cabo Verde (desambiguação). Coordenadas: 14° 55' N 23° 31' O Cabo Verde República de Cabo Verde Bandeira Brasão de Armas Lema: Unidade, Trabalho, Progresso Hino nacional: Cântico da Liberdade Gentílico: cabo-verdiano [ 1 ] Capital Praia 14° 55' N 23° 31' O Cidade mais populosa Praia Língua oficial Português Governo República unitária semipresidencialista [ 2 ]  - Presidente Jorge Carlos Fonseca  - Primeiro-ministro Ulisses Correia e Silva História    - Descoberta 1460   - Independência 00 • de Portugal 5 de Julho de 1975   - Multipartidarismo 13 de Janeiro de 1990  Área    - Total 4 033 km² (146.º)  - Água (%) 0,08 População    - Estimativa para 2017 560 899 [ 3 ] hab. (173.º) ...
Read more

Gyllenstierna

Image
.mw-parser-output .infobox{border:1px solid #aaa;background-color:#f9f9f9;color:black;margin:.5em 0 .5em 1em;padding:.2em;float:right;clear:right;width:22em;text-align:left;font-size:88%;line-height:1.6em}.mw-parser-output .infobox td,.mw-parser-output .infobox th{vertical-align:top;padding:0 .2em}.mw-parser-output .infobox caption{font-size:larger}.mw-parser-output .infobox.bordered{border-collapse:collapse}.mw-parser-output .infobox.bordered td,.mw-parser-output .infobox.bordered th{border:1px solid #aaa}.mw-parser-output .infobox.bordered .borderless td,.mw-parser-output .infobox.bordered .borderless th{border:0}.mw-parser-output .infobox-showbutton .mw-collapsible-text{color:inherit}.mw-parser-output .infobox.bordered .mergedtoprow td,.mw-parser-output .infobox.bordered .mergedtoprow th{border:0;border-top:1px solid #aaa;border-right:1px solid #aaa}.mw-parser-output .infobox.bordered .mergedrow td,.mw-parser-output .infobox.bordered .mergedrow th{border:0;border-right:1px solid ...
Read more