python (65.1k questions)

javascript (44.2k questions)

reactjs (22.7k questions)

java (20.8k questions)

c# (17.4k questions)

html (16.3k questions)

r (13.7k questions)

android (12.9k questions)

Questions - induction

Induction proof of Perfect number

fun perfect(n) = let fun add_factors(n) = let fun f(i) = if n mod i = 0 then i else 0; fun sum(a, b) = if a > b then 0 ...
test-img

Artique

algorithm

sml

proof

induction

proof-of-correctness

Votes: 0

Answers: 0

How to prove that another definition of permutation is the same as the Default Permutation Library for COQ

I need to proove that a secondary definition of permutation is equivalent to the default definition of permutation in Coq: Down bellow is the default Permutation definition in Coq Inductive Permutatio...
test-img

Breno

permutation

coq

proof

induction

Votes: 0

Answers: 1

Latest Answer

Here is a proof that follows the strategy I outlined above: Lemma Permutation_to_perm l l' : Permutation l l' -> perm l l'. Proof. intros H. induction H as [| x l1 l2 _ IH | x y l | l1 l2 l3 _ IH1 ...
test-img

Arthur Azevedo De Amorim

Show that for any AVL tree with height h, all levels until h/2 are complete trees by induction

I was given this question on a test: "show by induction, that for a given AVL tree of height h, all levels of the tree until h/2 (round down) are complete binary trees". I wrote down the fol...
test-img

Yair

height

binary-search-tree

avl-tree

induction

Votes: 0

Answers: 1

Latest Answer

The proof you have presented is indeed correct if you add parentheses where they are missing, and a few other improvements. See what I updated in bold: base: h= 0-> then level 0/2 is complete bina...
test-img

trincot

Posts

Questions

Blogs

Jobs