1
vote
1answer
23 views

Approximating zeros on an interval

I'm writing a program for my AP Calculus class, and I'm trying to write an equation solver that approximates the zeros of functions. Right now it can take symbolic derivatives and evaluate functions. ...
1
vote
1answer
51 views

Jacobi Iteration Question

I have a question that says use a relative tolerance of $10^{-3}$ and asks if the estimate errors are in line with the actual errors. What does relative tolerance mean and how do you work out ...
2
votes
1answer
74 views

Bisection Method Question, Multiple Roots

I understand how to do the bisection method and how to do it with a point of intersection. My question is should this not actually have multiple points of intersection? and if you're not given any ...
1
vote
1answer
55 views

mortage with monthly payment - mathematical modeling

$Question:$ Suppose that $x_n$ is the amount owed on a mortgage after n years, $\$m$ is the monthly repayment and $r$ is the annual percentage interest rate charged on the amount of the mortgage ...
0
votes
0answers
111 views

Computation mathematics, sequences and roots

a) For $n=1,2,3..,$ let $I_n = \int_0^1 \frac{x^{n-1}}{2-x} dx$ Writing $x^n = x^{n-1}(2-(2-x))$, show that this sequence of numbers satisfies the recurrence relation: $I_{n+1} = 2I_n - ...
0
votes
1answer
120 views

Multi layer perceptron activation function

How can you show that the Fourier series approximation of a function (so $f(x)=\sum\limits_{n=0}^{\infty} (a_n cos(nx) + b_n sin(nx))$ can be approximated to arbitrary precision by a feedforward ...
0
votes
1answer
167 views

Simultaneous recursion

I have no idea how to even start proving the following theorem: If $f_0, f_1: \mathbb{N}^r \rightarrow \mathbb{N}$ and $g_0, g_1: \mathbb{N}^{r+3} \rightarrow \mathbb{N}$ are primitive recursive, ...
-1
votes
1answer
185 views

Best graphing program for Mac or PC?

I just bought the highest end iMac, with a student discount, of course, and was wondering what is the best graphing program out there. A program that can graph any equation that I throw at it AND one ...
3
votes
3answers
523 views

Understanding recursive definitions of a language.

I am having difficulty understanding the recursive definition of a language. The problem asked how to write this non recursively. But I want to understand just how a recursive definition of a ...
2
votes
1answer
120 views

Oracle turing machine

I am learning computational complexity and this is a question of my assignment that I have issues trying to solve/understand. An oracle Turing Machine M with oracle A is a Turing Machine with an ...
2
votes
1answer
434 views

Computational Complexity of Modular Exponentiation

The following was posted from a lecture: "($a^n \bmod N$) has a runtime complexity of $\mathcal{O}(n*|a|*|N|)$ using the brute force method. $Z_1 = a \bmod N$ $Z_2 = (aZ_1) \bmod N$ $Z_3 = (aZ_2) ...
1
vote
2answers
2k views

Notation : What is the meaning of the (mod n) in factoring algorithms?

Pretty much every thing is in the title, really! I'm trying to come up with an efficient algorithm to factorize large integer as an homework for a parallel programming course. I've seen a few pages ...