class IntWrapper(n:scala.Int) {
 def isPrime(n:Int): Boolean = (n != 1) &&
   (List.range(2,math.sqrt(n).toInt+1) forall (i => n % i != 0))
 def sieve(s: Stream[Int]): Stream[Int] =
   Stream.cons(s.head, sieve(s.tail filter (_ % s.head != 0)))

 val ps = sieve(Stream.from(2))
 def primeFactors: List[Int] = {
   def primeFactorsR(n: Int, ps: Stream[Int]): List[Int] =
     if (isPrime(n)) List(n)
     else if (n % ps.head == 0) ps.head :: primeFactorsR(n / ps.head, ps)
     else primeFactorsR(n, ps.tail)
   primeFactorsR(n, ps)
 }
}

implicit def int2IntWrapper(n:scala.Int) = new IntWrapper(n)

println("s35: " + 315.primeFactors)

def sieve(s: Stream[Int]): Stream[Int] =
   Stream.cons(s.head, sieve(s.tail filter (_ % s.head != 0)))

val ps = sieve(Stream.from(2))

import scala.swing._

object FirstSwingApp extends SimpleSwingApplication {
  def top = new MainFrame {
    title = "First Swing App"
    contents = new Button {
      text = "Click me"
    }
  }
}

class IntWrapper(n:scala.Int){
  def gcd(a:scala.Int, b:scala.Int): scala.Int =  if (b == 0) a else gcd(b, a % b)
  def isCoprimeTo(i:scala.Int): Boolean = gcd(n,i) == 1
  def totient: scala.Int = (1 to n) filter {(new IntWrapper(n)).isCoprimeTo(_)} length
}

implicit def int2IntWrapper(n:scala.Int) = new IntWrapper(n)

println("s33: " + 35.isCoprimeTo(64))
println("s34: " + 10.totient)

scala> def gcd(a:Int, b:Int): Int =  if (b == 0) a else gcd(b, a % b)
gcd: (a: Int, b: Int)Int

scala> gcd(36,63)
res0: Int = 9

$ scala p32.scala 
/Users/kzfm/scala/p32.scala:2: error: value % is not a member of Int
def gcd(a:Int, b:Int): Int =  if (b == 0) a else gcd(b, a % b)

/Users/kzfm/scala/p32.scala:4: error: type mismatch;
 found   : scala.Int(36)
 required: Int
println(gcd(36, 63))

def gcd(a:scala.Int, b:scala.Int): scala.Int =  if (b == 0) a else gcd(b, a % b)

println(gcd(36, 63))