| http://dbpedia.org/ontology/abstract
|
In combinatorial mathematics, block walkin … In combinatorial mathematics, block walking is a method useful in thinking about sums of combinations graphically as "walks" on Pascal's triangle. As the name suggests, block walking problems involve counting the number of ways an individual can walk from one corner A of a city block to another corner B of another city block given restrictions on the number of blocks the person may walk, the directions the person may travel, the distance from A to B, et cetera.avel, the distance from A to B, et cetera.
|
| http://dbpedia.org/ontology/wikiPageID
|
3827112
|
| http://dbpedia.org/ontology/wikiPageLength
|
3710
|
| http://dbpedia.org/ontology/wikiPageRevisionID
|
1094369393
|
| http://dbpedia.org/ontology/wikiPageWikiLink
|
http://dbpedia.org/resource/Lattice_path +
, http://dbpedia.org/resource/Combinatorial_proof +
, http://dbpedia.org/resource/Lattice_points +
, http://dbpedia.org/resource/Pascal%27s_triangle +
, http://dbpedia.org/resource/Lattice_%28group%29 +
, http://dbpedia.org/resource/Pascal%27s_Triangle +
, http://dbpedia.org/resource/Category:Combinatorics +
, http://dbpedia.org/resource/Origin_%28mathematics%29 +
, http://dbpedia.org/resource/Combinatorics +
, http://dbpedia.org/resource/Brute_force_method +
|
| http://dbpedia.org/property/wikiPageUsesTemplate
|
http://dbpedia.org/resource/Template:Reflist +
, http://dbpedia.org/resource/Template:Angbr +
, http://dbpedia.org/resource/Template:Mvar +
, http://dbpedia.org/resource/Template:Short_description +
, http://dbpedia.org/resource/Template:Pars +
, http://dbpedia.org/resource/Template:For +
|
| http://purl.org/dc/terms/subject
|
http://dbpedia.org/resource/Category:Combinatorics +
|
| http://purl.org/linguistics/gold/hypernym
|
http://dbpedia.org/resource/Method +
|
| http://www.w3.org/ns/prov#wasDerivedFrom
|
http://en.wikipedia.org/wiki/Block_walking?oldid=1094369393&ns=0 +
|
| http://xmlns.com/foaf/0.1/isPrimaryTopicOf
|
http://en.wikipedia.org/wiki/Block_walking +
|
| owl:sameAs |
http://dbpedia.org/resource/Block_walking +
, http://rdf.freebase.com/ns/m.0b1_cp +
, http://www.wikidata.org/entity/Q4927216 +
, https://global.dbpedia.org/id/4ZZwe +
|
| rdf:type |
http://dbpedia.org/ontology/Software +
|
| rdfs:comment |
In combinatorial mathematics, block walkin … In combinatorial mathematics, block walking is a method useful in thinking about sums of combinations graphically as "walks" on Pascal's triangle. As the name suggests, block walking problems involve counting the number of ways an individual can walk from one corner A of a city block to another corner B of another city block given restrictions on the number of blocks the person may walk, the directions the person may travel, the distance from A to B, et cetera.avel, the distance from A to B, et cetera.
|
| rdfs:label |
Block walking
|
