Advertisement
Guest User

Untitled

a guest
Jun 15th, 2019
96
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 0.61 KB | None | 0 0
  1. Number[] a = new Number[p + 1]; // range from 1 to p
  2.  
  3. ... some stuff to initialize a ...
  4.  
  5. Number[] ceps = new Number[Q + 1]; // range from 0 to Q
  6.  
  7. ceps[0] = ln(G);
  8. for (int q = 1; q <= p; q++) {
  9. Number sum = a[q];
  10. for (k = 1; k <= q - 1; k++) {
  11. sum += (k - q) / q * a[k] * ceps[q - k];
  12. }
  13. ceps[q] = sum;
  14. }
  15.  
  16. for (int q = p + 1; q <= Q; q++) {
  17. Number sum = 0;
  18. for (int k = 1; k <= p; k++) {
  19. sum += (k - q) / q * a[k] * ceps[q - k];
  20. }
  21. ceps[q] = sum;
  22. }
  23.  
  24. (k - q) / q * a[k] * ceps[q - k]
  25.  
  26. ((Number)(k - q))/((Number)q) * a[k] * ceps[q - k]
  27.  
  28. a[k] * ceps[q - k] * (k - q) / q
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement