The function f is defined by f (x) = 3x² +7.
Find f(5y)
f(5y)=

i think it's eleven too, don't woosh me here, but according to the "experts" it's 2.

the proof starts from the peano postulates, which define the natural

numbers n. n is the smallest set satisfying these postulates:

  p1.   1 is in n.

  p2.   if x is in n, then its "successor" x' is in n.

  p3.   there is no x such that x' = 1.

  p4.   if x isn't 1, then there is a y in n such that y' = x.

  p5.   if s is a subset of n, 1 is in s, and the implication

      (x in s => x' in s) holds, then s = n.

then you have to define addition recursively:

  def: let a and b be in n. if b = 1, then define a + b = a'

      (using p1 and p2). if b isn't 1, then let c' = b, with c in n

      (using p4), and define a + b = (a + c)'.

then you have to define 2:

  def:   2 = 1'

2 is in n by p1, p2, and the definition of 2.

theorem:   1 + 1 = 2

proof: use the first part of the definition of + with a = b = 1.

      then 1 + 1 = 1' = 2   q.e.d.

note: there is an alternate formulation of the peano postulates which

replaces 1 with 0 in p1, p3, p4, and p5. then you have to change the

definition of addition to this:

  def: let a and b be in n. if b = 0, then define a + b = a.

      if b isn't 0, then let c' = b, with c in n, and define

      a + b = (a + c)'.

you also have to define 1 = 0', and 2 = 1'. then the proof of the

theorem above is a little different:

proof: use the second part of the definition of + first:

      1 + 1 = (1 + 0)'

      now use the first part of the definition of + on the sum in

      parentheses:   1 + 1 = (1)' = 1' = 2   q.e.d.

step-by-step explanation:

one day the were 5 ducks, and their king told them to multiply their kingdom. so each went their own seperate way and met 4 other ducks on their journey.

when the ducks returned to their kingdom, it was discovered that there were 5 groups of 5 ducks. when the kind counted the number of ducks in total (including the ones he sent out earlier) he counted 25.

therefore 5 times 5 is 25.

the end. : )

you are playing an adventure game on your computer. you come across a troll who won't let you pass and there is no other way to get to the other side of the river except over the bridge he is guarding.

the troll is a nerd. he takes great delight in watching people struggle with his problems. very few get them. he only gives you one chance and then he changes the puzzle. you have to solve this one.

before you are four blocks. they are numbered 11,6, -7,21.

he tells that the answer he wants is minus and between -1 and - 2. you can use +, -, ×, ÷   ( and ) as many times as you like or no times at all. you don't like the way he's looking at you, but you need to cross the bridge. what do you do?