probaberry 0.0.0

checksums.yaml

@@ -0,0 +1,7 @@
+---
+SHA1:
+  metadata.gz: e4594b8946190094cd9746d9c9d881ce7a188c21
+  data.tar.gz: 3e369243b46a846e6ce6c66d99d32ef9baf8b5ae
+SHA512:
+  metadata.gz: 3e13ffb2ffeb2c1e25887622ee73922a47923425e7f42810147d65bb9d125089e595b8f2590f5886751b92e6324fa29823a8ccac632b398079b0144c03488c18
+  data.tar.gz: 38a557425a87ea96124cadef636de696fe027b5ffc7ab3050e584b9b34ded4b511297f65c71bf31e2fde577e43fd6a15c0f2bf5aef8559b591303db479d4c432

data/lib/probaberry/counting.rb

@@ -0,0 +1,30 @@
+class Integer
+  def !
+    if self > 0
+      (1..self).reduce :*
+    elsif self.zero?
+      1
+    else
+      raise ArgumentError, "No factorial for #{self}"
+    end
+  end
+ 
+  alias :"!@" :!
+  alias :fact :!
+ 
+  def choose r
+    raise ArgumentError, "r = #{r} is outside 0..#{self}" if r < 0 or r > self
+    (self.!).fdiv((self - r).!).fdiv(r.!).to_i
+  end
+ 
+end
+ 
+def ncr n, r
+  raise ArgumentError, "r = #{r} is outside 0..#{n}" if r < 0 or r > n
+  n.choose r
+end
+ 
+def npr n, r
+  raise ArgumentError, "r = #{r} is outside 0..#{n}" if r < 0 or r > n
+  n.!.fdiv((n - r).!).to_i
+end

data/lib/probaberry/discrete.rb

@@ -0,0 +1,92 @@
+module Cumulative
+  def < x
+    m = (0...x).map{|i| self == i}.reduce(0, :+)
+  end
+  def <= x
+    (self == x ) + (self < x)
+  end
+  def > x
+    1 - (self <= x)
+  end
+  def >= x
+    1 - (self < x)
+  end
+  def inbetween? x, y
+    (self <= y) - (self < x)
+  end
+  def exbetween?
+    (self < y) - (self < x - 1)
+  end
+end
+
+class Binomial
+  include Cumulative
+  attr_accessor :n, :p
+  def initialize n, p
+    @n = n
+    @p = p
+  end
+  def == x
+    n.choose(x) * p ** x * (1 - p) ** (n - x)
+  end
+end
+
+class Poisson
+  include Cumulative
+  attr_accessor :la
+  def initialize la
+    @la = la
+  end
+  def == x
+    Math::exp(-la) * la ** x / x.!
+  end
+end
+
+class NegativeBinomial
+  include Cumulative
+  attr_accessor :n, :p
+  def initialize n, p
+    @n = n
+    @p = p
+  end
+  def == x
+    ncr.choose(x - 1, n - 1) * p ** n * (1 - p) ** (x - n)
+  end
+end
+
+class Geometric
+  attr_accessor :p
+  def initialize p
+    @p = p
+  end
+  def == x
+    p * (1 - p) ** (x - 1)
+  end
+  def > x
+    # tail lemma!
+    (1 - p) ** x
+  end
+  def >= x
+    (self == x) + (self > x)
+  end
+  def < x
+    1 - (self >= x)
+  end
+  def <= x
+    1 - (self > x)
+  end
+end
+
+class Hypergeometric
+  include Cumulative
+  attr_accessor :n, :s, :p
+  def initialize
+    @n = n
+    @s = s
+    @p = p
+  end
+  def == x
+    (ncr(n * p, x) * ncr(n * (1 - p), (s - x))).fdiv ncr(n, s)
+  end
+
+end

data/lib/probaberry/nice.rb

@@ -0,0 +1,7 @@
+def nice n, p=3
+  return n unless n.kind_of? Numeric
+  i = n.to_i
+  f = ((n - i).round(p).to_s)[2..-1]
+  i = i.to_s.reverse.gsub(/...(?=.)/, '\& ').reverse
+  "#{i}.#{f}"
+end

data/lib/probaberry.rb

@@ -0,0 +1,3 @@
+require 'probaberry/counting'
+require 'probaberry/discrete'
+require 'probaberry/nice'

metadata

@@ -0,0 +1,47 @@
+--- !ruby/object:Gem::Specification
+name: probaberry
+version: !ruby/object:Gem::Version
+  version: 0.0.0
+platform: ruby
+authors:
+- Johnny Lee Othon
+autorequire: 
+bindir: bin
+cert_chain: []
+date: 2014-11-03 00:00:00.000000000 Z
+dependencies: []
+description: Do probabily homework with the console!
+email: jleeothon@outlook.com
+executables: []
+extensions: []
+extra_rdoc_files: []
+files:
+- lib/probaberry.rb
+- lib/probaberry/counting.rb
+- lib/probaberry/discrete.rb
+- lib/probaberry/nice.rb
+homepage: https://github.com/jleeothon/probaberry
+licenses:
+- MIT
+metadata: {}
+post_install_message: 
+rdoc_options: []
+require_paths:
+- lib
+required_ruby_version: !ruby/object:Gem::Requirement
+  requirements:
+  - - ">="
+    - !ruby/object:Gem::Version
+      version: '0'
+required_rubygems_version: !ruby/object:Gem::Requirement
+  requirements:
+  - - ">="
+    - !ruby/object:Gem::Version
+      version: '0'
+requirements: []
+rubyforge_project: 
+rubygems_version: 2.2.2
+signing_key: 
+specification_version: 4
+summary: Probability homework!
+test_files: []