About: HC Notation   Sponge Permalink

An Entity of Type : owl:Thing, within Data Space : 134.155.108.49:8890 associated with source dataset(s)

HC Notation is a googological notation derived from Orteil's popular online game Cookie Clicker and takes the form \([ a,b ]_{HC}\). After a person resets the game they gain what is called "heavenly chips", the more heavenly chips you gain the more each successive heavenly chip costs. The formula to find how many cookies is takes to obtain with a given number of heavenly chips is as follows: \( ext{Cookies needed (total)}=\frac{HC(HC + 1)}{2}\cdot 10^{12}\) HC takes it a step further by adding different "tier's" of heavenly chips that follow a similar formula The second way is to use this formula:

AttributesValues
rdfs:label
  • HC Notation
rdfs:comment
  • HC Notation is a googological notation derived from Orteil's popular online game Cookie Clicker and takes the form \([ a,b ]_{HC}\). After a person resets the game they gain what is called "heavenly chips", the more heavenly chips you gain the more each successive heavenly chip costs. The formula to find how many cookies is takes to obtain with a given number of heavenly chips is as follows: \( ext{Cookies needed (total)}=\frac{HC(HC + 1)}{2}\cdot 10^{12}\) HC takes it a step further by adding different "tier's" of heavenly chips that follow a similar formula The second way is to use this formula:
dcterms:subject
abstract
  • HC Notation is a googological notation derived from Orteil's popular online game Cookie Clicker and takes the form \([ a,b ]_{HC}\). After a person resets the game they gain what is called "heavenly chips", the more heavenly chips you gain the more each successive heavenly chip costs. The formula to find how many cookies is takes to obtain with a given number of heavenly chips is as follows: \( ext{Cookies needed (total)}=\frac{HC(HC + 1)}{2}\cdot 10^{12}\) HC takes it a step further by adding different "tier's" of heavenly chips that follow a similar formula \( ext{Tier 1 HC (Regular HC)}=\frac{ ext{Tier 2 HC}( ext{Tier 2 HC} +1)}{2}\cdot 10^{12}\) The Notation [a,b]HC is basically saying how many cookies do I need if I want "a" amount of Tier "b" Heavenly Chips One way to solve the bracket is to use the recursive method. For example, if you want to solve \([ 4,3 ]_{HC}\) you first calculate how many Tier 2 chips that would require, then Tier 1, then finally the amount of cookies. The second way is to use this formula: \([ a,b ]_{HC}=\frac{(a^{2}+a)^{2^{b-1}}\cdot(10^{12})^{2^{b}-1}}{2^{2^{b}-1}}\) \([ 4,3 ]_{HC}= ext{ 4 Tier 3 HC}=10^{13} ext{ Tier 2 HC}=5*10^{37} ext{ Tier 1 HC}=1.25*10^{87} ext{ Cookies}\) \([ 4,3 ]_{HC}=\frac{(4^{2}+4)^{2^{3-1}}\cdot(10^{12})^{2^{3}-1}}{2^{2^{3}-1}}=1.25\cdot 10^{87}\)
Alternative Linked Data Views: ODE     Raw Data in: CXML | CSV | RDF ( N-Triples N3/Turtle JSON XML ) | OData ( Atom JSON ) | Microdata ( JSON HTML) | JSON-LD    About   
This material is Open Knowledge   W3C Semantic Web Technology [RDF Data] Valid XHTML + RDFa
OpenLink Virtuoso version 07.20.3217, on Linux (x86_64-pc-linux-gnu), Standard Edition
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2012 OpenLink Software