Search Results for ""

Let Omega be a bounded open set in R^d whose boundary partialOmega is at least C^1 smooth and let T:C_c^1(Omega^_)->L^p(partialOmega) (1) be a linear operator defined by ...

Let a vault consist of two equal half-cylinders of radius r which intersect at right angles so that the lines of their intersections (the "groins") terminate in the ...

Find nontrivial solutions to sigma(x^2)=sigma(y^2) other than (x,y)=(4,5), where sigma(n) is the divisor function. Nontrivial solutions means that solutions which are ...

The conjugate gradient method is an algorithm for finding the nearest local minimum of a function of n variables which presupposes that the gradient of the function can be ...

The 6.1.2 equation A^6=B^6+C^6 (1) is a special case of Fermat's last theorem with n=6, and so has no solution. No 6.1.n solutions are known for n<=6 (Lander et al. 1967; Guy ...

A (k,l)-multigrade equation is a Diophantine equation of the form sum_(i=1)^ln_i^j=sum_(i=1)^lm_i^j (1) for j=1, ..., k, where m and n are l-vectors. Multigrade identities ...

Pre-Calculus

A p-adic number is an extension of the field of rationals such that congruences modulo powers of a fixed prime p are related to proximity in the so called "p-adic metric." ...

As a consequence of Matiyasevich's refutation of Hilbert's 10th problem, it can be proved that there does not exist a general algorithm for solving a general quartic ...

As a part of the study of Waring's problem, it is known that every positive integer is a sum of no more than 9 positive cubes (g(3)=9), that every "sufficiently large" ...