TOPICS
Search

Search Results for ""


661 - 670 of 2513 for mathematical modelSearch Results
The case of the Weierstrass elliptic function with invariants g_2=0 and g_3=1. The corresponding real half-period is given by omega_2 = (Gamma^3(1/3))/(4pi) (1) = ...
Erdős and Heilbronn (Erdős and Graham 1980) posed the problem of estimating from below the number of sums a+b where a in A and b in B range over given sets A,B subset= Z/pZ ...
There are infinitely many primes m which divide some value of the partition function P.
A conjecture due to Paul Erdős and E. G. Straus that the Diophantine equation 4/n=1/a+1/b+1/c involving Egyptian fractions always can be solved (Obláth 1950, Rosati 1954, ...
The central binomial coefficient (2n; n) is never squarefree for n>4. This was proved true for all sufficiently large n by Sárkőzy's theorem. Goetgheluck (1988) proved the ...
The second-order ordinary differential equation y^('')+2xy^'-2ny=0, (1) whose solutions may be written either y=Aerfc_n(x)+Berfc_n(-x), (2) where erfc_n(x) is the repeated ...
Given a formula y=f(x) with an absolute error in x of dx, the absolute error is dy. The relative error is dy/y. If x=f(u,v,...), then ...
The sequence of numbers obtained by letting a_1=2, and defining a_n=lpf(1+product_(k=1)^(n-1)a_k) where lpf(n) is the least prime factor. The first few terms are 2, 3, 7, 43, ...
An Euler number prime is an Euler number E_n such that the absolute value |E_n| is prime (the absolute value is needed since E_n takes on alternating positive and negative ...
Let a prime number generated by Euler's prime-generating polynomial n^2+n+41 be known as an Euler prime. (Note that such primes are distinct from prime Euler numbers, which ...
1 ... 64|65|66|67|68|69|70 ... 252 Previous Next

...