Use flip() 32 times (or 64 or whatever multiple of 32 pleases you) and glue the bits together to form a integer X. Let's say M is the highest multiple of N representable on 32 bits. Do this until X <= M. Now, if X divides by N, return Heads. Otherwise, return Tails.

int baisedFlip(h) { int t = h, k = 0; while (t >>= 1) { k = (k h) { return biasedFlip(h); } else if (k == h) { return true; } else { return false; } }

int biasedFlip(h){ }

int biasedFlip(int n){ }

@Me you need to use the flip() method Boolean biasedFlip(int i){ Boolean result = true; for (int j=0; j

biasedCoin(int n){ int new = Math.Random()*n; if(new==1) return true } return false }