TOPICS
Search

Search Results for ""


3351 - 3360 of 4428 for Combinations of operations on whole numb...Search Results
For any two nonzero p-adic numbers a and b, the Hilbert symbol is defined as (a,b)={1 if z^2=ax^2+by^2 has a nonzero solution; -1 otherwise. (1) If the p-adic field is not ...
A law is a mathematical statement which always holds true. Whereas "laws" in physics are generally experimental observations backed up by theoretical underpinning, laws in ...
The Littlewood conjecture states that for any two real numbers x,y in R, lim inf_(n->infty)n|nx-nint(nx)||ny-nint(ny)|=0 where nint(z) denotes the nearest integer function. ...
The next prime function NP(n) gives the smallest prime larger than n. The function can be given explicitly as NP(n)=p_(1+pi(n)), where p_i is the ith prime and pi(n) is the ...
Write the exact powers of 2 and 3 in sorted order as 1, 2, 3, 4, 8, 9, 16, 27, 32, ... (OEIS A006899), and let u_n be the nth term in the sequence. Then u_(n+1)-u_n tends to ...
The previous prime function PP(n) gives the largest prime less than n. The function can be given explicitly as PP(n)=p_(pi(n-1)), where p_i is the ith prime and pi(n) is the ...
The pseudosmarandache function Z(n) is the smallest integer such that sum_(k=1)^(Z(n))k=1/2Z(n)[Z(n)+1] is divisible by n. The values for n=1, 2, ... are 1, 3, 2, 7, 4, 3, 6, ...
A positive integer n>1 is quiteprime iff all primes p<=sqrt(n) satisfy |2[n (mod p)]-p|<=p+1-sqrt(p). Also define 2 and 3 to be quiteprimes. Then the first few quiteprimes ...
Pick two real numbers x and y at random in (0,1) with a uniform distribution. What is the probability P_(even) that [x/y], where [r] denotes the nearest integer function, is ...
The sequence 1, 2, 2, 3, 3, 3, 4, 4, 4, 4, ... (OEIS A002024) consisting of 1 copy of 1, 2 copies of 2, 3 copies of 3, and so on. Surprisingly, there exist simple formulas ...
1 ... 333|334|335|336|337|338|339 ... 443 Previous Next

...