M Dash Foundation: C Cube Learning

Tag: powerfree numbers..

  • Proof of Fermat’s theorem in a few lines

    This is valid till the prime number 5 is sufficient to test the powerfreeness of another integer. {m,n,k} are numbers/integers in the vicinity and for very high powers in Fermat’s theorem one needs higher prime numbers. This theorem has been evidently tested for small powers.

  • new inventions in number theory .. [summary]

    1. a number is not a power of 6 if it’s last two digits are not one of these: 16, 36, 56, 76 or 96, always … OR integer whose 2nd digit to left from right is any odd numbers less than 10 (1,3,5,7..etc) 2. a number is not a power of 5 if it’s…

  • Interesting observations in number theory

    (perhaps never known before at-least most of these) I will post another article for my 50cent theorem and related facts an interesting pattern for powers of 6: (6^2 .. 6^3.. 6^12), the last two digits you get by subtracting 20, for all powers from 2 to 12 and more The last two digits I have…