network profile
| bio | website | |
|---|---|---|
| location | ||
| age | ||
| visits | member for | 8 months |
| seen | May 15 at 15:37 | |
| stats | profile views | 6 |
|
Sep 13 |
awarded | Supporter |
|
Sep 13 |
accepted | Power Variant of Fibonacci sequence |
|
Sep 13 |
comment |
Power Variant of Fibonacci sequence Nice one! I will try that. I guess we can just use 2*2 matrix exponentiation. |
|
Sep 13 |
asked | Power Variant of Fibonacci sequence |
|
Sep 12 |
accepted | Mix of Modulus and Division |
|
Sep 7 |
answered | Mix of Modulus and Division |
|
Sep 5 |
comment |
Mix of Modulus and Division Actually I wanted to calculate the value of the function given in math.stackexchange.com/questions/190443/…. In that result there is division operation. And Modulus operation has to be performed before division in calculation the Lucas number and Fibonacci number. |
|
Sep 5 |
comment |
Mix of Modulus and Division @HagenvonEitzen Yes, x is proper divisor of N. And yeah, required is (N/x)%MOD. |
|
Sep 5 |
asked | Mix of Modulus and Division |
|
Sep 4 |
comment |
Number of Divisor I got the idea for the above variant also. |
|
Sep 4 |
comment |
Number of Divisor Thanks a lot! I understood the mistake I made. Out of curiosity , may I ask a small variant of the above.. is it possible to find the "number of divisors of n which are not divisible by k" by simple methods? |
|
Sep 4 |
comment |
Number of Divisor @KirkBoyer Yeah, Gerry is right. I want the divisors of n that are divisible by k. That is k dividing d. |
|
Sep 4 |
awarded | Scholar |
|
Sep 4 |
accepted | Number of Divisor |
|
Sep 3 |
awarded | Student |
|
Sep 3 |
asked | Number of Divisor |
