Tagged Questions

Recursion is the process of repeating items in a self-similar way. A recursive definition (or inductive definition) in mathematical logic and computer science is used to define an object in terms of itself.
A recursive definition of a function defines values of the functions for some inputs in ...

I have a m×n chessboard and I have to put p rooks in the board so that no two of them are in attacking position.
(Two rooks attack each other if they are in the same row or same column)
How many ways ...

A balanced binary tree is a binary tree for which the difference in height between any node's two sub-trees is at most 1. (Such a tree is known as an AVL tree.)
What is the minimum number of leaves ...

$f(x)$ is going to be in the form $mx+h$ thus, $(mx+m+h)(mx+h) = ax^2+bx+c$. With basic algebra $m= \pm \sqrt{a}$. Also $(m+h)(h)=c$. I would guess that because $(m+h)h=c$ has two solutions max if $m$ ...

We want to demolish and move a bridge from one location to another.
The bridge is made out of $m$ road segments all connected $[0,1]$, $[1,2]$, $[2,3]$...$[m-1,m]$
We have a given function $f$ which ...

I need to approach the new position $(x_t,y_t)$ at moment $t$ of a moving object at $(x_0,y_0)$ given its horizontal velocity $vx_0$, its vertical velocity $vy_0$ and some constant resistance $r$ that ...

How many vertex-colorings with 3 colors has the cycle $C_n$?
How to build a recursive equation for the number of colorings over n?
I know that a cycle has either 2 or 3 colors. 2 when n is even and ...

Projections are said to allow us to use "any argument in any order", and the function below can be proved to be a PR function by projections and the composition rule.
Let $ i_0,\cdots,i_{m-1} \in n = ...

The Problem: On Venus, the Venusians use coins of these values [1, 6, 10, 19]. Use an algorithm to compute the minimum number of coins needed to make change for 42 on Venus. State which coins are used ...