Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Catalan's_problem> ?p ?o. }
Showing items 1 to 16 of
16
with 100 items per page.
- Catalan's_problem abstract "In mathematics, Catalan's problem asks the number of ways n + 1 factors can be completely parenthesized by n pairs of parentheses. For example, the following are the 14 ways that 5 factors can be parenthesized: (1 (2 (3 (4 5)))) (1 (2 ((3 4) 5))) (1 ((2 3) (4 5))) (1 ((2 (3 4)) 5)) (1 (((2 3) 4) 5)) ((1 2) (3 (4 5))) ((1 2) ((3 4) 5)) ((1 (2 3)) (4 5)) ((1 (2 (3 4))) 5) ((1 ((2 3) 4)) 5) (((1 2) 3) (4 5)) (((1 2) (3 4)) 5) (((1 (2 3)) 4) 5) ((((1 2) 3) 4) 5)The numbers of ways of performing these pairings are the Catalan numbers.".
- Catalan's_problem wikiPageID "15197375".
- Catalan's_problem wikiPageRevisionID "545101573".
- Catalan's_problem hasPhotoCollection Catalan's_problem.
- Catalan's_problem title "Catalan's Problem".
- Catalan's_problem urlname "CatalansProblem".
- Catalan's_problem subject Category:Enumerative_combinatorics.
- Catalan's_problem comment "In mathematics, Catalan's problem asks the number of ways n + 1 factors can be completely parenthesized by n pairs of parentheses.".
- Catalan's_problem label "Catalan's problem".
- Catalan's_problem label "Problema de Catalan".
- Catalan's_problem sameAs Problema_de_Catalan.
- Catalan's_problem sameAs m.03hlkwy.
- Catalan's_problem sameAs Q4818975.
- Catalan's_problem sameAs Q4818975.
- Catalan's_problem wasDerivedFrom Catalan's_problem?oldid=545101573.
- Catalan's_problem isPrimaryTopicOf Catalan's_problem.