找回密码
 快速注册
搜索
查看: 88|回复: 4

Mathematica 13

[复制链接]

3149

主题

8386

回帖

6万

积分

$\style{scale:11;fill:#eff}꩜$

积分
65391
QQ

显示全部楼层

hbghlyj 发表于 2022-7-8 23:56 |阅读模式
本帖最后由 hbghlyj 于 2022-12-17 12:41 编辑

freakedsmiley[1].png 以前12用ibug这里的可以激活(根据MathId算出来的),刚才下载了Mathematica 13,用生成的激活码竟失败了.
ibug这里的注册机是完全用Javascript实现的:
function f1(n, byte, c) {
for (var bitIndex = 0; bitIndex <= 7; bitIndex++) {
var bit = (byte >> bitIndex) & 1;
if (bit + ((n - bit) & ~1) === n) {
n = (n - bit) >> 1;
} else {
n = ((c - bit) ^ n) >> 1;
}
}
return n;
}
function genPassword(str, hash) {
for (var byteIndex = str.length - 1; byteIndex >= 0; byteIndex--) {
hash = f1(hash, str.charCodeAt(byteIndex), 0x105C3);
}
var n1 = 0;
while (f1(f1(hash, n1 & 0xFF, 0x105C3), n1 >> 8, 0x105C3) !== 0xA5B6) {
if (++n1 >= 0xFFFF) {
return "Error";
}
}
n1 = Math.floor(((n1 + 0x72FA) & 0xFFFF) * 99999.0 / 0xFFFF);
var n1str = ("0000" + n1.toString(10)).slice(-5);
var temp = parseInt(n1str.slice(0, -3) + n1str.slice(-2) + n1str.slice(-3, -2), 10);
temp = Math.ceil((temp / 99999.0) * 0xFFFF);
temp = f1(f1(0, temp & 0xFF, 0x1064B), temp >> 8, 0x1064B);
for (byteIndex = str.length - 1; byteIndex >= 0; byteIndex--) {
temp = f1(temp, str.charCodeAt(byteIndex), 0x1064B);
}
var n2 = 0;
while (f1(f1(temp, n2 & 0xFF, 0x1064B), n2 >> 8, 0x1064B) !== 0xA5B6) {
if (++n2 >= 0xFFFF) {
return "Error";
}
}
n2 = Math.floor((n2 & 0xFFFF) * 99999.0 / 0xFFFF);
var n2str = ("0000" + n2.toString(10)).slice(-5);
return n2str[3] + n1str[3] + n1str[1] + n1str[0] + "-"
+ n2str[4] + n1str[2] + n2str[0] + "-"
+ n2str[2] + n1str[4] + n2str[1] + "::1";
}
function checkMathId(s) {
if (s.length != 16)
return false;
for (let i = 0; i < s.length; i++) {
if (i === 4 || i === 10) {
if (s[i] !== "-")
return false;
} else {
if ("0123456789".search(s[i]) < 0)
return false;
}
}
return true;
}
function genActivationKey() {
s = "";
for (let i = 0; i < 14; i++) {
s += Math.floor(Math.random() * 10);
if (i === 3 || i === 7)
s += "-";
}
return s;
}
document.getElementById("generate").addEventListener("click", function () {
var mathId = document.getElementById("mathId").value.trim();
if (!checkMathId(mathId)) {
document.getElementById("result").innerText = "Bad MathID!";
} else {
var activationKey = genActivationKey();
var magicNumbers;
var software = document.querySelector("input[name=product]:checked").value;
if (software === "mma12" || software === "mma13") {
magicNumbers = [10690, 12251, 17649, 24816, 33360, 35944, 36412, 42041, 42635, 44011, 53799, 56181, 58536, 59222, 61041];
} else if (software === "sm12") {
magicNumbers = [4912, 4961, 22384, 24968, 30046, 31889, 42446, 43787, 48967, 61182, 62774];
} else {
document.getElementById("result").innerHTML = `<p>Unknown software suite: ${software}.</p>`;
return;
}
var magicNumber = magicNumbers[Math.floor(Math.random() * magicNumbers.length)]
var password = genPassword(mathId + "$1&" + activationKey, magicNumber);
document.getElementById("result").innerHTML = `
<p>
<b>Activation Key</b>: ${activationKey}
<br>
<b>Password</b>: ${password}
</p>
<p>Don't forget to share your feelings below. Thanks for using!</p>
<p>Need a VPN to get past GFW? Check out <a href="https://blinkload.me/">Blinkload</a> for free &amp; fast global internet access!</p>
<p>Please consider purchasing the software if you find it helpful to you. Support genuine software!</p>
`;
}
});

3149

主题

8386

回帖

6万

积分

$\style{scale:11;fill:#eff}꩜$

积分
65391
QQ

显示全部楼层

 楼主| hbghlyj 发表于 2022-7-9 00:14
本楼是codemirror的css


3149

主题

8386

回帖

6万

积分

$\style{scale:11;fill:#eff}꩜$

积分
65391
QQ

显示全部楼层

 楼主| hbghlyj 发表于 2022-12-17 19:46
以前12用ibug这里的可以激活(根据MathId算出来的),刚才下载了Mathematica 13,用生成的激活码竟失败了.
This page is last updated on Oct 3, 2022
Wolfram Mathematica 13 Key Generator Online

3149

主题

8386

回帖

6万

积分

$\style{scale:11;fill:#eff}꩜$

积分
65391
QQ

显示全部楼层

 楼主| hbghlyj 发表于 2022-12-17 19:48
Stable release        13.2.0 (December 14, 2022)
Stephen Wolfram-The Latest from Our R&D Pipeline: Version 13.2 of Wolfram Language & Mathematica

Dramatically Faster Polynomial Operations
Factoring this isn’t an easy computation, and in Version 13.1 takes about 19 seconds:

But now, in Version 13.2, the same computation takes 0.3 seconds—nearly 60 times faster:

Version 13.2 also adds a polynomial feature for which I, for one, happen to have been waiting for more than 30 years: multivariate polynomial factoring over finite fields:

3149

主题

8386

回帖

6万

积分

$\style{scale:11;fill:#eff}꩜$

积分
65391
QQ

显示全部楼层

 楼主| hbghlyj 发表于 2023-4-2 04:11
本帖最后由 hbghlyj 于 2023-4-3 13:26 编辑 Mathematica 激活指南

Mathematica 软件下载

手机版|悠闲数学娱乐论坛(第3版)

GMT+8, 2025-3-4 12:33

Powered by Discuz!

× 快速回复 返回顶部 返回列表