BeetleTheNeato

156 reputation

bio	website
	location
	age	26
visits	member for	10 months
	seen	May 3 at 18:16
stats	profile views	7

I have a question.

	156 reputation	bio	website		visits	member for	10 months
5 badges		location			seen	May 3 at 18:16

summary answers questions tags badges favorites bounties reputation activity

30 Actions

suggestions reviews revisions comments badges posts accepts all

Apr 23	comment	Prove that $\gcd(a^n - 1, a^m - 1) = a^{\gcd(n, m)} - 1$ This is an awesome resource! Do you have more like this?
Apr 23	comment	Proof involving division algorithm Thanks, I'm studying it.
Apr 23	revised	Proof involving division algorithm Added 'homework' tag
Apr 23	asked	Proof involving division algorithm
Apr 14	awarded	Commentator
Apr 14	comment	Using Bézout's Identity to prove that given $\gcd$ of two numbers is really true I'm still struggling to fully understand it, but I think you've answered my question, so I accepted your answer. Thanks a lot.
Apr 14	accepted	Using Bézout's Identity to prove that given $\gcd$ of two numbers is really true
Apr 13	comment	Using Bézout's Identity to prove that given $\gcd$ of two numbers is really true Three days and several pages later, I can say I don't understand it. For example, why do you start the proof with a multiple of $(n!+1)$? And, more importantly, I don't understand what seems to be the main argument: "if d divides n!+1 and n, it divides 1." Why?
Apr 10	comment	Using Bézout's Identity to prove that given $\gcd$ of two numbers is really true @p and @andre-nicolas, what you did is really helping. I'm almost understanding it. I would keep trying today, but I must sleep. I'm taking notes of both your results to think more about it in the morning, after class, since I'll have access to internet only tomorrow afternoon. Thanks.
Apr 10	revised	Using Bézout's Identity to prove that given $\gcd$ of two numbers is really true What I meant by "Bézout's Theorem" was in fact "Bézout's Identity", sorry.
Apr 10	asked	Using Bézout's Identity to prove that given $\gcd$ of two numbers is really true
Apr 4	accepted	Representing positions on a grid as a base-3 number
Apr 4	comment	Representing positions on a grid as a base-3 number Ok, I guess I understand what makes base-3 numbers so convenient. Correct me if I'm wrong. I could very well read the numbers on the grid as base-10 numbers. But then, there would be "jumps" as I count upwards. All the possible positions of the numbers would still make 19683 possibilities, but in base-10, I wouldn't be able to count sequentially from 0 to 222,222,222. I would have to "jump" all the numbers that have the digits 3-9. Base-3 is convenient because I can increment one by one and list all the combinations. Is that right?
Apr 4	awarded	Supporter
Apr 4	asked	Representing positions on a grid as a base-3 number
Oct 27	accepted	Relationship between the sides of inscribed polygons
Oct 27	comment	Relationship between the sides of inscribed polygons Sadly, the book proves the formula using trigonometry. It does mention that the same result can be achieved using square triangles but then it moves on to this method of calculating pi. I'd really like a proof using geometry because I have trouble picturing the figures. I'll search it. Thanks again.
Oct 27	comment	Relationship between the sides of inscribed polygons Could you please talk more about "degenerate polygons"? Or point me to resources about that? Because, although I'll not quote it here, the book explicitly tells that $l_{4}=R\sqrt2$ follows from that formula. Thanks!
Oct 27	asked	Relationship between the sides of inscribed polygons
Oct 4	comment	Rectangular problem Please, check my solution. I used the parallel lines you told me. I would still like to see the proof to $AP^2 + CP^2 = BP^2 + DP^2$ because I couldn't find that.