Reputation
1,851
Top tag
Next privilege 2,000 Rep.
Edit questions and answers
Badges
10 13
Newest
 Enlightened
Impact
~16k people reached

  • 0 posts edited
  • 0 helpful flags
  • 105 votes cast
Mar
3
comment Is $53$ expressible in this form?
Ark I used PARI GP, the powers of 3 mod 117 are just 3,9,27,81 and the powers of 2 are 1, 2, 4, 8, 11, 16, 22, 32, 44, 59, 64, 88 so it is easy to check
Mar
3
revised Is $53$ expressible in this form?
added 551 characters in body
Mar
3
answered Is $53$ expressible in this form?
Feb
5
awarded  Enlightened
Feb
5
awarded  Nice Answer
Jan
3
answered Algorithm to find maximum possible value of the minimum expression in a list
Dec
20
awarded  Constituent
Dec
16
awarded  Caucus
Dec
5
answered Upper limit for the Divisor function
Nov
8
awarded  Yearling
Oct
21
comment Proof of $p_n<n^2$ by Elementary Means
The statement is not true for $p_1=2$, so you need an exception for that case.
Sep
26
revised Infinitely many primes congruent to 1 mod prime
The proof was incomplete
Sep
26
comment Infinitely many primes congruent to 1 mod prime
You are right the proof is incomplete, let me think if I can find a way to patch it otherwise I will remove it.
Sep
5
comment Number of pairs $(i, j)$ where $1\leq i < j \leq N$ such that $i|j$
Thanks for your comments, I've edited the answer with your sugestions.
Sep
5
revised Number of pairs $(i, j)$ where $1\leq i < j \leq N$ such that $i|j$
added 148 characters in body
Sep
5
revised Number of pairs $(i, j)$ where $1\leq i < j \leq N$ such that $i|j$
Improved the image and hopefully the explanation
Sep
5
answered Number of pairs $(i, j)$ where $1\leq i < j \leq N$ such that $i|j$
Jul
22
answered Sizes of Blocks of Consecutive Integers Divisible by at Least One Prime Less than or Equal to $r$.
Jun
1
answered Infinitely many primes congruent to 1 mod prime
May
12
comment Euler's Refutation of Fermat's Conjecture
Fermat statement was about the integers $2^{2^n}+1$.