Woett
|
Registered User
|
Undergraduate at Utrecht University
|
|
May 17 |
comment |
Is there any proof that you feel you do not “understand”? Any proof I feel I don't understand? How about well over 95% of all proofs I read.. |
|
Mar 27 |
awarded | ● Popular Question |
|
Mar 21 |
answered | Are there results in “Digit Theory”? |
|
Mar 6 |
awarded | ● Popular Question |
|
Mar 4 |
comment |
long enough interval of integers to solve a simultaneous congruence My first idea would be to simply use induction. Maybe first on $k$ and then on $|A_k|$. Can anyone convince me this is bound to fail? |
|
Mar 4 |
comment |
Divisibility in a set Idea: prove that we may assume there exists at least k mutually coprime integers and invoke CRT. |
|
Jan 17 |
comment |
Estimate on radical of $2^n \pm 1$ According to 'On the largest prime factor of the Mersenne Numbers', written by Ford, Luca, and Shparlinski, Schinzel proves in 'On primitive prime factors of $a^n - b^n$' that the largest prime factor of $2^n-1$ is at least $2n-1$ for all $n \ge 13$. |
|
Dec 20 |
awarded | ● Necromancer |
|
Dec 7 |
comment |
Ratio of consecutive divisors and average No, I am not correct. This conjecture has been proven by Maier and Tenenbaum in in their 1984 paper 'on the set of divisors of an integer', which was published in Invent. Math. |
|
Dec 7 |
comment |
Ratio of consecutive divisors and average It is an old conjecture from Erdös (that is, afaik, still open) that almost all integers $n$ have two divisors $d_1$ and $d_2$ with $d_1 < d_2 < 2d_1$. |
