Results 1 to 1 of 1

Thread: Proving Ƭ(n)?

LinkBack
- LinkBack URL
- About LinkBacks
Thread Tools
- Show Printable Version
- Subscribe to this Thread…
Display
- Linear Mode
- Switch to Hybrid Mode
- Switch to Threaded Mode

September 1st 2012, 04:58 AM #1

siruka

Newbie

Joined

Aug 2012

From

here and there

Posts

4

Proving Ƭ(n)?

Prove that φ (n) + σ (n) = nƬ(n) if and only if n is a prime.

Follow Math Help Forum on Facebook and Google+

« Riemann's Zeta Series | proving floor function? »

Similar Math Help Forum Discussions

Proving a|(b+c) and a|b, then a|c

Posted in the Discrete Math Forum

Replies: 3
Last Post: October 10th 2010, 04:09 PM
proving

Posted in the Number Theory Forum

Replies: 9
Last Post: October 25th 2009, 08:27 AM
Proving an identity that's proving to be complex

Posted in the Trigonometry Forum

Replies: 1
Last Post: July 21st 2009, 01:30 PM
Proving

Posted in the Advanced Algebra Forum

Replies: 1
Last Post: May 6th 2009, 04:29 AM
Proving sin 15 deg

Posted in the Trigonometry Forum

Replies: 2
Last Post: January 18th 2009, 05:30 AM

Search Tags

Ƭn, proving

Copyright © 2005-2013 Math Help Forum. All rights reserved.