Channel Avatar

Me Asthmatic_M@thematics. @UC48d9QL_P2ec2YQBt70nxFw@youtube.com

4.1K subscribers - no pronouns :c

Hey guys, Welcome to my maths channel๐Ÿ™๐Ÿ™ Here I do upload


Welcoem to posts!!

in the future - u will be able to do some more stuff here,,,!! like pat catgirl- i mean um yeah... for now u can only see others's posts :c

Me Asthmatic_M@thematics.
Posted 1 week ago

190700131099241420990620241899051417
4000
1820011802170801041718
Decrypt this message ๐Ÿ˜...๐Ÿ‘‹

1 - 0

Me Asthmatic_M@thematics.
Posted 1 month ago

Dear Enthusiast, I bring for you an interesting method of finding divisors of any numbers.
Say , for n= 99 ,this can be written as n=3ร—3ร—11 by Fundamental Theorem of Arithmetic.
Now, let's say the number of divisors are expressed by d(n), then d(n)= d(p1ร—p2ร—......ร—pk)
= (1+1)ร—(1+1)ร—(1+1).....(1+1) (k times)
This is only for the case if exponent = 1. If exponent>1 then, d(n) = d(p1^k + p2^s+....) =( k+1)ร—(s+1)...
Here in my example,d(99)= d(3^2 ร—11) = (2+1)ร— (1+1)=6.
Therefore, the number of divisors of 99 is 6 i.e 1, 3, 9, 11, 33 and 99.

If you like such type of discussion in this community then LIKE , SHARE and SUBSCRIBE . And also comment your view. ๐Ÿ‘
Bye bye and Good night.

โ€ช@measthmatic_mathematics.โ€ฌ

4 - 1

Me Asthmatic_M@thematics.
Posted 2 months ago

If a function f is partially differentiated then the function is

0 - 1

Me Asthmatic_M@thematics.
Posted 2 months ago

Hey Guys , How was the day ? Today I share you something really crazy maths theorem that's given by Leonard Euler. It's something like this,
If n>= 1 and gcd (a,n)= 1, then a^phi(n) congruent to 1 (mod n). Phi(n) means the number of relatively prime numbers to n.
This is the generalized form of Fermats theorem where Fermats gave this same theorem for prime numbers.
But the main question is where we could use this all theorem. This has really crazy applications, I mean to say ,you see below I post a screenshot of a calculation that made in a digital calculator, but the same stuff could be done by using this theorem that means we can find the last digit of any large powers (a^n), where gcd(a,n) should be 1. By normal calculation we may not be able to find such things in few steps in maths without using the above theorem or if to say without our greatest mathematicians such work. We should always owe to them... ๐Ÿ™
Have a good day and Good night..... โค๏ธ
And yeah stay tuned although I am not able to upload video regularly.

8 - 0

Me Asthmatic_M@thematics.
Posted 2 months ago

The graph of a Quadratic equation is _________?

3 - 0

Me Asthmatic_M@thematics.
Posted 2 months ago

Sin^-1 (1/x) =? , where x belongs to [-1,1].

3 - 6

Me Asthmatic_M@thematics.
Posted 3 months ago

#78th๐Ÿ‡ฎ๐Ÿ‡ณ๐ŸŽ†

8 - 0

Me Asthmatic_M@thematics.
Posted 3 months ago

Can we write |x| = x^2 ?๐Ÿค”

6 - 7