Reputation
644
Next privilege 1,000 Rep.
Create tags
Badges
1 5 14
Newest
 Pundit
Impact
~11k people reached

Apr
21
comment Determine if the following is surjective
Just wondering, how come you used a greek eta symbol rather than a plain n? Not criticising, just curious if it has any special significance...
Apr
20
comment How many scientists can survive?
"hopefully clever enough" if they aren't, the 99 scientists die in confusion while the first one dies in vain.
Apr
5
comment Satisfying inequality of large powers
@pyrazolam "up to about 13" how convenient... :D
Mar
30
comment Is the statement always true?
Likely the span of $\{ u, v, w \}$, but yeah it's unclear.
Mar
23
comment What would be the immediate implications of a formula for prime numbers?
How exactly does the ability to generate the $n$th prime in $O(\log n)$ time (assuming it was possible) lead to a break of RSA?
Mar
23
comment Who discovered the first explicit formula for the n-th prime?
The formula here doesn't actually give any insight into computing the $n$th prime efficiently, all it does is encode (obfuscate?) the process of trial division, or something related, into an unreadable mathematical expression. The presence of floor operations and sums (which are a cute but in this context uninteresting way to emulate conditionals and loops) give it away.
Mar
20
awarded  Pundit
Mar
20
comment Putnam 2009 B1 (rational number as factorial)
@Amad27 Did you see the corollary in Hagen's answer? Its very easy (trivial?) to extend the result for primes to positive rationals.
Mar
19
awarded  Citizen Patrol
Mar
10
comment Is every composite number the average of two primes?
@ColeJohnson Goldbach's asserts that any even number $2n$ can be written as the sum of two primes. But since OP restricts $n$ to be composite, OP's conjecture is less strong than Goldbach's conjecture, for e.g. Goldbach's states that $2 \cdot 7 = 14$ can be written as the sum of two primes, whereas OP's conjecture says nothing about $n = 7$ since $7$ is not composite.
Mar
1
comment What is the word for set containing other sets?
I think you made a typo, should be "if $S$ "contains" $x$"?
Feb
23
awarded  Yearling
Feb
23
answered Is Fermat's Little Theorem possible over additive group?
Feb
23
comment Is there a one-to-one function from the natural numbers to the primes?
Perhaps relaxing injectivity to the range of $f$ being infinite (to only allow "interesting" functions $f$ that produce infinitely many possible primes and forbid stupid $f$'s like constant functions) might make the problem easier?
Feb
17
comment What is this property called for a function? $f(f(x))=f(x)$
The identity function is idempotent too :D
Feb
12
comment Using Newtons Method to approximate intersection of Graphs
$X_0 = 0$ sends you to infinity? Are you sure you have the right derivative?
Feb
11
asked Plotting exponential partial sums in the complex plane
Feb
4
awarded  Nice Answer
Jan
19
comment Is there a polynomial-time algorithm to find a prime larger than $n$?
(technically, it is probabilistic, but takes finite time and always returns a prime along with a provable primality certificate)
Jan
19
comment Is there a polynomial-time algorithm to find a prime larger than $n$?
Is this asking whether to find the next prime larger than $n$, or drawing a prime larger than $n$ following a specific distribution? Because if not, Maurer's algorithm with a suitable lower bound should get the job done.