Number of words that can be made using all the letters of the word W, if Os as well as Is are separated is? The Next CEO of Stack OverflowNumber of rearrangements of the word “INDIVISIBILITY”How many words, with or without meaning, each of 3 vowels and 2 consonants can be formed from the letters of the word INVOLUTE?How many different words can be formed with the letters of 'SKYSCRAPERS' if A and E are together?Forming seven letter words by using the letters of the word $textSUCCESS$Total no. of words formed when similar letters are involvedNumber of ways to arrange $A,A,A,B,C,C$ such that no $2$ consecutive letters are the sameFind the total number of permutations in which letters of the word $ARRANGEMENT$ can be permuted so that two $E$s and two $R$s do not come together.Find the number of ways in which 6 boys and 6 girls can be seated in a row so that all the girls are never together.What is the number of arrangements in the word “EDUCATION” where vowels are never together?Probability that the first 2 letters are consonants when the letters of the word 'equilibrium' are rearranged

How did people program for Consoles with multiple CPUs?

Are there languages with no euphemisms?

Why didn't Theresa May consult with Parliament before negotiating a deal with the EU?

Need some help with wall behind rangetop

Shade part of a Venn diagram

How long to clear the 'suck zone' of a turbofan after start is initiated?

What happens if you roll doubles 3 times then land on "Go to jail?"

Why here is plural "We went to the movies last night."

How to count occurrences of text in a file?

How do I go from 300 unfinished/half written blog posts, to published posts?

How to Reset Passwords on Multiple Websites Easily?

Rotate a column

How can I get through very long and very dry, but also very useful technical documents when learning a new tool?

What is the point of a new vote on May's deal when the indicative votes suggest she will not win?

Why do remote companies require working in the US?

Natural language into sentence logic

How to make a variable always equal to the result of some calculations?

What makes a siege story/plot interesting?

What's the point of interval inversion?

Why does C# sound extremely flat when saxophone is tuned to G?

Why didn't Khan get resurrected in the Genesis Explosion?

Should I tutor a student who I know has cheated on their homework?

Text adventure game code

How do I get the green key off the shelf in the Dobby level of Lego Harry Potter 2?



Number of words that can be made using all the letters of the word W, if Os as well as Is are separated is?



The Next CEO of Stack OverflowNumber of rearrangements of the word “INDIVISIBILITY”How many words, with or without meaning, each of 3 vowels and 2 consonants can be formed from the letters of the word INVOLUTE?How many different words can be formed with the letters of 'SKYSCRAPERS' if A and E are together?Forming seven letter words by using the letters of the word $textSUCCESS$Total no. of words formed when similar letters are involvedNumber of ways to arrange $A,A,A,B,C,C$ such that no $2$ consecutive letters are the sameFind the total number of permutations in which letters of the word $ARRANGEMENT$ can be permuted so that two $E$s and two $R$s do not come together.Find the number of ways in which 6 boys and 6 girls can be seated in a row so that all the girls are never together.What is the number of arrangements in the word “EDUCATION” where vowels are never together?Probability that the first 2 letters are consonants when the letters of the word 'equilibrium' are rearranged










6












$begingroup$


enter image description here



I am facing difficulty in solving the 18th Question from the above passage.



Attempt:



I have attempted it using principal of inclusion and exclusion.



Let n be the required number of ways.



$n = textTotal number of ways - Number of ways in which Os and Is are together$



$implies n = dfrac12!3!2!2! - dfrac11!2!3! - dfrac10!2!2!+ dfrac9!2!2! = 399 times 8!$



This gives $N = 399$ which is wrong. Can you please tell me why am I getting the wrong answer?










share|cite|improve this question









$endgroup$







  • 1




    $begingroup$
    How do you know that your solution is wrong? There is also option (D)
    $endgroup$
    – Robert Z
    21 hours ago










  • $begingroup$
    @RobertZ answer given is option B
    $endgroup$
    – Abcd
    21 hours ago















6












$begingroup$


enter image description here



I am facing difficulty in solving the 18th Question from the above passage.



Attempt:



I have attempted it using principal of inclusion and exclusion.



Let n be the required number of ways.



$n = textTotal number of ways - Number of ways in which Os and Is are together$



$implies n = dfrac12!3!2!2! - dfrac11!2!3! - dfrac10!2!2!+ dfrac9!2!2! = 399 times 8!$



This gives $N = 399$ which is wrong. Can you please tell me why am I getting the wrong answer?










share|cite|improve this question









$endgroup$







  • 1




    $begingroup$
    How do you know that your solution is wrong? There is also option (D)
    $endgroup$
    – Robert Z
    21 hours ago










  • $begingroup$
    @RobertZ answer given is option B
    $endgroup$
    – Abcd
    21 hours ago













6












6








6





$begingroup$


enter image description here



I am facing difficulty in solving the 18th Question from the above passage.



Attempt:



I have attempted it using principal of inclusion and exclusion.



Let n be the required number of ways.



$n = textTotal number of ways - Number of ways in which Os and Is are together$



$implies n = dfrac12!3!2!2! - dfrac11!2!3! - dfrac10!2!2!+ dfrac9!2!2! = 399 times 8!$



This gives $N = 399$ which is wrong. Can you please tell me why am I getting the wrong answer?










share|cite|improve this question









$endgroup$




enter image description here



I am facing difficulty in solving the 18th Question from the above passage.



Attempt:



I have attempted it using principal of inclusion and exclusion.



Let n be the required number of ways.



$n = textTotal number of ways - Number of ways in which Os and Is are together$



$implies n = dfrac12!3!2!2! - dfrac11!2!3! - dfrac10!2!2!+ dfrac9!2!2! = 399 times 8!$



This gives $N = 399$ which is wrong. Can you please tell me why am I getting the wrong answer?







combinatorics permutations combinations






share|cite|improve this question













share|cite|improve this question











share|cite|improve this question




share|cite|improve this question










asked 23 hours ago









AbcdAbcd

3,10931338




3,10931338







  • 1




    $begingroup$
    How do you know that your solution is wrong? There is also option (D)
    $endgroup$
    – Robert Z
    21 hours ago










  • $begingroup$
    @RobertZ answer given is option B
    $endgroup$
    – Abcd
    21 hours ago












  • 1




    $begingroup$
    How do you know that your solution is wrong? There is also option (D)
    $endgroup$
    – Robert Z
    21 hours ago










  • $begingroup$
    @RobertZ answer given is option B
    $endgroup$
    – Abcd
    21 hours ago







1




1




$begingroup$
How do you know that your solution is wrong? There is also option (D)
$endgroup$
– Robert Z
21 hours ago




$begingroup$
How do you know that your solution is wrong? There is also option (D)
$endgroup$
– Robert Z
21 hours ago












$begingroup$
@RobertZ answer given is option B
$endgroup$
– Abcd
21 hours ago




$begingroup$
@RobertZ answer given is option B
$endgroup$
– Abcd
21 hours ago










3 Answers
3






active

oldest

votes


















11












$begingroup$

Your mistake is not noticing that the I's can be non-separated two different ways: We can have all three of them together as III, but we can also have II in one place and I in another.



One way to calculate how many ways this can happen is to think of one pair II as a single letter, and the third I as a separate letter, and count the number of words we can make. This will count each III case twice: Once as I II, and once as II I. So we have to subtract the number of such cases once.



With this correction, the final calculation becomes
$$
overbracefrac12!3!2!2!^textAll words - overbracefrac11!3!2!^textO's not separate - overbraceleft(underbracefrac11!2!2!_textII and I - underbracefrac10!2!2!_textIIIright)^textI's not separate + overbraceleft(underbracefrac10!2!_textOO, II and I - underbracefrac9!2!_textOO and IIIright)^textNeither O's nor I's separate
$$

which turns out to be $8!cdot 228$.






share|cite|improve this answer











$endgroup$












  • $begingroup$
    Thanks for the answer I have understood my mistake, but I am unable to understand the final equation in your answer. Can you label the terms like which term stands for which case?
    $endgroup$
    – Abcd
    21 hours ago











  • $begingroup$
    @Abcd I added a short explanation for what each term represents. The basic structure of your inclusion-exclusion calculation is still there, just with the two last terms corrected to make up for the mistake.
    $endgroup$
    – Arthur
    20 hours ago







  • 1




    $begingroup$
    +1 for the MathJax magic!
    $endgroup$
    – TonyK
    18 hours ago


















3












$begingroup$

The letter $I$ appears three times. You have calculated the number of ways to arrange the letters so that the three copies of $I$ aren't all in the same place (and also the two $O$s are separated). However, "separated" here means that no two of them are together. Your count includes such "words" as STIILOCATINO, which should be excluded.






share|cite|improve this answer









$endgroup$




















    3












    $begingroup$

    How did you get each of the terms of $n$?



    • $frac12!3!2!2!$ : The number of ways of arranging the letters of SOLICITATION.


    • $frac11!2!3!$ : The number of ways in which the two $O$s can be together in SOLICITATION.


    • $frac10!2!2!$ : The number of ways in which the three $I$s can be together in SOLICITATION.


    • $frac9!2!2!$ : The number of ways in which the three $I$s and two $O$s can be together in SOLICITATION.


    Well , the problem is this : the complement of this case, also includes the case where two $I$s can be together and the third can be separate. You have not neglected this case, and that's why you have an answer larger than the given answer.






    share|cite|improve this answer









    $endgroup$













      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%2f3165573%2fnumber-of-words-that-can-be-made-using-all-the-letters-of-the-word-w-if-os-as-w%23new-answer', 'question_page');

      );

      Post as a guest















      Required, but never shown

























      3 Answers
      3






      active

      oldest

      votes








      3 Answers
      3






      active

      oldest

      votes









      active

      oldest

      votes






      active

      oldest

      votes









      11












      $begingroup$

      Your mistake is not noticing that the I's can be non-separated two different ways: We can have all three of them together as III, but we can also have II in one place and I in another.



      One way to calculate how many ways this can happen is to think of one pair II as a single letter, and the third I as a separate letter, and count the number of words we can make. This will count each III case twice: Once as I II, and once as II I. So we have to subtract the number of such cases once.



      With this correction, the final calculation becomes
      $$
      overbracefrac12!3!2!2!^textAll words - overbracefrac11!3!2!^textO's not separate - overbraceleft(underbracefrac11!2!2!_textII and I - underbracefrac10!2!2!_textIIIright)^textI's not separate + overbraceleft(underbracefrac10!2!_textOO, II and I - underbracefrac9!2!_textOO and IIIright)^textNeither O's nor I's separate
      $$

      which turns out to be $8!cdot 228$.






      share|cite|improve this answer











      $endgroup$












      • $begingroup$
        Thanks for the answer I have understood my mistake, but I am unable to understand the final equation in your answer. Can you label the terms like which term stands for which case?
        $endgroup$
        – Abcd
        21 hours ago











      • $begingroup$
        @Abcd I added a short explanation for what each term represents. The basic structure of your inclusion-exclusion calculation is still there, just with the two last terms corrected to make up for the mistake.
        $endgroup$
        – Arthur
        20 hours ago







      • 1




        $begingroup$
        +1 for the MathJax magic!
        $endgroup$
        – TonyK
        18 hours ago















      11












      $begingroup$

      Your mistake is not noticing that the I's can be non-separated two different ways: We can have all three of them together as III, but we can also have II in one place and I in another.



      One way to calculate how many ways this can happen is to think of one pair II as a single letter, and the third I as a separate letter, and count the number of words we can make. This will count each III case twice: Once as I II, and once as II I. So we have to subtract the number of such cases once.



      With this correction, the final calculation becomes
      $$
      overbracefrac12!3!2!2!^textAll words - overbracefrac11!3!2!^textO's not separate - overbraceleft(underbracefrac11!2!2!_textII and I - underbracefrac10!2!2!_textIIIright)^textI's not separate + overbraceleft(underbracefrac10!2!_textOO, II and I - underbracefrac9!2!_textOO and IIIright)^textNeither O's nor I's separate
      $$

      which turns out to be $8!cdot 228$.






      share|cite|improve this answer











      $endgroup$












      • $begingroup$
        Thanks for the answer I have understood my mistake, but I am unable to understand the final equation in your answer. Can you label the terms like which term stands for which case?
        $endgroup$
        – Abcd
        21 hours ago











      • $begingroup$
        @Abcd I added a short explanation for what each term represents. The basic structure of your inclusion-exclusion calculation is still there, just with the two last terms corrected to make up for the mistake.
        $endgroup$
        – Arthur
        20 hours ago







      • 1




        $begingroup$
        +1 for the MathJax magic!
        $endgroup$
        – TonyK
        18 hours ago













      11












      11








      11





      $begingroup$

      Your mistake is not noticing that the I's can be non-separated two different ways: We can have all three of them together as III, but we can also have II in one place and I in another.



      One way to calculate how many ways this can happen is to think of one pair II as a single letter, and the third I as a separate letter, and count the number of words we can make. This will count each III case twice: Once as I II, and once as II I. So we have to subtract the number of such cases once.



      With this correction, the final calculation becomes
      $$
      overbracefrac12!3!2!2!^textAll words - overbracefrac11!3!2!^textO's not separate - overbraceleft(underbracefrac11!2!2!_textII and I - underbracefrac10!2!2!_textIIIright)^textI's not separate + overbraceleft(underbracefrac10!2!_textOO, II and I - underbracefrac9!2!_textOO and IIIright)^textNeither O's nor I's separate
      $$

      which turns out to be $8!cdot 228$.






      share|cite|improve this answer











      $endgroup$



      Your mistake is not noticing that the I's can be non-separated two different ways: We can have all three of them together as III, but we can also have II in one place and I in another.



      One way to calculate how many ways this can happen is to think of one pair II as a single letter, and the third I as a separate letter, and count the number of words we can make. This will count each III case twice: Once as I II, and once as II I. So we have to subtract the number of such cases once.



      With this correction, the final calculation becomes
      $$
      overbracefrac12!3!2!2!^textAll words - overbracefrac11!3!2!^textO's not separate - overbraceleft(underbracefrac11!2!2!_textII and I - underbracefrac10!2!2!_textIIIright)^textI's not separate + overbraceleft(underbracefrac10!2!_textOO, II and I - underbracefrac9!2!_textOO and IIIright)^textNeither O's nor I's separate
      $$

      which turns out to be $8!cdot 228$.







      share|cite|improve this answer














      share|cite|improve this answer



      share|cite|improve this answer








      edited 20 hours ago

























      answered 21 hours ago









      ArthurArthur

      120k7121206




      120k7121206











      • $begingroup$
        Thanks for the answer I have understood my mistake, but I am unable to understand the final equation in your answer. Can you label the terms like which term stands for which case?
        $endgroup$
        – Abcd
        21 hours ago











      • $begingroup$
        @Abcd I added a short explanation for what each term represents. The basic structure of your inclusion-exclusion calculation is still there, just with the two last terms corrected to make up for the mistake.
        $endgroup$
        – Arthur
        20 hours ago







      • 1




        $begingroup$
        +1 for the MathJax magic!
        $endgroup$
        – TonyK
        18 hours ago
















      • $begingroup$
        Thanks for the answer I have understood my mistake, but I am unable to understand the final equation in your answer. Can you label the terms like which term stands for which case?
        $endgroup$
        – Abcd
        21 hours ago











      • $begingroup$
        @Abcd I added a short explanation for what each term represents. The basic structure of your inclusion-exclusion calculation is still there, just with the two last terms corrected to make up for the mistake.
        $endgroup$
        – Arthur
        20 hours ago







      • 1




        $begingroup$
        +1 for the MathJax magic!
        $endgroup$
        – TonyK
        18 hours ago















      $begingroup$
      Thanks for the answer I have understood my mistake, but I am unable to understand the final equation in your answer. Can you label the terms like which term stands for which case?
      $endgroup$
      – Abcd
      21 hours ago





      $begingroup$
      Thanks for the answer I have understood my mistake, but I am unable to understand the final equation in your answer. Can you label the terms like which term stands for which case?
      $endgroup$
      – Abcd
      21 hours ago













      $begingroup$
      @Abcd I added a short explanation for what each term represents. The basic structure of your inclusion-exclusion calculation is still there, just with the two last terms corrected to make up for the mistake.
      $endgroup$
      – Arthur
      20 hours ago





      $begingroup$
      @Abcd I added a short explanation for what each term represents. The basic structure of your inclusion-exclusion calculation is still there, just with the two last terms corrected to make up for the mistake.
      $endgroup$
      – Arthur
      20 hours ago





      1




      1




      $begingroup$
      +1 for the MathJax magic!
      $endgroup$
      – TonyK
      18 hours ago




      $begingroup$
      +1 for the MathJax magic!
      $endgroup$
      – TonyK
      18 hours ago











      3












      $begingroup$

      The letter $I$ appears three times. You have calculated the number of ways to arrange the letters so that the three copies of $I$ aren't all in the same place (and also the two $O$s are separated). However, "separated" here means that no two of them are together. Your count includes such "words" as STIILOCATINO, which should be excluded.






      share|cite|improve this answer









      $endgroup$

















        3












        $begingroup$

        The letter $I$ appears three times. You have calculated the number of ways to arrange the letters so that the three copies of $I$ aren't all in the same place (and also the two $O$s are separated). However, "separated" here means that no two of them are together. Your count includes such "words" as STIILOCATINO, which should be excluded.






        share|cite|improve this answer









        $endgroup$















          3












          3








          3





          $begingroup$

          The letter $I$ appears three times. You have calculated the number of ways to arrange the letters so that the three copies of $I$ aren't all in the same place (and also the two $O$s are separated). However, "separated" here means that no two of them are together. Your count includes such "words" as STIILOCATINO, which should be excluded.






          share|cite|improve this answer









          $endgroup$



          The letter $I$ appears three times. You have calculated the number of ways to arrange the letters so that the three copies of $I$ aren't all in the same place (and also the two $O$s are separated). However, "separated" here means that no two of them are together. Your count includes such "words" as STIILOCATINO, which should be excluded.







          share|cite|improve this answer












          share|cite|improve this answer



          share|cite|improve this answer










          answered 21 hours ago









          jmerryjmerry

          16.8k11633




          16.8k11633





















              3












              $begingroup$

              How did you get each of the terms of $n$?



              • $frac12!3!2!2!$ : The number of ways of arranging the letters of SOLICITATION.


              • $frac11!2!3!$ : The number of ways in which the two $O$s can be together in SOLICITATION.


              • $frac10!2!2!$ : The number of ways in which the three $I$s can be together in SOLICITATION.


              • $frac9!2!2!$ : The number of ways in which the three $I$s and two $O$s can be together in SOLICITATION.


              Well , the problem is this : the complement of this case, also includes the case where two $I$s can be together and the third can be separate. You have not neglected this case, and that's why you have an answer larger than the given answer.






              share|cite|improve this answer









              $endgroup$

















                3












                $begingroup$

                How did you get each of the terms of $n$?



                • $frac12!3!2!2!$ : The number of ways of arranging the letters of SOLICITATION.


                • $frac11!2!3!$ : The number of ways in which the two $O$s can be together in SOLICITATION.


                • $frac10!2!2!$ : The number of ways in which the three $I$s can be together in SOLICITATION.


                • $frac9!2!2!$ : The number of ways in which the three $I$s and two $O$s can be together in SOLICITATION.


                Well , the problem is this : the complement of this case, also includes the case where two $I$s can be together and the third can be separate. You have not neglected this case, and that's why you have an answer larger than the given answer.






                share|cite|improve this answer









                $endgroup$















                  3












                  3








                  3





                  $begingroup$

                  How did you get each of the terms of $n$?



                  • $frac12!3!2!2!$ : The number of ways of arranging the letters of SOLICITATION.


                  • $frac11!2!3!$ : The number of ways in which the two $O$s can be together in SOLICITATION.


                  • $frac10!2!2!$ : The number of ways in which the three $I$s can be together in SOLICITATION.


                  • $frac9!2!2!$ : The number of ways in which the three $I$s and two $O$s can be together in SOLICITATION.


                  Well , the problem is this : the complement of this case, also includes the case where two $I$s can be together and the third can be separate. You have not neglected this case, and that's why you have an answer larger than the given answer.






                  share|cite|improve this answer









                  $endgroup$



                  How did you get each of the terms of $n$?



                  • $frac12!3!2!2!$ : The number of ways of arranging the letters of SOLICITATION.


                  • $frac11!2!3!$ : The number of ways in which the two $O$s can be together in SOLICITATION.


                  • $frac10!2!2!$ : The number of ways in which the three $I$s can be together in SOLICITATION.


                  • $frac9!2!2!$ : The number of ways in which the three $I$s and two $O$s can be together in SOLICITATION.


                  Well , the problem is this : the complement of this case, also includes the case where two $I$s can be together and the third can be separate. You have not neglected this case, and that's why you have an answer larger than the given answer.







                  share|cite|improve this answer












                  share|cite|improve this answer



                  share|cite|improve this answer










                  answered 21 hours ago









                  астон вілла олоф мэллбэргастон вілла олоф мэллбэрг

                  40k33477




                  40k33477



























                      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.




                      draft saved


                      draft discarded














                      StackExchange.ready(
                      function ()
                      StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3165573%2fnumber-of-words-that-can-be-made-using-all-the-letters-of-the-word-w-if-os-as-w%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

                      Wikipedia:Vital articles Мазмуну Biography - Өмүр баян Philosophy and psychology - Философия жана психология Religion - Дин Social sciences - Коомдук илимдер Language and literature - Тил жана адабият Science - Илим Technology - Технология Arts and recreation - Искусство жана эс алуу History and geography - Тарых жана география Навигация менюсу

                      Club Baloncesto Breogán Índice Historia | Pavillón | Nome | O Breogán na cultura popular | Xogadores | Adestradores | Presidentes | Palmarés | Historial | Líderes | Notas | Véxase tamén | Menú de navegacióncbbreogan.galCadroGuía oficial da ACB 2009-10, páxina 201Guía oficial ACB 1992, páxina 183. Editorial DB.É de 6.500 espectadores sentados axeitándose á última normativa"Estudiantes Junior, entre as mellores canteiras"o orixinalHemeroteca El Mundo Deportivo, 16 setembro de 1970, páxina 12Historia do BreogánAlfredo Pérez, o último canoneiroHistoria C.B. BreogánHemeroteca de El Mundo DeportivoJimmy Wright, norteamericano do Breogán deixará Lugo por ameazas de morteResultados de Breogán en 1986-87Resultados de Breogán en 1990-91Ficha de Velimir Perasović en acb.comResultados de Breogán en 1994-95Breogán arrasa al Barça. "El Mundo Deportivo", 27 de setembro de 1999, páxina 58CB Breogán - FC BarcelonaA FEB invita a participar nunha nova Liga EuropeaCharlie Bell na prensa estatalMáximos anotadores 2005Tempada 2005-06 : Tódolos Xogadores da Xornada""Non quero pensar nunha man negra, mais pregúntome que está a pasar""o orixinalRaúl López, orgulloso dos xogadores, presume da boa saúde económica do BreogánJulio González confirma que cesa como presidente del BreogánHomenaxe a Lisardo GómezA tempada do rexurdimento celesteEntrevista a Lisardo GómezEl COB dinamita el Pazo para forzar el quinto (69-73)Cafés Candelas, patrocinador del CB Breogán"Suso Lázare, novo presidente do Breogán"o orixinalCafés Candelas Breogán firma el mayor triunfo de la historiaEl Breogán realizará 17 homenajes por su cincuenta aniversario"O Breogán honra ao seu fundador e primeiro presidente"o orixinalMiguel Giao recibiu a homenaxe do PazoHomenaxe aos primeiros gladiadores celestesO home que nos amosa como ver o Breo co corazónTita Franco será homenaxeada polos #50anosdeBreoJulio Vila recibirá unha homenaxe in memoriam polos #50anosdeBreo"O Breogán homenaxeará aos seus aboados máis veteráns"Pechada ovación a «Capi» Sanmartín e Ricardo «Corazón de González»Homenaxe por décadas de informaciónPaco García volve ao Pazo con motivo do 50 aniversario"Resultados y clasificaciones""O Cafés Candelas Breogán, campión da Copa Princesa""O Cafés Candelas Breogán, equipo ACB"C.B. Breogán"Proxecto social"o orixinal"Centros asociados"o orixinalFicha en imdb.comMario Camus trata la recuperación del amor en 'La vieja música', su última película"Páxina web oficial""Club Baloncesto Breogán""C. B. Breogán S.A.D."eehttp://www.fegaba.com

                      Vilaño, A Laracha Índice Patrimonio | Lugares e parroquias | Véxase tamén | Menú de navegación43°14′52″N 8°36′03″O / 43.24775, -8.60070